Fast and Scalable Mesh Superfacets

In the field of computer vision, the introduction of a low‐level preprocessing step to oversegment images into superpixels – relatively small regions whose boundaries agree with those of the semantic entities in the scene – has enabled advances in segmentation by reducing the number of elements to b...

Full description

Saved in:
Bibliographic Details
Published in:Computer graphics forum Vol. 33; no. 7; pp. 181 - 190
Main Authors: Simari, Patricio, Picciau, Giulia, De Floriani, Leila
Format: Journal Article
Language:English
Published: Oxford Blackwell Publishing Ltd 01.10.2014
Subjects:
Algorithms
and systems
Categories and Subject Descriptors (according to ACM CCS)
Computer graphics
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Geometric algorithms
I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Geometric algorithms, languages, and systems
languages
Topological manifolds
Vision systems
ISSN:0167-7055, 1467-8659
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the field of computer vision, the introduction of a low‐level preprocessing step to oversegment images into superpixels – relatively small regions whose boundaries agree with those of the semantic entities in the scene – has enabled advances in segmentation by reducing the number of elements to be labeled from hundreds of thousands, or millions, to a just few hundred. While some recent works in mesh processing have used an analogous oversegmentation, they were not intended to be general and have relied on graph cut techniques that do not scale to current mesh sizes. Here, we present an iterative superfacet algorithm and introduce adaptations of undersegmentation error and compactness, which are well‐motivated and principled metrics from the vision community. We demonstrate that our approach produces results comparable to those of the normalized cuts algorithm when evaluated on the Princeton Segmentation Benchmark, while requiring orders of magnitude less time and memory and easily scaling to, and enabling the processing of, much larger meshes.
Bibliography:ArticleID:CGF12486
Supporting Information
istex:99EDACF331E5FA8C7DD797C953BDAD0C7210CFFD
ark:/67375/WNG-DCP99MNT-6
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12486