Break and conquer: Efficient correlation clustering for image segmentation

Amir Alush, Jacob Goldberger

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

We present a probabilistic model for image segmentation and an efficient approach to find the best segmentation. The image is first grouped into superpixels and a local information is extracted for each pair of spatially adjacent superpixels. The global optimization problem is then cast as correlation clustering which is known to be NP hard. This study demonstrates that in many cases, finding the exact global solution is still feasible by exploiting the characteristics of the image segmentation problem that make it possible to break the problem into subproblems. Each sub-problem corresponds to an automatically detected image part. We demonstrate a reduced computational complexity with comparable results to state-of-the-art on the BSDS-500 and the Weizmann Two-Objects datasets.

Original languageEnglish
Title of host publicationSimilarity-Based Pattern Recognition - Second International Workshop, SIMBAD 2013, Proceedings
Pages134-147
Number of pages14
DOIs
StatePublished - 2013
Event2nd International Workshop on Similarity-Based Pattern Analysis and Recognition, SIMBAD 2013 - York, United Kingdom
Duration: 3 Jul 20135 Jul 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7953 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Workshop on Similarity-Based Pattern Analysis and Recognition, SIMBAD 2013
Country/TerritoryUnited Kingdom
CityYork
Period3/07/135/07/13

Fingerprint

Dive into the research topics of 'Break and conquer: Efficient correlation clustering for image segmentation'. Together they form a unique fingerprint.

Cite this