Isoperimetric graph partitioning for image segmentation (2006)
Cached
Download Links
- [eslab.bu.edu]
- [cns-web.bu.edu]
- [www.cns.bu.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE Trans. on Pat. Anal. and Mach. Int |
| Citations: | 20 - 7 self |
BibTeX
@ARTICLE{Grady06isoperimetricgraph,
author = {Leo Grady and Eric L. Schwartz},
title = {Isoperimetric graph partitioning for image segmentation},
journal = {IEEE Trans. on Pat. Anal. and Mach. Int},
year = {2006},
volume = {28},
pages = {469--475}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract—Spectral graph partitioning provides a powerful approach to image segmentation. We introduce an alternate idea that finds partitions with a small isoperimetric constant, requiring solution to a linear system rather than an eigenvector problem. This approach produces the high quality segmentations of spectral methods, but with improved speed and stability. Index Terms—Graph-theoretic methods, graphs and networks, graph algorithms, image representation, special architectures, algorithms, computer vision, applications. æ 1
