Algebraic Relations among Matching Constraints of Multiple Images
نویسنده
چکیده
Given a set of n 2 uncalibrated views, for any corresponding point across n views, there exist three types of matching constraints: bilinear constraints (for n 2), trilinear constraints (for n 3, [12]) and quadrilinear constraints (for n 4, [6, 14, 3]). 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 con gurations. The key result that will be established is that for generic view con gurations 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 di erently. The exact reduced form of the matching constraints are also made explicit by computer algebra. Key-words: geometry, invariant, epipolar geometry, bilinearity, trilinear ity, uncalibrated image.
منابع مشابه
INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Algebraic Relations among Matching Constraints of Multiple Images
Given a set of n 2 2 uncalibrated views, for any corresponding point across n views, there exist three types of matching constraints: bilinear constraints (for n 2 2), trilinear constraints (for n 2 3, [12]) and quadrilinear constraints (for n 2 4, 16, 14, 31). The exact algebraic relations among these multi-1inea.r constraints have not been elu~ida~ted by previous authors. This paper examines ...
متن کاملOn the Geometry and Algebra of the Point and Line Correspondences Between N Images
We explore the geometric and algebraic relations that exist between correspondences of points and lines in an arbitrary number of images. We propose to use the formalism of the GrassmannCayley algebra as the simplest way to make both geometric and algebraic statements in a very synthetic and e ective way (i.e. allowing actual computation if needed). We have a fairly complete picture of the situ...
متن کاملAbout the Correspondences of Points between N Images
We analyze the correspondence of points between an arbitrary number of images, from an algebraic and geometric point of view. We use the formalism of the Grassmann-Cayley algebra as the simplest way to make both geometric and algebraic statements in a very synthetic and eeective way (i.e. allowing actual computation if needed). We propose a systematic way to describe the algebraic relations whi...
متن کاملAbout the correspondences of points between N imagesO
We analyze the correspondence of points between an arbitrary number of images, from an algebraic and geometric point of view. We use the formalism of the Grassmann-Cayley algebra as the simplest way to make both geometric and algebraic statements in a very synthetic and eeective way (i.e. allowing actual computation if needed). We propose a systematic way to describe the algebraic relations whi...
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999