27 September 2017 Convex constrained meshes for superpixel segmentations of images
Jeremy Forsythe, Vitaliy Kurlin
Author Affiliations +
Abstract
We consider the problem of splitting a pixel-based image into convex polygons with vertices at a subpixel resolution. The edges of the resulting polygonal superpixels can have any direction and should adhere well to object boundaries. We introduce a convex constrained mesh that accepts any straight line segments and outputs a complete mesh of convex polygons without small angles and with approximation guarantees for the given lines. Experiments on the Berkeley segmentation dataset BSD500 show that the resulting meshes of polygonal superpixels outperform other polygonal meshes on boundary recall and pixel-based simple linear iterative clustering and superpixels extracted via energy-driven sampling superpixels on undersegmentation errors.
© 2017 SPIE and IS&T 1017-9909/2017/$25.00 © 2017 SPIE and IS&T
Jeremy Forsythe and Vitaliy Kurlin "Convex constrained meshes for superpixel segmentations of images," Journal of Electronic Imaging 26(6), 061609 (27 September 2017). https://doi.org/10.1117/1.JEI.26.6.061609
Received: 22 April 2017; Accepted: 1 September 2017; Published: 27 September 2017
Lens.org Logo
CITATIONS
Cited by 7 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Image resolution

Image processing algorithms and systems

Sensors

Quality measurement

C++

Databases

RELATED CONTENT

A method of recognition of maritime objects based on FLIR...
Proceedings of SPIE (October 05 2017)
Site-model-based exploitation of SAR data
Proceedings of SPIE (September 15 1998)
User-constrained guidewire localization in fluoroscopy
Proceedings of SPIE (March 27 2009)
Segmentation-based image retrieval
Proceedings of SPIE (December 23 1997)

Back to Top