A general surface approach to the integration of a set of range views

Soucy, Marc‐André; Laurendeau, Denis

doi:10.1109/34.385982

Cited by 202 publications

(124 citation statements)

References 20 publications

Supporting

Mentioning

122

Contrasting

Order By: Relevance

“…Displacement map representation of individual stereo shape estimates allows the correspondence between multiple noisy sets of overlapping surface measurements to be established. This overcomes limitations of previous implicit surface [5,7] and mesh-based nearest-point [23,29] range image integration algorithms in the presence of significant measurement noise.…”

Section: Robust Integration Of Individual Displacement Map Images Is mentioning

confidence: 90%

3-D studio production of animated actor models

Hilton

Kalkavouras

Collins

2005

IEE Proc., Vis. Image Process.

View full text Add to dashboard Cite

show abstract

Section: Robust Integration Of Individual Displacement Map Images Is mentioning

confidence: 90%

3-D studio production of animated actor models

Hilton

Kalkavouras

Collins

2005

IEE Proc., Vis. Image Process.

View full text Add to dashboard Cite

show abstract

“…A shortcoming of this method is the fact that the signed distance is calculated as a directional (instead of a scalar) property, and therefore there is no guarantee that the scalar field correctly registers the signed distance from a point to the surface. In Soucy and Laurendeau (1995) the very high computational cost of combining range image meshes after registration and surface meshing is discussed. In this reference overlapping components of the meshes corresponding to different range images must be identified, with a large computational cost, of the order O(2 N − 1) where N is the number of range images.…”

Section: Literature Reviewmentioning

confidence: 99%

Principal component and Voronoi skeleton alternatives for curve reconstruction from noisy point sets

Ruíz

Vanegas

Cadavid

2007

Journal of Engineering Design

View full text Add to dashboard Cite

Surface reconstruction from noisy point samples must take into consideration the stochastic nature of the sample. In other words, geometric algorithms reconstructing the surface or curve should not insist in following in a literal way each sampled point. Instead, they must interpret the sample as a "point cloud" and try to build the surface as passing through the best possible (in the statistical sense) geometric locus that represents the sample. This work presents two new methods to find a Piecewise Linear approximation from a Nyquist-compliant stochastic sampling of a quasi-planar C 1 curve C(u) : R → R 3 , whose velocity vector never vanishes. One of the methods articulates in an entirely new way Principal Component Analysis (statistical) and Voronoi-Delaunay (deterministic) approaches. It uses these two methods to calculate the best possible tape-shaped polygon covering the planarised point set, and then approximates the manifold by the medial axis of such a polygon. The other method applies Principal Component Analysis to find a direct Piecewise Linear approximation of C(u). A complexity comparison of these two methods is presented along with a qualitative comparison with previously developed ones. It turns out that the method solely based on Principal Component Analysis is simpler and more robust for non self-intersecting curves. For self-intersecting curves the Voronoi-Delaunay based Medial Axis approach is more robust, at the price of higher computational complexity. An application is presented in Integration of meshes originated in range images of an art piece. Such an application reaches the point of complete reconstruction of a unified mesh.

show abstract

“…This range of distances represents the transition between optical triangulation and time of flight technologies. The generation of the model was done with both the camera manufacturer's own software 3Dipsos TM and Polyworks TM [25] software from Innovmetric. The Polyworks TM software gives the standard deviation of the alignment error after each alignment.…”

Section: D Imagingmentioning

confidence: 99%

Virtualizing a Byzantine Crypt: challenge and impact

et al. 2003

View full text Add to dashboard Cite

This paper presents the work that was accomplished in preparing a multimedia CDROM about the history of a Byzantine Crypt. An effective approach based upon high-resolution photo-realistic texture mapping onto 3D models generated from range images is used to present the spatial information about the Crypt. Usually, this information is presented on 2D images that are flat and don't show the three-dimensionality of an environment. In recent years, highresolution recording of heritage sites has stimulated a lot of research in fields like photogrammetry, computer vision, and computer graphics. The methodology we present should appeal to people interested in 3D for heritage. It is applied to the virtualization of a Byzantine Crypt where geometrically correct texture mapping is essential to render the environment realistically, to produce virtual visits and to apply virtual restoration techniques. A CDROM and a video animation have been created to show the results.

show abstract

A general surface approach to the integration of a set of range views

Cited by 202 publications

References 20 publications

3-D studio production of animated actor models

3-D studio production of animated actor models

Principal component and Voronoi skeleton alternatives for curve reconstruction from noisy point sets

Virtualizing a Byzantine Crypt: challenge and impact

Contact Info

Product

Resources

About