Los puntos clave no están disponibles para este artículo en este momento.
In this paper we present a novel algorithm for very fast segmentation of range images into both planar and curved surface patches. In contrast to other known segmentation methods our approach makes use of high-level features (curve segments) as segmentation primitives instead of individual pixels. This way the amount of data can be significantly reduced and a very fast segmentation algorithm is obtained. The proposed algorithm has been tested on a large number of real range images and demonstrated good results. With an optimized implementation our method has the potential to operate in quasi real-time (a few range images per second).
Building similarity graph...
Analyzing shared references across papers
Loading...
Xiaoyi Jiang
University of Münster
U. Meier
Spiez Laboratory
Horst Bunke
University of Bern
University of Bern
Building similarity graph...
Analyzing shared references across papers
Loading...
Jiang et al. (Mon,) studied this question.
synapsesocial.com/papers/69d8192ea2a48916bbbef058 — DOI: https://doi.org/10.1109/acv.1996.572006