Adrien Bartoli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Adrien Bartoli has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Pizarro
Department of Electronics, Universidad de Alcalá, Alcalá de Henares, Spain
2 shared publications François Gaspard
1 shared publication- Jean-Philippe Tardif
Université de Montréal, Canada
1 shared publication Julien Michot
1 shared publicationMarco Loog
1 shared publication- Martin Trudeau
Université de Montréal, Canada
1 shared publication
Latest Publications
- 1 June 2015
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 135, 141-156
Metric corrections of the affine camera
- 1 June 2015
- Published by Elsevier in Computer Vision and Image Understanding
- Vol. 135, 141-156
Metric corrections of the affine camera
- 1 January 2009
- Published by British Machine Vision Association and Society for Pattern Recognition
- p. 44
Algebraic Line Search for Bundle Adjustment
- 1 January 2009
- Published by British Machine Vision Association and Society for Pattern Recognition
- p. 44
Algebraic Line Search for Bundle Adjustment
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 1-8
Algorithms for Batch Matrix Factorization with Application to Structure-from-Motion
Matrix factorization is a key component for solving several computer vision problems. It is particularly challenging in the presence of missing or erroneous data, which often arise in structure-from-motion. We propose batch algorithms for matrix factorization. They are based on closure and basis constraints, that are used either on the cameras or the structure, leading to four possible algorithms. The constraints are robustly computed from complete measurement sub-matrices with e.g. random data sampling. The cameras and 3D structure are then recovered through linear least squares. Prior information about the scene such as identical camera positions or orientations, smooth camera trajectory, known 3D points and coplanarity of some 3D points can be directly incorporated. We demonstrate our algorithms on challenging image sequences with tracking error and more than 95% missing data.
- 1 June 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636919,p. 1-8
Algorithms for Batch Matrix Factorization with Application to Structure-from-Motion
Matrix factorization is a key component for solving several computer vision problems. It is particularly challenging in the presence of missing or erroneous data, which often arise in structure-from-motion. We propose batch algorithms for matrix factorization. They are based on closure and basis constraints, that are used either on the cameras or the structure, leading to four possible algorithms. The constraints are robustly computed from complete measurement sub-matrices with e.g. random data sampling. The cameras and 3D structure are then recovered through linear least squares. Prior information about the scene such as identical camera positions or orientations, smooth camera trajectory, known 3D points and coplanarity of some 3D points can be directly incorporated. We demonstrate our algorithms on challenging image sequences with tracking error and more than 95% missing data.