Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts.
Matthias HeinSimon SetzerPublished in: NIPS (2011)
Keyphrases
- graph cuts
- spectral clustering
- lower bound
- image segmentation
- upper bound
- energy function
- energy minimization
- markov random field
- pairwise
- belief propagation
- clustering method
- data clustering
- globally optimal
- mean shift
- normalized cut
- shape prior
- np hard
- object segmentation
- multi label
- segmentation algorithm
- computer vision
- objective function
- k means
- image processing
- graph partitioning
- convex relaxation
- linear programming
- clustering algorithm
- semidefinite
- missing data
- higher order
- supervised learning
- optimal solution