Abstract This paper introduces a new approach to solving the problem of representing planar curves. We describe the 2-D curve C not at all different scales σ, but each curve part C i of C , isolating a different structure at its single scale σ i . Therefore, we represent the planar curve at a scale vector ( σ 1 , …, σ L supposing that the curve is partitioned in L parts C 1 , …, C L ). We propose an automatic method to divide the contour into the number of nonoverlapping parts C 1 , …, C L , each of them showing a different underlying structure. This process requires neither the number of parts in the curve nor the minimum level of homogeneity for the entities within a particular part. The partition is based on three elements: a vector φ of statistical measures calculated to each class, a distance function d ( φ i , φ j ) between vectors corresponding to two different classes, and a halt criterion based on a measure of the improvement in the disimilarity between the elements of the partition.
[1]
Nicolas Pérez de la Blanca,et al.
Characterizing planar outlines
,
1993,
Pattern Recognit. Lett..
[2]
Edward J. Delp,et al.
On detecting dominant points
,
1991,
Pattern Recognit..
[3]
Jose A. García,et al.
Boundary simplification in cartography preserving the characteristics of the shape features
,
1994
.
[4]
Farzin Mokhtarian,et al.
Scale-Based Description and Recognition of Planar Curves and Two-Dimensional Shapes
,
1986,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5]
Paul L. Rosin.
Representing curves at their natural scales
,
1992,
Pattern Recognit..
[6]
Rafael Molina,et al.
NON-SUPERVISED CHARACTERIZATION OF GALAXIES USING DIFFERENT APPROACHES
,
1992
.