Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem.
Tijl De BieNello CristianiniPublished in: J. Mach. Learn. Res. (2006)
Keyphrases
- graph cuts
- globally optimal
- convex relaxation
- energy minimization
- energy function
- markov random field
- clustering algorithm
- semidefinite
- multi label
- semi definite programming
- belief propagation
- graph cut segmentation
- clustering method
- image segmentation
- object segmentation
- shape prior
- segmentation algorithm
- linear programming
- np hard
- mean shift
- interactive image segmentation
- interactive segmentation
- data clustering
- lower bound
- max flow
- graph cut optimization
- k means
- semidefinite programming
- semi supervised learning
- optimal solution
- object detection
- metric learning
- higher order
- foreground background segmentation
- spectral clustering