ML Anthology

Efficient Iterative Solution to M-View Projective Reconstruction Problem

Qian Chen, Gérard G. Medioni
CVPR 1999 pp. 2055-2061
doi:10.1109/CVPR.1999.784608 /cvpr/1999/chen1999cvpr-efficient/

Abstract

We propose an efficient solution to the general M-view projective reconstruction problem, using matrix factorization and iterative least squares. The method can accept input with missing data, meaning that not all points are necessarily visible in all views. It runs much faster than the often-used non-linear minimization method, while preserving the accuracy of the latter. The key idea is to convert the minimization problem into a series of weighted least squares sub-problems with drastically reduced matrix sizes. Additionally, we show that good initial values can always be obtained. Experimental results on both synthetic and real data are presented. Potential applications are also demonstrated.

CVPR Semantic Scholar

Cite

Text

Chen and Medioni. "Efficient Iterative Solution to M-View Projective Reconstruction Problem." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1999. doi:10.1109/CVPR.1999.784608

Markdown

[Chen and Medioni. "Efficient Iterative Solution to M-View Projective Reconstruction Problem." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1999.](https://mlanthology.org/cvpr/1999/chen1999cvpr-efficient/) doi:10.1109/CVPR.1999.784608

BibTeX

@inproceedings{chen1999cvpr-efficient,
  title     = {{Efficient Iterative Solution to M-View Projective Reconstruction Problem}},
  author    = {Chen, Qian and Medioni, Gérard G.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1999},
  pages     = {2055-2061},
  doi       = {10.1109/CVPR.1999.784608},
  url       = {https://mlanthology.org/cvpr/1999/chen1999cvpr-efficient/}
}