New Methods for Surface Reconstruction from Range Images
Reference: Brian Curless, Ph.D. dissertation,
Technical Report CSL-TR-97-733, Stanford University,
June 1997.
The digitization and reconstruction of 3D shapes has numerous
applications in areas that include manufacturing, virtual simulation,
science, medicine, and consumer marketing. In this thesis, we address
the problem of acquiring accurate range data through optical
triangulation, and we present a method for reconstructing surfaces
from sets of data known as range images.
The standard methods for extracting range data from optical
triangulation scanners are accurate only for planar objects of uniform
reflectance. Using these methods, curved surfaces, discontinuous
surfaces, and surfaces of varying reflectance cause systematic
distortions of the range data. We present a new ranging method based
on analysis of the time evolution of the structured light reflections.
Using this spacetime analysis, we can correct for each of these
artifacts, thereby attaining significantly higher accuracy using
existing technology. When using coherent illumination such as lasers,
however, we show that laser speckle places a fundamental limit on
accuracy for both traditional and spacetime triangulation.
The range data acquired by 3D digitizers such as optical triangulation
scanners commonly consists of depths sampled on a regular grid, a
sample set known as a range image. A number of techniques have been
developed for reconstructing surfaces by integrating groups of aligned
range images. A desirable set of properties for such algorithms
includes: incremental updating, representation of directional
uncertainty, the ability to fill gaps in the reconstruction, and
robustness in the presence of outliers and distortions. Prior
algorithms possess subsets of these properties. In this thesis, we
present an efficient volumetric method for merging range images that
possesses all of these properties. Using this method, we are able to
merge a large number of range images (as many as 70) yielding
seamless, high-detail models of up to 2.6 million triangles.
Click on any chapter heading to retrieve an individual chapter. The
full dissertation can also be downloaded as
a single file. Don't worry if you see an occasional blank page, since
the dissertation is formatted for two-sided printing.
- Front Matter (Postscript, gzipped, 32 KBytes)
- Abstract
- Acknowledgements
- Contents
- List of Tables
- List of Figures
- Chapter 1: Introduction (Postscript, gzipped, 215 KBytes)
- Applications
- Reverse engineering
- Collaborative design
- Inspection
- Special effects, games, and virtual worlds
- Dissemination of museum artifacts
- Medicine
- Home shopping
- Methods for 3D Digitization
- Surface reconstruction from range images
- Range images
- Surface reconstruction
- The 3D Fax Project
- Contributions
- Organization
- Chapter 2: Optical triangulation: limitations and prior work (Postscript, gzipped, 303 KBytes)
- Triangulation Configurations
- Structure of the illuminant
- Type of illuminant
- Sensor
- Scanning method
- Limitations of traditional methods
- Geometric intuition
- Quantifying the error
- Focusing the beam
- Influence of laser speckle
- Prior work on triangulation error
- Chapter 3: Spacetime Analysis (Postscript, gzipped, 120 KBytes)
- Geometric intuition
- A complete derivation
- Generalizing the geometry
- Influence of laser speckle
- A Signal Processing Perspective
- Ideal triangulation impulse response
- Filtering, noise, sampling, and reconstruction
- The spacetime spectrum
- Widening the laser sheet
- Improving resolution
- Chapter 4: Spacetime analysis: implementation and results (Postscript, gzipped, 762 KBytes)
- Hardware
- The spacetime algorithm
- Fast rotation of the spacetime image
- Interpolating the spacetime volume
- Results
- Reflectance correction
- Shape correction
- Speckle
- Complex objects
- Remaining sources of error
- Chapter 5: Surface estimation from range images (Postscript, gzipped, 608 KBytes)
- Prior work in surface reconstruction from range data
- Unorganized points: polygonal methods
- Unorganized points: implicit methods
- Structured data: polygonal methods
- Structured data: implicit methods
- Discrete-state voxels
- Continuous-valued voxels
- Other related work
- Range images, range surfaces, and uncertainty
- A probabilistic model
- Maximum likelihood estimation
- Unifying the domain of integration
- Calculus of variations
- A minimization solution
- Discussion
- Chapter 6: A New Volumetric Approach (Postscript, gzipped, 522 KBytes)
- Merging observed surfaces
- A one-dimensional Example
- Restriction to vicinity of surface
- Two and three dimensions
- Choosing surface weights
- Hole filling
- A hole-filling algorithm
- Carving from backdrops
- Sampling, conditioning, and filtering
- Voxel resolution and tessellation criteria
- Conditioning the implicit function
- Mesh filtering vs. anti-aliasing in hole fill regions
- Limitations of the volumetric method
- Thin surfaces
- Bridging sharp corners
- Space carving
- Chapter 7: Fast algorithms for the volumetric method (Postscript, gzipped, 96 KBytes)
- Run-length encoding
- Fast volume updating
- Scanline alignment
- Resampling the range image
- Updating the volume
- A shear-warp factorization
- Binary depth trees
- Efficient RLE transposes
- Fast surface extraction
- Asymptotic Complexity
- Chapter 8: Results of the volumetric method (Postscript, gzipped, 5423 KBytes)
- Hardware Implementation
- Aligning range images
- Results
- Chapter 9: Conclusion (Postscript, gzipped, 29 KBytes)
- Improved triangulation
- Volumetrically combining range images
- Future work
- Optimal triangulation
- Improvements for volumetric surface reconstruction
- Open problems in surface digitization
- Appendix A: Proof of Theorem 5.1 (Postscript, gzipped, 24 KBytes)
- Appendix B: Stereolithography (Postscript, gzipped, 953 KBytes)
- Biblography (Postscript, gzipped, 29 KBytes)
- PDF of full dissertation (3.14MB)
- Postscript of full dissertation (gzipped, 8864K)
-
Postscript
of full dissertation with some lower resolution figures (gzipped, 4279K)
Last modified: March 27, 1998
Brian Curless,
curless@graphics.stanford.edu