Resolution-independent superpixels based on convex constrained meshes without small angles

Kurlin, V ORCID: 0000-0001-5328-5351, Forsythe, J and Fitzgibbon, A (2016) Resolution-independent superpixels based on convex constrained meshes without small angles. In: International Symposium on Visual Computing, 2016-12-12 - 2016-12-14, Las-Vegas, USA.

Text convex-constrained-meshes.pdf - Author Accepted Manuscript Download (3MB)

Abstract

The over-segmentation problem for images is studied in the new resolution-independent formulation when a large image is approximated by a small number of convex polygons with straight edges at subpixel precision. These polygonal superpixels are obtained by refining and extending subpixel edge segments to a full mesh of convex polygons without small angles and with approximation guarantees. Another novelty is the objective error difference between an original pixel-based image and the reconstructed image with a best constant color over each superpixel, which does not need human segmentations. The experiments on images from the Berkeley Segmentation Database show that new meshes are smaller and provide better approximations than the state-of-the-art.

Item Type:	Conference or Workshop Item (Unspecified)
Depositing User:	Symplectic Admin
Date Deposited:	14 Dec 2016 16:54
Last Modified:	19 Jan 2023 07:24
DOI:	10.1007/978-3-319-50835-1_21
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3004878