By Topic

A fast solution to the approximation of 3D scattered point data from stereo images using triangular meshes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Michel Sarkis ; Institute for Data Processing, Technische Universität München, Arcisstr. 21, 80290, Munich, Germany ; Klaus Diepold

Meshing the 3D scattered point data is an important task in machine vision since it allows the rendering of the 3D structures on a commodity graphics hardware. In this paper, we develop a fast and adaptive method to approximate an organized set of 3D scattered data points from stereo images by a triangular mesh and which can be applied to systems that require low delay response such as telepresence. The method starts by reducing the number of points through the employment of image adaptive sampling techniques. Then, an initial triangular mesh is constructed using the reduced set of points and later refined to minimize a predefined approximation error. Compared to some state of the art schemes, the proposed method results in a significant reduction in the processing time while preserving the quality of the mesh.

Published in:

2007 7th IEEE-RAS International Conference on Humanoid Robots

Date of Conference:

Nov. 29 2007-Dec. 1 2007