Homography-based partitioning of curved surface for stereo correspondence establishment

Planar homography (collineation) is an image-to-image mapping that could be used to pinpoint stereo correspondences, but its usage has been limited to only planar scenes. This paper describes a mechanism that generalizes the use of planar homography for establishing stereo correspondences over curved scenes. Piecewise-linear approximation is used to describe curved scene, so that stereo correspondences over images of the scene are captured by a collection of local homographies. Unlike the classical approaches, the mechanism does not employ the smoothness heuristic in establishing correspondences, but is instead based upon the interplay of two processes in an iterative manner: (1) partitioning of the scene into local planar patches based upon the most current set of confirmed stereo correspondences; and (2) prediction of new stereo correspondences by the use of the local homographies defined by the partitions, plus confirmation of such predictions by the image data, thereby enlarging the set of confirmed correspondences in every iteration until no more improvement could be obtained. A key step of the mechanism is to decide what local planar homography, and thereby what planar patch, is to be used for correspondence prediction of any given unmatched feature in any given iteration of the mechanism. With knowledge of the epipolar geometry, homography could be defined by any 3 non-collinear feature correspondences. Thus for any given unmatched feature, there are choices of the aforementioned local homography as defined by any set of three non-collinear matched features in the vicinity of the feature. In this paper, we explore what criteria are to be used to decide which of such triplet sets of matched features should be used. We analyze what errors in correspondence prediction could come with a planar homography. In particular, we classify the errors into scene-related geometric error and computation-related algebraic error. We examine their effects by simulated data experiments, and propose two ways of deciding which local homography to adopt for any given unmatched feature point. Real image experiments show that the methods could lead to promising results.

[1]  Manolis I. A. Lourakis,et al.  Matching disparate views of planar surfaces using projective invariants , 2000, Image Vis. Comput..

[2]  Thierry Viéville,et al.  Canonic Representations for the Geometries of Multiple Projective Views , 1994, ECCV.

[3]  Andrew Zisserman,et al.  Multiple view geometry in computer visiond , 2001 .

[4]  Richard I. Hartley,et al.  In Defense of the Eight-Point Algorithm , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Graeme A. Jones,et al.  Constraint, Optimization, and Hierarchy: Reviewing Stereoscopic Correspondence of Complex Features , 1997, Comput. Vis. Image Underst..

[6]  Richard I. Hartley,et al.  In defence of the 8-point algorithm , 1995, Proceedings of IEEE International Conference on Computer Vision.

[7]  Naoya Ohta,et al.  Accuracy bounds and optimal computation of homography for image mosaicing applications , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[8]  O. Faugeras Stratification of three-dimensional vision: projective, affine, and metric representations , 1995 .

[9]  Lihi Zelnik-Manor,et al.  Multiview Constraints on Homographies , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Hideyuki Suzuki,et al.  Stereo matching algorithm for curved objects based on isodensity lines and a new method for interval corresponding estimation , 1999, Systems and Computers in Japan.

[11]  Joon Hee Han,et al.  Contour Matching Using Epipolar Geometry , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Richard Szeliski,et al.  Geometrically Constrained Structure from Motion: Points on Planes , 1998, SMILE.

[13]  Jean-Daniel Boissonnat,et al.  How the Delaunay Triangulation Can Be used For Representing Stereo Data , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[14]  O. Faugeras Three-dimensional computer vision: a geometric viewpoint , 1993 .

[15]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[16]  Jake K. Aggarwal,et al.  Structure from stereo-a review , 1989, IEEE Trans. Syst. Man Cybern..

[17]  Amnon Shashua,et al.  Algebraic Functions For Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Thierry Viéville,et al.  Canonical Representations for the Geometries of Multiple Projective Views , 1996, Comput. Vis. Image Underst..

[19]  Amnon Shashua,et al.  The Rank 4 Constraint in Multiple (>=3) View Geometry , 1996, ECCV.

[20]  Rachid Deriche,et al.  A Robust Technique for Matching two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry , 1995, Artif. Intell..