Abstract
An algorithm for the detection of dominant points and for building a hierarchical approximation of a digital curve is proposed. The algorithm does not require any parameter tuning and is shown to perform well for a wide variety of shapes, including scaled and rotated ones. Dominant points are first located by a coarse-to-fine detector scheme. They constitute the vertices of a polygon closely approximating the curve. Then, a criterion of perceptual significance is used to repeatedly remove suitable vertices until a stable polygonal configuration, the contour sketch, is reached. A highly compressed hierarchical description of the shape also becomes available.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Systems, Man, and Cybernetics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
