Segmentation using eigenvectors: a unifying view
Yair Weiss · IEEE International Conference on Computer Vision (ICCV) · 1999
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.
Cited by 729 works. doi:10.1109/iccv.1999.790354
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Normalized cuts and image segmentation
- Quantitative measures of change based on feature organization: eigenvalues and eigenvectors
- A factorization approach to grouping
- Feature grouping by 'relocalisation' of eigenvectors of the proximity matrix
- Multibody Grouping from Motion Images
- Feature grouping in moving objects
- A multi-body factorization method for motion analysis
- Condensing image databases when retrieval is based on non-metric distances
- Self inducing relational distance and its application to image segmentation