Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering

ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the prescribed number of components. At each iteration a small number of eigenvectors with small eigenvalue are computed and used to determine the reweighting. In this way spectral rounding directly produces discrete solutions where as current spectral algorithms must map the continuous eigenvectors to discrete solutions by employing a heuristic geometric separator (e.g. k-means). We show that spectral rounding compares favorably to current spectral approximations on the Normalized Cut criterion (NCut). Results are given in the natural image segmentation, medical image segmentation, and clustering domains. A practical version is shown to converge. This work was supported in part by the National Science Foundation under grants CCR

• Type: Conference
• Year: 2006
• Where: CVPR
• Authors: David Tolliver, Gary L. Miller
• Keywords: Computer Vision, Current Spectral Algorithms, Current Spectral Approximations, CVPR 2006, Natural Image Segmentation, Spectral Partitioning Methods, Spectral Rounding