Spectral grouping using the Nystrom method
Fowlkes, C.
Belongie, S.
Chung, F.
Malik, J.
Div. Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA;
This paper appears in: Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publication Date: Feb. 2004
Volume: 26,
Issue: 2
On page(s): 214-225
ISSN: 0162-8828
INSPEC Accession Number: 7950567
Digital Object Identifier: 10.1109/TPAMI.2004.1262185
Current Version Published: 2004-06-28
Abstract
Spectral graph theoretic methods have recently shown great promise for the problem of image segmentation. However, due to the computational demands of these approaches, applications to large problems such as spatiotemporal data and high resolution imagery have been slow to appear. The contribution of this paper is a method that substantially reduces the computational requirements of grouping algorithms based on spectral partitioning making it feasible to apply them to very large grouping problems. Our approach is based on a technique for the numerical solution of eigenfunction problems known as the Nystrom method. This method allows one to extrapolate the complete grouping solution using only a small number of samples. In doing so, we leverage the fact that there are far fewer coherent groups in a scene than pixels.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
