Abstract
We extend the shape signature based on the distance of the boundary points from the shape centroid, to the case of fuzzy sets. The analysis of the transition from crisp to fuzzy shape descriptor is first given in the continuous case. This is followed by a study of the specific issues induced by the discrete representation of the objects in a computer. We analyze two methods for calculating the signature of a fuzzy shape, derived from two ways of defining a fuzzy set: first, by its membership function, and second, as a stack of its a-cuts. The first approach is based on measuring the length of a fuzzy straight line by integration of the fuzzy membership function, while in the second one we use averaging of the shape signatures obtained for the individual a-cuts of the fuzzy set. The two methods, equivalent in the continuous case for the studied class of fuzzy shapes, produce different results when adjusted to the discrete case. A statistical study, aiming at characterizing the performances of each method in the discrete case, is done. Both methods are shown to provide more precise descriptions than their corresponding crisp versions. The second method (based on averaged Euclidean distance over the a-cuts) outperforms the others. (c) 2004 Elsevier B.V. All rights reserved.
Keywords
fuzzy shape representation; shape signature; discrete geometry; membership function; radial integral
Published in
Pattern Recognition Letters
2005, volume: 26, number: 6, pages: 735-746
Publisher: ELSEVIER SCIENCE BV
UKÄ Subject classification
Computer graphics and computer vision
Publication identifier
- DOI: https://doi.org/10.1016/j.patrec.2004.09.025
Permanent link to this page (URI)
https://res.slu.se/id/publ/8322