2013 (English)Conference paper (Refereed)
We propose and evaluate a versatile scheme for image pre-segmentation that generates a partition of the image into a selectable number of patches (’superpixels’), under the constraint of obtaining maximum homogeneity of the ’texture’ inside of each patch, and maximum accordance of the contours with both the image content as well as a Gibbs-Markov random field model. In contrast to current state-of-the art approaches to superpixel segmentation, ’homogeneity’ does not limit itself to smooth region-internal signals and high feature value similarity between neighboring pixels, but is applicable also to highly textured scenes. The energy functional that is to be maximized for this purpose has only a very small number of design parameters, depending on the particular statistical model used for the images.
The capability of the resulting partitions to deform according to the image content can be controlled by a single parameter. We show by means of an extensive comparative experimental evaluation that the compactness-controlled contour-relaxed superpixels method outperforms the state-of-the art superpixel algorithms with respect to boundary recall and undersegmentation error while being faster or on a par with respect to runtime.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 280-293 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 8081
IdentifiersURN: urn:nbn:se:liu:diva-93239DOI: 10.1007/978-3-642-40395-8_21ISBN: 978-3-642-40394-1 (print)ISBN: 978-3-642-40395-8 (online)OAI: oai:DiVA.org:liu-93239DiVA: diva2:623602
EMMCVPR 2013. 9th International Conference Energy Minimization Methods in Computer Vision and Pattern Recognition, August 19-21, Lund, Sweden
FundereLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications