Multiclass spectral clustering (2003) [59 citations — 1 self]
Abstract:
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomposition. We clarify the role of eigenvectors as a generator of all optimal solutions through orthonormal transforms. We then solve an optimal discretization problem, which seeks a discrete solution closest to the continuous optima. The discretization is efficiently computed in an iterative fashion using singular value decomposition and nonmaximum suppression. The resulting discrete solutions are nearly global-optimal. Our method is robust to random initialization and converges faster than other clustering methods. Experiments on real image segmentation are reported. Spectral graph partitioning methods have been successfully
Citations
| 1081 | Normalized Cuts and Image Segmentation – Shi, Malik - 2000 |
| 431 | On spectral clustering: Analysis and an algorithm – Ng, Jordan, et al. - 2001 |
| 164 | Contour and texture analysis for image segmentation – Malik, Belongie, et al. - 2001 |
| 161 | An improved spectral graph partitioning algorithm for mapping parallel computations – Hendrickson, Leland - 1995 |
| 158 | A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics – Martin, Fowlkes, et al. - 2001 |
| 86 | Spectral k-way ratio-cut partitioning and clustering – Chan, Schlag, et al. - 1993 |
| 69 | Segmentation by grouping junctions – Ishikawa, Geiger - 1998 |
| 68 | An algorithm for partitioning the nodes of a graph – Barnes - 1982 |
| 12 | Learning segmentation with random walk – Meila, Shi - 2001 |
| 8 | Multiway Partitioning Via Geometric Embeddings, Orderings, and Dynamic Programming – Alpert, Kahng - 1995 |

