Multilevel spectral partitioning for efficient image segmentation and tracking

David Tolliver, Robert T. Collins, Simon Baker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Abstract

An efficient multilevel method for solving normalized cut image segmentation problems is presented. The method uses the lattice geometry of images to define a set of coarsened graph partitioning problems. This problem hierarchy provides a framework for rapidly estimating the eigenvectors of normalized graph Laplacians. Within this framework, a coarse solution obtained with a standard eigensolver is propagated to increasingly fine problem instances and refined using subspace iterations. Results are presented for image segmentation and tracking problems. The computational cost of the multilevel method is an order of magnitude lower than current sampling techniques and results in more stable image segmentations.

Original languageEnglish (US)
Title of host publicationProceedings - Seventh IEEE Workshop on Applications of Computer Vision, WACV 2005
Pages414-420
Number of pages7
DOIs
StatePublished - 2007
Event7th IEEE Workshop on Applications of Computer Vision, WACV 2005 - Breckenridge, CO, United States
Duration: Jan 5 2005Jan 7 2005

Publication series

NameProceedings - Seventh IEEE Workshop on Applications of Computer Vision, WACV 2005

Other

Other7th IEEE Workshop on Applications of Computer Vision, WACV 2005
Country/TerritoryUnited States
CityBreckenridge, CO
Period1/5/051/7/05

All Science Journal Classification (ASJC) codes

  • Computer Vision and Pattern Recognition
  • Software

Fingerprint

Dive into the research topics of 'Multilevel spectral partitioning for efficient image segmentation and tracking'. Together they form a unique fingerprint.

Cite this