Polar coordinate edge coding method based on circular model
A technology of edge coding and polar coordinates, applied in the field of edge coding of edge contour maps, can solve problems such as redundancy, large information, and low sensitivity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment approach 1
[0078] Specific embodiment one: a kind of polar coordinate edge coding method based on the circle model described in this embodiment includes the following steps:
[0079] Step 1. Convert the image into a high-quality edge contour map. Since edge coding only requires the edge information of the image, it is necessary to de-content the image, and the quality of the edge contour image has an impact on the final coding result, so extract high The high-precision edge contour map is necessary. When obtaining the high-precision edge contour map in this embodiment, firstly, the preliminary edge contour map is obtained by conventional methods, and then the LOG operator and edge fitting are used to complete the acquisition of the high-precision edge contour map; then Solve the farthest distance D(o) between two points on the border of the edge contour map, and find the coordinates of the center point o of the line segment,
[0080] D(o)=max(||(x i -x j ),(y i -y j )|| 2 )
[0081...
specific Embodiment approach 2
[0122] Specific embodiment 2: This embodiment is a further limitation of the polar coordinate edge coding method based on the circle model described in Embodiment 1. In this embodiment, the method also includes:
[0123] Step 6. Obtain the original code, carry out sequential differential differentiation on the original code, and then perform minimum principle normalization to obtain the normalized differential code corresponding to the original code, and then perform complement code calculation on the normalized differential code:
[0124] n-direction normalized differential code:
[0125] the s i =(a i+1 ) n -(a i ) n
[0126] n+1=0
[0127] the s n =(a 0 ) n -(a n ) n
[0128] n-complement code:
[0129]
[0130] Among them: (a i ) n is the original code value of the i-th point of the n-direction code, (s i ) o Be the code value of the i-th point of the normalized differential code, n is an even number;
[0131] Step 7. Establish the subcode space as the e...
specific Embodiment approach 3
[0146] Embodiment 3: This embodiment is a specific implementation of the method described in Embodiment 1 in MATLAB software.
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