Rapid graph matching and recognition method based on skeleton graphs
A skeleton diagram and graphics technology, applied in character and pattern recognition, instruments, computer components, etc., can solve the problems of low matching efficiency, complex graphics without recognition effect, high time complexity, etc., and achieve the goal of reducing time complexity Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0038] The problem of pattern matching and recognition can be abstracted as the problem of extracting pattern eigenvectors and calculating the similarity of eigenvectors.
[0039] refer to figure 1 , the specific implementation steps of graphic matching and recognition based on the skeleton graph designed by the present invention are as follows:
[0040] Step 1: Input N images S of the graph dataset i , i=1,2,...,N, since the input image is a binary image, directly use the canny edge detection operator to extract the contour C of each image i , i=1,2,...,N. Among them, the canny detection operator was proposed by John Canny in 1986.
[0041] Step 2: Contour C of the graph i Perform clockwise uniform sampling to obtain M sampling points P at equal intervals ij (j=1,2,...,M):
[0042] (2a) Arrange the contour points on the graph clockwise from the lower left corner of the graph to form a one-dimensional vector C i ={c i1 ,c i2 ,...,c im}(m is the number of contour poin...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com