In this paper, we propose an adaptive method for the polygonal approximation of a digitized curve. Instead of setting a ΓΏxed length of support region in advance, the new method will compute the suitable length of support region for each point to ΓΏnd the best approximated curvature. The dominant poin
On detecting dominant points
β Scribed by Nirwan Ansari; Edward J. Delp
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 560 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A new parallel algorithm is proposed for detecting corners of multiple planar curves or shapes. This algorithm is based on an analysis of morphological residues and corner characteristics. The method is different from traditional chain-code based corner detection algorithms which associate with a ch
An efficient method for dominant point detection is proposed in this paper. The region of support for each point on curve is determined using bending value. The points with local maximum smoothing bending value can be located as the dominant points on the curve. The proposed algorithm needs no input
In this paper we intend to characterize boundaries using the Scale-space theory. The aim we try to achieve is the description of a boundary in relation to a subset of points-dominant points-that are obtained from a new multiscale representation of the boundary. Dominant points are characterized by a