Abstract
Many authors have already proposed linear feature extraction algorithms. In most cases, these algorithms can not guarantee the extraction of adjacency relations between extracted features. Object contours appearing in the analyzed images are often fragmented into non-connected features. Nevertheless, the use of some topological information enables to reduce substantially the complexity of matching and registration algorithms.
Here, we formulate the problem of linear feature extraction as an optimal labelling problem of a topological map obtained from low level operations. The originality of our approach is the maintaining of this data structure during the extraction process and the formulation of the problem of feature extraction as a global optimization problem.
Chapter PDF
Similar content being viewed by others
References
Braquelaire, J.-P., Brun, L. Image Segmentation with Topological Maps and Interpixel Representation, Journal of Visual Communication and Image Representation, 9(1) (1998) 62–79
Brunn, A., Weidner, U., Forstner, W., Model-based 2D Shape Recovery, in: Mustererkennung 1995, G. Sagerer et al. (eds.), Springer-Verlag, 260–268
Danuser, G., Stricker, M., Parametric Model Fitting: From Inlier Characterization to Outlier Detection, IEEE Trans. on PAMI, 20(2) (1998) 263–280
Dickinson, S.J., Pentland, A. P., Rosenfeld, A., 3-D Shape Recovery Using Aspect Matching, IEEE Trans. on PAMI, 14(2) (1992) 174–198
Fiorio, C., A topologically Consistent Representation for Image Analysis: the Frontiers Topological Graph, DGCI’96, Lectures Notes in Computer Sciences, no. 1176, (1996) 151–162
Fuchs, C., Frostner, W., Polymorphic Grouping for Image Segmentation, Proc. 5th ICCV, (1995) 175–182
Gangnet, M., Hervé, J.-C., Pudet, T., Van Tong, J.-M., Incremental Computation of Planar Maps, SIGGRAPH Proc., Computer Graphics, 23(3) (1989) 345–354
Harris, C., Stephens, M., Combined Corner and Edge Detector, Alvey88, (1998) 147–152
Janssen, R. D. T., Vossepoel, A. M., Adaptative Vectorization of Line Drawing Images, Computer Vision and Image Understanding, 65(1) (1997) 38–56
Leclerc, Y. G., Constructing Simple Stable Descriptions for Image Partitioning, International Journal of Computer Vision, 3 (1989) 73–102
Lee, J.-W., Kweon, I.S., Extraction of Line Features in a Noisy Image, Pattern Recognition, 30(10) (1997) 1651–1660
Lindenbaum, M., Bruckstein, A., On recursive, O(N) Partitioning of Digitized Curve into Digital Straight Segments, IEEE Trans. on PAMI, 15(9) (1993) 949–953
Lindeberg, T., Li, M.-X., Segmentation and Classification of Edges Using Minimum Description Length Approximation and Complementary Junction Cues, Tech. Rep. ISRN KTH/NA/P-96/01-SE, Jan. 1996.
McLean, G.F., Kotturi, D., Vanishing Point Detection by Line Clustering, IEEE Trans. on PAMI, 17(11) (1995) 1090–1095
Mohan, R., Nevatia, R., Using Perceptual Organization to Extract 3-D Structures, IEEE Trans. on PAMI 11(11) (1989) 1121–1139
Pierrot Deseilligny, M., Stamon, G., Suen, C., Veinerization: A New Shape Description for Flexible Skeletonization, IEEE Trans. on PAMI, 20(5) (1998) 505–521
Rissanen, J., A Universal Prior For Integers and Estimation by Minimum Description Length, The Annals of Statistics, 11(2) (1983) 416–431
Torr, P. H. S., Geometric Motion Segmentation and Model Selection, Philosophical Transactions of the Royal Society A, J. Lasenby. and A. Zisserman. and R. Cipolla. and H. Longuet-Higgins editors, pp. 1321
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marchadier, J., Michelin, S., Egels, Y. (2000). A Graph Labelling Approach for Connected Feature Selection. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_30
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive