Abstract : We present an efficient algorithm to fuse two-view correspondences into multi-view consistent tracks. The proposed method relies on the Union-Find algorithm to solve the fusion problem. It is very simple and has a lower computational complexity than other available methods. Our experiments show that it is faster and computes more tracks.
https://hal-enpc.archives-ouvertes.fr/hal-00769267
Contributeur : Pierre Moulon
<>
Soumis le : dimanche 30 décembre 2012 - 17:21:34
Dernière modification le : mercredi 4 juillet 2018 - 16:33:30
Document(s) archivé(s) le : dimanche 18 décembre 2016 - 10:28:50
