Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33783-3_41 | european conference on computer vision |
Keywords | DocType | Volume |
optimal correlation clustering,new optimization scheme,planar correlation,global optimization technique,planar graph,perfect matching,high-quality clusterings,image segmentation,high-quality segmentation | Conference | abs/1208.0378 |
ISSN | Citations | PageRank |
0302-9743 | 16 | 0.66 |
References | Authors | |
29 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Julian Yarkony | 1 | 76 | 9.20 |
| Alexander T. Ihler | 2 | 1377 | 112.01 |
| Charless C Fowlkes | 3 | 7294 | 384.48 |