Title :
Interval skeletons
Author_Institution :
MRC Human Genetics Unit, Edinburgh, UK
fDate :
30 Aug-3 Sep 1992
Abstract :
A skeleton method based on interval coding of a binary image is shown to preserve the homotopy of the image. With a computational complexity linear in the number of intervals, it is typically an order of magnitude faster than other fast skeleton methods. Thinness, reconstructability, and other shape-representation properties of the method are discussed
Keywords :
computational complexity; image coding; image reconstruction; image sequences; binary image interval coding; computational complexity; image homotropy; reconstructability; shape-representation properties; skeleton method; thinness; Computational complexity; Euclidean distance; Genetics; Humans; Image coding; Image reconstruction; Morphology; Shape; Skeleton; Topology;
Conference_Titel :
Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on
Conference_Location :
The Hague
Print_ISBN :
0-8186-2920-7
DOI :
10.1109/ICPR.1992.202026
