Segmentation using eigenvectors: a unifying view
- 1 January 1999
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 975-982 vol.2
- https://doi.org/10.1109/iccv.1999.790354
Abstract
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using methods that are based on eigenvectors of the affinity matrix. These approaches are extremely attractive in that they are based on simple eigendecomposition algorithms whose stability is well understood. Nevertheless, the use of eigendecompositions in the context of segmentation is far from well understood. In this paper we give a unified treatment of these algorithms, and show the close connections between them while highlighting their distinguishing features. We then prove results on eigenvectors of block matrices that allow us to analyze the performance of these algorithms in simple grouping settings. Finally, we use our analysis to motivate a variation on the existing methods that combines aspects from different eigenvector segmentation algorithms. We illustrate our analysis with results on real and synthetic images.Keywords
This publication has 8 references indexed in Scilit:
- Feature grouping in moving objectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Condensing image databases when retrieval is based on non-metric distancesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Normalized cuts and image segmentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A multi-body factorization method for motion analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multibody Grouping from Motion ImagesInternational Journal of Computer Vision, 1998
- Quantitative measures of change based on feature organization: eigenvalues and eigenvectorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1996
- Feature grouping by 'relocalisation' of eigenvectors of the proximity matrixPublished by British Machine Vision Association and Society for Pattern Recognition ,1990
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977