Fast Planar Correlation Clustering for Image Segmentation
We describe a new optimization scheme for finding high-quality
clusterings in planar graphs that uses weighted perfect matching
as a subroutine. Our method provides lower-bounds on the energy of
the optimal correlation clustering that are typically fast to compute and
tight in practice. We demonstrate our algorithm on the problem of image
segmentation where this approach outperforms existing global optimization
techniques in minimizing the objective and is competitive with the
state of the art in producing high-quality segmentations.
Download: pdf
Text Reference
Julian Yarkony, Alexander T. Ihler, and Charless C. Fowlkes. Fast planar correlation clustering for image segmentation. In ECCV (6), 568–581. 2012.BibTeX Reference
@inproceedings{YarkonyIF_ECCV_2012,author = "Yarkony, Julian and Ihler, Alexander T. and Fowlkes, Charless C.",
title = "Fast Planar Correlation Clustering for Image Segmentation",
booktitle = "ECCV (6)",
year = "2012",
pages = "568-581"
}