DocumentCode :
3403857
Title :
“Lattice Cut” - Constructing superpixels using layer constraints
Author :
Moore, Alastair P. ; Prince, Simon J D ; Warrell, Jonathan
Author_Institution :
Univ. Coll. London, London, UK
fYear :
2010
fDate :
13-18 June 2010
Firstpage :
2117
Lastpage :
2124
Abstract :
Unsupervised over-segmentation of an image into super-pixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for feature vectors and as a starting point for the final segmentation. Recent algorithms that construct superpixels that conform to a regular grid (or superpixel lattice) have used greedy solutions. In this paper we show that we can construct a globally optimal solution in either the horizontal or vertical direction using a single graph cut. The solution takes into account both edges in the image, and the coherence of the resulting superpixel regions. We show that our method outperforms existing algorithms for computing superpixel lattices. Additionally, we show that performance can be comparable or better than other contemporary segmentation algorithms which are not constrained to produce a lattice.
Keywords :
graph theory; greedy algorithms; image segmentation; greedy solutions; image parsing algorithms; lattice cut; layer constraints; single graph cut; superpixel lattices; unsupervised over-segmentation; Computer vision; Cost function; Educational institutions; Image segmentation; Inference algorithms; Lattices; Layout; Pipelines; Strips; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on
Conference_Location :
San Francisco, CA
ISSN :
1063-6919
Print_ISBN :
978-1-4244-6984-0
Type :
conf
DOI :
10.1109/CVPR.2010.5539890
Filename :
5539890
Link To Document :
بازگشت