The equivalence of two definitions of compatible homography matrices
Artikel i vetenskaplig tidskrift, 2020

In many computer vision applications, one acquires images of planar surfaces from two different vantage points. One can use a projective transformation to map pixel coordinates associated with a particular planar surface from one image to another. The transformation, called a homography, can be represented by a unique, to within a scale factor, 3 × 3 matrix. One requires a different homography matrix, scale differences apart, for each planar surface whose two images one wants to relate. However, a collection of homography matrices forms a valid set only if the matrices satisfy consistency constraints implied by the rigidity of the motion and the scene. We explore what it means for a set of homography matrices to be compatible and show that two seemingly disparate definitions are in fact equivalent. Our insight lays the theoretical foundations upon which the derivation of various sets of homography consistency constraints can proceed.


Wojciech Chojnacki

University of Adelaide

Zygmunt L Szpak

University of Adelaide

Mårten Wadenbäck

Chalmers, Matematiska vetenskaper, Tillämpad matematik och statistik

Göteborgs universitet

Pattern Recognition Letters

0167-8655 (ISSN)

Vol. 135 38-43




Grundläggande vetenskaper



Mer information