Algebraic Relations among Matching Constraints of Multiple Images
Abstract
Given a set of $n\ge2$ uncalibrated views, for any corresponding point across $n$ views, there exist three types of matching constraints: bilinear constraints(for $n\ge2$), trilinear constraints (for $n\ge3$, \cite{shashua94c- }) and quadrilinear constraints (for $n \ge 4$, \cite{hartley94d,triggs95a,fau- geras95a}). The exact algebraic relations among these multi-linear constraints have not been elucidated by previous authors. This paper examines the relations between these matching constraints by singling out the degenerate view and point configurations. The key result that will be established is that for generic view configurations and generic points, all multi-linear constraints may algebraically be reduced to the algebraically independent bilinear constraints- . In other words, all matching constraints are contained in the ideal generated only by the bilinear constraints for generic views and points. As a consequence, $2n-3$ algebraically independent bilinearities from pairs of views completely describe the algebraic/geometric structure of $n$ uncalibrated views for generic views and points. For degenerate points of generic views, each type of constraint reduces differently. The exact reduced form of the matching constraints are also made explicit by computer algebra.