SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATION

Figure-ground image segmentation has been a challenging problem in computer vision. Apart from the difficulties in establishing an effective framework to divide the image pixels into meaningful groups, the notions of figure and ground often need to be properly defined by providing either user inputs...

Full description

Bibliographic Details
Main Authors: M. Ying Yang, B. Rosenhahn
Format: Article
Language:English
Published: Copernicus Publications 2016-06-01
Series:ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
Online Access:http://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/III-3/387/2016/isprs-annals-III-3-387-2016.pdf
id doaj-d8a34d8afb9849b3a38b358aeaf021d8
record_format Article
spelling doaj-d8a34d8afb9849b3a38b358aeaf021d82020-11-24T21:05:30ZengCopernicus PublicationsISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences2194-90422194-90502016-06-01III-338739410.5194/isprs-annals-III-3-387-2016SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATIONM. Ying Yang0B. Rosenhahn1University of Twente, ITC Faculty, EOS department, Enschede, the NetherlandsLeibniz University Hannover, Institute of Information Processing, GermanyFigure-ground image segmentation has been a challenging problem in computer vision. Apart from the difficulties in establishing an effective framework to divide the image pixels into meaningful groups, the notions of figure and ground often need to be properly defined by providing either user inputs or object models. In this paper, we propose a novel graph-based segmentation framework, called superpixel cut. The key idea is to formulate foreground segmentation as finding a subset of superpixels that partitions a graph over superpixels. The problem is formulated as Min-Cut. Therefore, we propose a novel cost function that simultaneously minimizes the inter-class similarity while maximizing the intra-class similarity. This cost function is optimized using parametric programming. After a small learning step, our approach is fully automatic and fully bottom-up, which requires no high-level knowledge such as shape priors and scene content. It recovers coherent components of images, providing a set of multiscale hypotheses for high-level reasoning. We evaluate our proposed framework by comparing it to other generic figure-ground segmentation approaches. Our method achieves improved performance on state-of-the-art benchmark databases.http://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/III-3/387/2016/isprs-annals-III-3-387-2016.pdf
collection DOAJ
language English
format Article
sources DOAJ
author M. Ying Yang
B. Rosenhahn
spellingShingle M. Ying Yang
B. Rosenhahn
SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATION
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
author_facet M. Ying Yang
B. Rosenhahn
author_sort M. Ying Yang
title SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATION
title_short SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATION
title_full SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATION
title_fullStr SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATION
title_full_unstemmed SUPERPIXEL CUT FOR FIGURE-GROUND IMAGE SEGMENTATION
title_sort superpixel cut for figure-ground image segmentation
publisher Copernicus Publications
series ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
issn 2194-9042
2194-9050
publishDate 2016-06-01
description Figure-ground image segmentation has been a challenging problem in computer vision. Apart from the difficulties in establishing an effective framework to divide the image pixels into meaningful groups, the notions of figure and ground often need to be properly defined by providing either user inputs or object models. In this paper, we propose a novel graph-based segmentation framework, called superpixel cut. The key idea is to formulate foreground segmentation as finding a subset of superpixels that partitions a graph over superpixels. The problem is formulated as Min-Cut. Therefore, we propose a novel cost function that simultaneously minimizes the inter-class similarity while maximizing the intra-class similarity. This cost function is optimized using parametric programming. After a small learning step, our approach is fully automatic and fully bottom-up, which requires no high-level knowledge such as shape priors and scene content. It recovers coherent components of images, providing a set of multiscale hypotheses for high-level reasoning. We evaluate our proposed framework by comparing it to other generic figure-ground segmentation approaches. Our method achieves improved performance on state-of-the-art benchmark databases.
url http://www.isprs-ann-photogramm-remote-sens-spatial-inf-sci.net/III-3/387/2016/isprs-annals-III-3-387-2016.pdf
work_keys_str_mv AT myingyang superpixelcutforfiguregroundimagesegmentation
AT brosenhahn superpixelcutforfiguregroundimagesegmentation
_version_ 1716768522611195904