Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Robust multiple homography estimation: an ill-solved problem|
Van Den Hengel, A.
|Citation:||Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2015 / vol.07-12-June-2015, pp.2132-2141|
|Series/Report no.:||IEEE Conference on Computer Vision and Pattern Recognition|
|Conference Name:||IEEE Conference on Computer Vision and Pattern Recognition (CVPR) (07 Jun 2015 - 12 Jun 2015 : Boston, MA)|
|Zygmunt L. Szpak, Wojciech Chojnacki, Anton van den Hengel|
|Abstract:||The estimation of multiple homographies between two piecewise planar views of a rigid scene is often assumed to be a solved problem. We show that contrary to popular opinion various crucial aspects of the task have not been adequately emphasised. We are motivated by a growing body of literature in robust multi-structure estimation that purports to solve the multi-homography estimation prob- lem but in fact does not. We demonstrate that the estima- tion of multiple homographies is an ill-solved problem by deriving new constraints that a set of mutually compatible homographies must satisfy, and by showing that homogra- phies estimated with prevailing methods fail to satisfy the requisite constraints on real-world data. We also explain why incompatible homographies imply inconsistent epipo- lar geometries. The arguments and experiments presented in this paper signal the need for a new generation of robust multi-structure estimation methods that have the capacity to enforce constraints on projective entities such as homog- raphy matrices.|
|Rights:||© 2015 IEEE|
|Appears in Collections:||Computer Science publications|
Files in This Item:
|RA_hdl_107900.pdf||Restricted Access||288.54 kB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.