Spectral grouping using the Nyström method

DMCA

Spectral grouping using the Nyström method (2004)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Charless Fowlkes , Serge Belongie , Fan Chung , Jitendra Malik

Venue:	IEEE Transactions on Pattern Analysis and Machine Intelligence
Citations:	315 - 1 self

BibTeX

@ARTICLE{Fowlkes04spectralgrouping,
    author = {Charless Fowlkes and Serge Belongie and Fan Chung and Jitendra Malik},
    title = {Spectral grouping using the Nyström method},
    journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
    year = {2004},
    volume = {26},
    pages = {2004}
}

OpenURL

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 knownas the Nyström method. This method allows one to extrapolate the complete grouping solution using only a small number of "typical" samples. In doing so, we leverage the fact that there are far fewer coherent groups in a scene than pixels.

Keyphrases

nystr method eigenfunction problem numerical solution computational requirement spectral graph theoretic method image segmentation large problem complete grouping solution spatiotemporal data typical sample coherent group computational demand great promise high resolution imagery small number

DMCA