Unsupervised image partitioning with semidefinite programming

DOI10.1007/3-540-45783-6_18MaRDI QIDQ4410207zbMATH OpenFDO

Authors Jens Keuchel, Christoph Schnörr, Christian Schellewald, Daniel Cremers

Publication date 2 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2449/24490141.htm

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45) Computing methodologies for image processing (68U10) Computing methodologies and applications (68U99)

Recommendations

• Semidefinite spectral clustering
• A subspace semidefinite programming for spectral graph partitioning
• 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
• scientific article; zbMATH DE number 1182569
• An efficient semidefinite programming relaxation for the graph partition problem

Cited in

(4)

• Optimality bounds for a variational relaxation of the image partitioning problem
• Semidefinite spectral clustering
• Probabilistic correlation clustering and image partitioning using perturbed multicuts
• Minimal partitions and image classification using a gradient-free perimeter approximation

This page was built for publication: Unsupervised image partitioning with semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410207)