Supertetras: a Superpixel Analog for Tetrahedral Mesh Oversegmentation

Abstract

Abstract. Over the past decade, computer vision algorithms have tran-sitioned from relying on the direct, pixel-based representation of images to the use of superpixels, small regions whose boundaries agree with im-age contours. This intermediate representation improves the tractability of image understanding because it reduces the number of primitives to be taken under consideration from several million to a few hundred. De-spite the improvements yielded in the area of image segmentation, the concept of an oversegmentation as an intermediate representation has not been adopted in volumetric mesh processing. We take a first step in this direction, adapting a fast and efficient superpixel algorithm to the tetrahedral mesh case, present results which demonstrate the qual-ity of the output oversegmentation, and illustrate its use in a semantic segmentation application.

Similar works

Full text

thumbnail-image

CiteSeerX

redirect
Last time updated on 29/10/2017

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.