Representing stereo data with the Delaunay triangulation
Artificial Intelligence
The Visual Hull Concept for Silhouette-Based Image Understanding
IEEE Transactions on Pattern Analysis and Machine Intelligence
Applying Two-dimensional Delaunay Triangulation to Stereo Data Interpolation
ECCV '92 Proceedings of the Second European Conference on Computer Vision
Surface Reconstruction by Integrating 3D and 2D Data of Multiple Views
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
A Comparison and Evaluation of Multi-View Stereo Reconstruction Algorithms
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Multi-View Stereo Reconstruction and Scene Flow Estimation with a Global Image-Based Matching Score
International Journal of Computer Vision
Fast Boundary Detection: A Generalization and a New Algorithm
IEEE Transactions on Computers
Scene modelling from sparse 3D data
Image and Vision Computing
Simple single view scene calibration
ACIVS'11 Proceedings of the 13th international conference on Advanced concepts for intelligent vision systems
| Hi-index | 0.00 |
Extracting a computer model of a real scene from a sequence of views, is one of the most challenging and fundamental problems in computer vision. Stereo vision algorithms allow us to extract from the images a sparse 3D point cloud on the scene surfaces. However, computing an accurate mesh of the scene based on such poor quality data points (noise, sparsity) is very difficult. Here we describe a simple yet original approach that uses both the stereo vision extracted point cloud and the calibrated images. Our method is a three-stage process in which the first stage merges, filters and smoothes the input 3D points. The second stage builds for each calibrated image a triangular depth-map and fuses the set of depth-maps into a triangle soup that minimize violations of size and visibility constraints. Finally, a mesh is computed from the triangle soup using a reconstruction method that combines restricted Delaunay triangulation and Delaunay refinement.