Automatic K adjacent local search heredity clustering method for graphic image
A technology of local search and graphic image, which is applied in the field of image processing, can solve the problems that the number of clusters cannot be obtained, the number of clusters cannot be obtained, and the algorithm is easy to fall into local optimum.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0047] refer to figure 1 , the realization of the present invention comprises the following steps:
[0048] Step 1: Input N images S to be clustered i ,i=1,...,N, use the canny operator to detect the edge of each image respectively, and obtain the contour image I of each image to be clustered i , in this example, N is 30 but not limited to 30. The canny operator was proposed by John Canny in 1986.
[0049] Step 2: For each contour image I i Perform uniform sampling along its contour line, and express the sampled contour point P in Cartesian coordinates ij =(x ij ,y ij ), i=1,...,N, j=1,...,M, among them, P ij Indicates the jth point of the i-th contour image obtained by sampling, x ij ,y ij are contour points P ij The horizontal and vertical coordinates of the position, M=100 is the number of sampling points.
[0050] Step 3: Calculate the distance between any two images to be clustered.
[0051] 3.1) Describe the contour image I with the shape context method i , g...
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