Bundled depth-map merging for multi-view stereo
Intel Labs. China, Beijing, China
IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2010
@inproceedings{li2010bundled,
title={Bundled depth-map merging for multi-view stereo},
author={Li, J. and Li, E. and Chen, Y. and Xu, L. and Zhang, Y.},
booktitle={Computer Vision and Pattern Recognition (CVPR), 2010 IEEE Conference on},
pages={2769–2776},
year={2010},
organization={IEEE}
}
Depth-map merging is one typical technique category for multi-view stereo (MVS) reconstruction. To guarantee accuracy, existing algorithms usually require either sub-pixel level stereo matching precision or continuous depth-map estimation. The merging of inaccurate depth-maps remains a challenging problem. This paper introduces a bundle optimization method for robust and accurate depth-map merging. In the method, depth-maps are generated using DAISY feature, followed by two stages of bundle optimization. The first stage optimizes the track of connected stereo matches to generate initial 3D points. The second stage optimizes the position and normals of 3D points. High quality point cloud is then meshed as geometric models. The proposed method can be easily parallelizable on multi-core processors. Middlebury evaluation shows that it is one of the most efficient methods among non-GPU algorithms, yet still keeps very high accuracy. We also demonstrate the effectiveness of the proposed algorithm on various real-world, high-resolution, self-calibrated data sets including objects with complex details, objects with large area of highlight, and objects with non-Lambertian surface.
August 31, 2011 by hgpu