Towards a hierarchical contour description via dominant point detection
| Autor: | Keiichi Abe, A. Held, C. Arcelli |
|---|---|
| Rok vydání: | 1994 |
| Předmět: |
Approximation theory
business.industry Detector ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION General Engineering Image processing Sketch Edge detection Dominant point detection Polygon Computer vision Artificial intelligence business Algorithm ComputingMethodologies_COMPUTERGRAPHICS Shape analysis (digital geometry) Mathematics |
| Zdroj: | IEEE Transactions on Systems, Man, and Cybernetics. 24:942-949 |
| ISSN: | 0018-9472 |
| DOI: | 10.1109/21.293514 |
| Popis: | 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. > |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|