#### DMCA

## A Robust Technique for Matching Two Uncalibrated Images Through the Recovery of the Unknown Epipolar Geometry (1994)

Citations: | 548 - 36 self |

### Citations

2900 |
Robust Statistics
- Huber
- 1981
(Show Context)
Citation Context ... the robustness of vision algorithms because the data are unavoidably error prone [17, 60]. Many the so-called robust regression methods have been proposed that are not so easily affected by outliers =-=[25, 48]-=-. The reader is referred to [48, Chap. 1] for a review of different robust methods. The two most popular robust methods are the M-estimators and the least-median-of-squares (LMedS) method (see Sect. 6... |

2418 | A combined corner edge detector.
- Harris, Stephens
- 1988
(Show Context)
Citation Context ...ve been proposed within this group are generally based on the measurement of the gradients and of the curvatures of the surface (see [11] for a review). In our application, we use the corner detector =-=[19]-=-, which is a slightly modified version of the Plessey corner detector [20, 41]. It is based on the following operator: R(x; y) = det[sC] \Gamma k trace 2 [sC] ; (3) INRIA A Robust Technique for Matchi... |

1685 |
Robust Regression and Outlier Detection
- Rousseeuw, Leroy
- 1987
(Show Context)
Citation Context ... the robustness of vision algorithms because the data are unavoidably error prone [17, 60]. Many the so-called robust regression methods have been proposed that are not so easily affected by outliers =-=[25, 48]-=-. The reader is referred to [48, Chap. 1] for a review of different robust methods. The two most popular robust methods are the M-estimators and the least-median-of-squares (LMedS) method (see Sect. 6... |

1023 | Computer Vision
- Ballard, Brown
- 1982
(Show Context)
Citation Context ... two categories: 1. Template matching. In this category, the algorithms attempt to correlate the grey levels of image patches in the views being considered, assuming that they present some similarity =-=[4, 15, 16, 7, 14]-=-. The underlying assumption appears to be a valid one for relatively textured areas and for image pairs with small difference; however it may be wrong at occlusion boundaries and within featureless re... |

782 |
A computer algorithm for reconstructing a scene from two projections
- Longuet-Higgins
- 1981
(Show Context)
Citation Context ... lie in a single plane. This is the well-known co-planarity constraint or epipolar equation in solving motion and structure from motion problems when the intrinsic parameters of the cameras are known =-=[29]-=-. Let the displacement from the first camera to the second be (R; t). Let m 1 and m 2 be the images of a 3-D point M on the cameras. Without loss of generality, we assume that M is expressed in the co... |

596 |
The Interpretation of Visual Motion
- Ullman
- 1979
(Show Context)
Citation Context ... because only a small subset of the image pixels are used, but may fail if the chosen primitives cannot be reliably detected in the images. The following list of references is by no means exhaustive: =-=[54, 50, 5, 6, 45, 35, 22, 55]-=- The approach we propose in this paper aims at exploiting the only geometric constraint, i.e., the epipolar constraint, to establish robustly correspondences between two perspective images of a single... |

407 |
Scene labeling by relaxation operations
- Rosenfeld, Hummel, et al.
- 1976
(Show Context)
Citation Context ...hus saving half of the computation. There are several strategies for updating the matching in order to minimize the total energy. The first is the "winner-take-all ", as exploited by Rosenfe=-=ld et al. [47]-=-, Zucker et al. [61], and Pollard et al. [44]. The method works as follows. At each iteration, any matches which have the highest matching strengths for both of the two image points that formed them a... |

395 | Estimating three-dimensional motion parameters of a rigid planar patch I
- Tsai, Huang
- 1981
(Show Context)
Citation Context ... to the essential matrix E = t \Theta R [29, 23] by F = A \GammaT 2 EA \Gamma1 1 : It is thus clear that if the cameras are calibrated, the problem becomes the one of motion and structure from motion =-=[29, 53, 39, 13, 1, 56, 24]-=-. 4 Finding Candidate Matches by Correlation Before recovering the epipolar geometry, we must establish a few correspondences between images. To this end, a corner detector is first applied to each im... |

324 | Robust multiresolution estimation of parametric motion models
- Odobez, Bouthemy
- 1995
(Show Context)
Citation Context ... applied the LMedS estimator to detect moving objects using point correspondences between orthographic views. Other recent works on the application of robust techniques to motion segmentation include =-=[52, 42, 3]-=-. Regarding the robust recovery of the epipolar geometry, our work is closely related to that of Olsen [43] and that of Shapiro and Brady [49]. Olsen uses a linear method to estimate the epipolar geom... |

316 |
Faugeras, “A Theory of Self-Calibration of a Moving Camera
- Maybank, D
- 1992
(Show Context)
Citation Context ....e., the vertexes of the two pencils of epipolar lines) and the 3 parameters of the homography between these two pencils. This is the only geometric information available from two uncalibrated images =-=[36, 31]-=-. This implies that the fundamental matrix has only seven degrees of freedom. Indeed, it is only defined up to a scale factor and its determinant is zero. Geometrically, F ~ m 1 defines the epipolar l... |

270 |
Robust regression methods for computer vision: a review
- Meer, Mintz, et al.
- 1991
(Show Context)
Citation Context ...timators and the least-median-of-squares (LMedS) method (see Sect. 6.3). Kumar and Hanson [26] compared different robust methods for pose refinement from 3D-2D line correspondences, while Meer et al. =-=[38]-=-, for image smoothing. Haralick et al. [18] applied M-estimators to solve the pose problem from point correspondences. Thompson et al. [51] applied the LMedS estimator to detect moving objects using p... |

234 | The curvature primal sketch
- Asada, Brady
- 1986
(Show Context)
Citation Context ...iterature in the last few years. They can be broadly divided into two groups: The first group consists in first extracting edges as a chain code, and then searching for points having maxima curvature =-=[10, 2, 37]-=- or performing a polygonal approximation on the chains and then searching for the line segment intersections [21]. The second group works directly on a grey-level image. The large number of techniques... |

205 |
Motion and structure from two perspective views: Algorithms, error analysis, and error estimation
- Weng, Huang, et al.
- 1989
(Show Context)
Citation Context ... to the essential matrix E = t \Theta R [29, 23] by F = A \GammaT 2 EA \Gamma1 1 : It is thus clear that if the cameras are calibrated, the problem becomes the one of motion and structure from motion =-=[29, 53, 39, 13, 1, 56, 24]-=-. 4 Finding Candidate Matches by Correlation Before recovering the epipolar geometry, we must establish a few correspondences between images. To this end, a corner detector is first applied to each im... |

199 | Structural descriptions and inexact matching
- Shapiro, Haralick
- 1981
(Show Context)
Citation Context ... because only a small subset of the image pixels are used, but may fail if the chosen primitives cannot be reliably detected in the images. The following list of references is by no means exhaustive: =-=[54, 50, 5, 6, 45, 35, 22, 55]-=- The approach we propose in this paper aims at exploiting the only geometric constraint, i.e., the epipolar constraint, to establish robustly correspondences between two perspective images of a single... |

189 |
Motion and structure from feature correspondences: a review
- Huang, Netravali
- 1984
(Show Context)
Citation Context ... to the essential matrix E = t \Theta R [29, 23] by F = A \GammaT 2 EA \Gamma1 1 : It is thus clear that if the cameras are calibrated, the problem becomes the one of motion and structure from motion =-=[29, 53, 39, 13, 1, 56, 24]-=-. 4 Finding Candidate Matches by Correlation Before recovering the epipolar geometry, we must establish a few correspondences between images. To this end, a corner detector is first applied to each im... |

179 |
PMF: A stereo correspondence algorithm using a disparity gradient limit
- Pollard, Mayhew, et al.
- 1985
(Show Context)
Citation Context ...m 1i ; m 2j ; n 1k ; n 2l ) and " r is a threshold on the relative distance difference. The above definition of the strength of a match is similar in the form to that used in the PMF stereo algor=-=ithm [44]-=-. Several remarks can be made regarding our measure of matching support. ffl Firstly, the strength of a match actually counts the number of candidate matches found in the neighborhoods, but only those... |

176 | Disparity analysis of images
- Barnard, Thompson
- 1980
(Show Context)
Citation Context ... because only a small subset of the image pixels are used, but may fail if the chosen primitives cannot be reliably detected in the images. The following list of references is by no means exhaustive: =-=[54, 50, 5, 6, 45, 35, 22, 55]-=- The approach we propose in this paper aims at exploiting the only geometric constraint, i.e., the epipolar constraint, to establish robustly correspondences between two perspective images of a single... |

167 |
On the computation of motion from sequences of images- a review
- Aggarwal, Nandhakumar
- 1988
(Show Context)
Citation Context |

138 |
A parallel stereo algorithm that produces dense depth maps and preserves image features
- Fua
- 1993
(Show Context)
Citation Context ... two categories: 1. Template matching. In this category, the algorithms attempt to correlate the grey levels of image patches in the views being considered, assuming that they present some similarity =-=[4, 15, 16, 7, 14]-=-. The underlying assumption appears to be a valid one for relatively textured areas and for image pairs with small difference; however it may be wrong at occlusion boundaries and within featureless re... |

131 | Giraudon: A Computational Approach for Corner and Vertex Detection, Int
- Deriche, G
- 1993
(Show Context)
Citation Context ...ectly on a grey-level image. The large number of techniques that have been proposed within this group are generally based on the measurement of the gradients and of the curvatures of the surface (see =-=[11]-=- for a review). In our application, we use the corner detector [19], which is a slightly modified version of the Plessey corner detector [20, 41]. It is based on the following operator: R(x; y) = det[... |

116 | Outlier detection and motion segmentation
- Torr, Murray
- 1993
(Show Context)
Citation Context ... applied the LMedS estimator to detect moving objects using point correspondences between orthographic views. Other recent works on the application of robust techniques to motion segmentation include =-=[52, 42, 3]-=-. Regarding the robust recovery of the epipolar geometry, our work is closely related to that of Olsen [43] and that of Shapiro and Brady [49]. Olsen uses a linear method to estimate the epipolar geom... |

115 |
Tracking line segments
- Deriche
- 1990
(Show Context)
Citation Context ...istics in one form or another, for example, intensity similarity, which are not applicable to most cases. The difficulty is partly bypassed by taking long sequences of images over short time interval =-=[9, 58]-=-. Indeed, as the time interval is small and object velocity is constrained by physical laws, the interframe displacements of objects are bounded, i.e., the correspondence of a token at the subsequent ... |

114 | Stereo correspondence through feature grouping and maximal cliques
- Horaud, Skordas
- 1989
(Show Context)
Citation Context |

96 | On determining the Fundamental matrix: analysis of different methods and experimental results
- Luong, Deriche, et al.
- 1993
(Show Context)
Citation Context ...ork is closely related to that of Olsen [43] and that of Shapiro and Brady [49]. Olsen uses a linear method to estimate the epipolar geometry, which has already been shown in one of our previous work =-=[32]-=- to be insufficiently accurate. He further assumes that knowledge of the epipolar geometry, as in many practical cases, is available. In particular, he assumes the epipolar lines are almost aligned ho... |

95 | Robust Recovery of the Epipolar Geometry for an Uncalibrated Stereo
- Deriche, Zhang, et al.
- 1994
(Show Context)
Citation Context ...lar geometry, and then describe in detail the three steps of the proposed approach. A preliminary version of this paper appeared in the proceedings of the third European Conference on Computer Vision =-=[12]-=-. A similar idea has been independently exploited by Xu et al. [57, 40], who also searched for image correspondences through the recovery of the epipolar geometry. There are however two main differenc... |

74 | Finding corners
- Noble
- 1988
(Show Context)
Citation Context ...of the gradients and of the curvatures of the surface (see [11] for a review). In our application, we use the corner detector [19], which is a slightly modified version of the Plessey corner detector =-=[20, 41]. It -=-is based on the following operator: R(x; y) = det[sC] \Gamma k trace 2 [sC] ; (3) INRIA A Robust Technique for Matching Two Uncalibrated Images 9 wheresC is the following matrix:sC = " I 2 x d I ... |

67 |
Some properties of the E matrix in two-view motion estimation
- Huang, Faugeras
- 1989
(Show Context)
Citation Context ...ar line. Transposing equation 2 yields the symmetric relation from the second image to the first image. It can be shown that the fundamental matrix F is related to the essential matrix E = t \Theta R =-=[29, 23]-=- by F = A \GammaT 2 EA \Gamma1 1 : It is thus clear that if the cameras are calibrated, the problem becomes the one of motion and structure from motion [29, 53, 39, 13, 1, 56, 24]. 4 Finding Candidate... |

63 |
Matching two perspective views
- Weng, Ahuja, et al.
- 1992
(Show Context)
Citation Context |

60 |
Matrice Fondamentale et Calibration Visuelle sur l’EnvironnementVers une plus grande autonomie des systemes robotiques
- Luong
- 1992
(Show Context)
Citation Context ...damental constraint underlying any two images if they are perspective projections of one and the same scene. Let F = A \GammaT 2 TRA \Gamma1 1 , F is known as the fundamental matrix of the two images =-=[31]-=-. Without considering 3-D metric entities, we can think of the fundamental matrix as providing the two epipoles (i.e., the vertexes of the two pencils of epipolar lines) and the 3 parameters of the ho... |

60 |
Corner detection and curve representation using cubic b-spline
- Medioni, Yasumoto
- 1987
(Show Context)
Citation Context ...iterature in the last few years. They can be broadly divided into two groups: The first group consists in first extracting edges as a chain code, and then searching for points having maxima curvature =-=[10, 2, 37]-=- or performing a polygonal approximation on the chains and then searching for the line segment intersections [21]. The second group works directly on a grey-level image. The large number of techniques... |

50 |
Finding geometric and relational structures in an image
- Horaud, Veillon
- 1990
(Show Context)
Citation Context ...ng edges as a chain code, and then searching for points having maxima curvature [10, 2, 37] or performing a polygonal approximation on the chains and then searching for the line segment intersections =-=[21]-=-. The second group works directly on a grey-level image. The large number of techniques that have been proposed within this group are generally based on the measurement of the gradients and of the cur... |

49 |
Estimation of displacements from two 3-D frames obtained from stereo
- Zhang, Faugeras
- 1992
(Show Context)
Citation Context ...n initial set of correspondences. We could apply the same strategy as that of Xu et al. [57, 40]. In fact, it has been applied to solve the correspondence problem between two sets of 3D line segments =-=[59]-=-. When applying it to the problem addressed in this paper, we need 8 point correspondences in order to estimate the epipolar geometry. The complexity is then O(m 8 n 8 ). Suppose both m and n are 100,... |

48 |
Motion and structure from motion from point and line matches
- Faugeras, Lustman, et al.
- 1987
(Show Context)
Citation Context |

47 |
Segmentation of moving objects by robust motion parameter estimation over multiple frames
- Ayer, Schroeter, et al.
- 1994
(Show Context)
Citation Context ... applied the LMedS estimator to detect moving objects using point correspondences between orthographic views. Other recent works on the application of robust techniques to motion segmentation include =-=[52, 42, 3]-=-. Regarding the robust recovery of the epipolar geometry, our work is closely related to that of Olsen [43] and that of Shapiro and Brady [49]. Olsen uses a linear method to estimate the epipolar geom... |

47 | Determination of ego-motion from matched points
- Harris
- 1987
(Show Context)
Citation Context ...of the gradients and of the curvatures of the surface (see [11] for a review). In our application, we use the corner detector [19], which is a slightly modified version of the Plessey corner detector =-=[20, 41]. It -=-is based on the following operator: R(x; y) = det[sC] \Gamma k trace 2 [sC] ; (3) INRIA A Robust Technique for Matching Two Uncalibrated Images 9 wheresC is the following matrix:sC = " I 2 x d I ... |

43 | Recovering and characterizing image features using an efficient model based approach
- Deriche, Blaszka
- 1993
(Show Context)
Citation Context ...s us to recover a corner position up to pixel precision. In order to recover the corner position up to sub-pixel position, one uses the model based approach we have already developed and presented in =-=[8]-=-, where corners are extracted directly from the image by searching the parameters of the parametric model that best approximate the observed grey level image intensities around the corner position det... |

34 |
The reconstruction of a scene from two projections—Configurations that defeat the 8-point algorithm
- Longuet-Higgins
- 1984
(Show Context)
Citation Context ... This approach, known as the eight point algorithm, was introduced by Longuet-Higgins [29] for solving the motion and structure from motion problem, and has been extensively studied in the literature =-=[30, 53, 56, 27]-=- for the computation of the Essential matrix E (see Sect. 3). It has proven to be very sensitive to noise. In practice, we are given many more than 8 matches and we use a least-squares method to solve... |

33 |
A twostage cross correlation approach to template matching
- Goshtasby, Gage, et al.
- 1984
(Show Context)
Citation Context ... two categories: 1. Template matching. In this category, the algorithms attempt to correlate the grey levels of image patches in the views being considered, assuming that they present some similarity =-=[4, 15, 16, 7, 14]-=-. The underlying assumption appears to be a valid one for relatively textured areas and for image pairs with small difference; however it may be wrong at occlusion boundaries and within featureless re... |

32 |
Rejecting outliers and estimating errors in an orthogonal-regression framework
- Shapiro, Brady
- 1995
(Show Context)
Citation Context ...f robust techniques to motion segmentation include [52, 42, 3]. Regarding the robust recovery of the epipolar geometry, our work is closely related to that of Olsen [43] and that of Shapiro and Brady =-=[49]-=-. Olsen uses a linear method to estimate the epipolar geometry, which has already been shown in one of our previous work [32] to be insufficiently accurate. He further assumes that knowledge of the ep... |

27 |
Image registration by matching relational structures
- Cheng, Huang
- 1984
(Show Context)
Citation Context |

24 |
Modelling and identification of characteristic intensity variations
- Rohr
- 1992
(Show Context)
Citation Context ...accuracy of matched points. One possibility is to use subpixelprecision corner detector whenever possible. For example, if we are working in an indoor environment, we may use corner detectors such as =-=[11, 46, 8]-=-. Another possibility is to apply subpixel-precision correlation techniques. The idea is to compute the correlation RR n2273 34 Zhang, Deriche, Faugeras, Luong score for each point in the neighborhood... |

23 |
Computer vision theory: The lack thereof
- Haralick
- 1986
(Show Context)
Citation Context ...ar constraint, which is not addressed in this paper. Recently, computer vision researchers have paid much attention to the robustness of vision algorithms because the data are unavoidably error prone =-=[17, 60]-=-. Many the so-called robust regression methods have been proposed that are not so easily affected by outliers [25, 48]. The reader is referred to [48, Chap. 1] for a review of different robust methods... |

22 |
2D curve matching using high curvature points: Applications to stereo vision
- Deriche, Faugeras
- 1990
(Show Context)
Citation Context ...iterature in the last few years. They can be broadly divided into two groups: The first group consists in first extracting edges as a chain code, and then searching for points having maxima curvature =-=[10, 2, 37]-=- or performing a polygonal approximation on the chains and then searching for the line segment intersections [21]. The second group works directly on a grey-level image. The large number of techniques... |

21 |
Detecting moving objects using the rigidity constraint
- Thompson, Lechleider, et al.
- 1993
(Show Context)
Citation Context ...efinement from 3D-2D line correspondences, while Meer et al. [38], for image smoothing. Haralick et al. [18] applied M-estimators to solve the pose problem from point correspondences. Thompson et al. =-=[51]-=- applied the LMedS estimator to detect moving objects using point correspondences between orthographic views. Other recent works on the application of robust techniques to motion segmentation include ... |

20 | and O.D.Faugeras. A stability analysis for the fundamental matrix
- Luong
- 1994
(Show Context)
Citation Context ...es, and eventually compute the position with the largest correlation score. Stability The stability of our algorithm is directly related to that of finding the fundamental matrix, which is studied in =-=[33]-=-. One of the most stringent situations is that all points are located close to a critical surface, for example, a plane. If the points are almost on a plane, it is better to describe their relation be... |

20 |
Epipolar line estimation
- Olsen
- 1992
(Show Context)
Citation Context ...r recent works on the application of robust techniques to motion segmentation include [52, 42, 3]. Regarding the robust recovery of the epipolar geometry, our work is closely related to that of Olsen =-=[43]-=- and that of Shapiro and Brady [49]. Olsen uses a linear method to estimate the epipolar geometry, which has already been shown in one of our previous work [32] to be insufficiently accurate. He furth... |

18 |
A highly robust estimator through partially likelihood function modeling and its application in computer vision
- Zhuang, Wang, et al.
- 1992
(Show Context)
Citation Context ...ar constraint, which is not addressed in this paper. Recently, computer vision researchers have paid much attention to the robustness of vision algorithms because the data are unavoidably error prone =-=[17, 60]-=-. Many the so-called robust regression methods have been proposed that are not so easily affected by outliers [25, 48]. The reader is referred to [48, Chap. 1] for a review of different robust methods... |

17 |
Image sequences — ten (octal) years from phenomenology to a theoretical foundation
- Nagel
- 1988
(Show Context)
Citation Context |

17 |
Image sequence analysis using relational structures
- Radig
- 1984
(Show Context)
Citation Context |

13 |
Continuous relaxation and local maxima selection: conditions for equivalence
- Zucker, Leclerc, et al.
- 1981
(Show Context)
Citation Context ...he computation. There are several strategies for updating the matching in order to minimize the total energy. The first is the "winner-take-all ", as exploited by Rosenfeld et al. [47], Zuck=-=er et al. [61]-=-, and Pollard et al. [44]. The method works as follows. At each iteration, any matches which have the highest matching strengths for both of the two image points that formed them are immediately chose... |

12 |
Analysis of Different Robust Methods for Pose Refinement
- Kumar, Hanson
- 1990
(Show Context)
Citation Context ...ed to [48, Chap. 1] for a review of different robust methods. The two most popular robust methods are the M-estimators and the least-median-of-squares (LMedS) method (see Sect. 6.3). Kumar and Hanson =-=[26]-=- compared different robust methods for pose refinement from 3D-2D line correspondences, while Meer et al. [38], for image smoothing. Haralick et al. [18] applied M-estimators to solve the pose problem... |

10 |
A System for Digital Stereo Image Matching," Photogrammetric Engineering and Remote
- Hannah
(Show Context)
Citation Context |

9 |
Motion segmentation and correspondence using epipolar constraint
- Nishimura, Xu, et al.
(Show Context)
Citation Context ...oposed approach. A preliminary version of this paper appeared in the proceedings of the third European Conference on Computer Vision [12]. A similar idea has been independently exploited by Xu et al. =-=[57, 40]-=-, who also searched for image correspondences through the recovery of the epipolar geometry. There are however two main differences: ffl The weak perspective camera model is used in their work, and a ... |

9 |
Modelling and identi cation of characteristic intensity variations
- Rohr
- 1992
(Show Context)
Citation Context ... accuracy of matched points. One possibility is to use subpixelprecision corner detector whenever possible. For example, if we are working in an indoor environment, we may use corner detectors such as=-=[11,46,8]-=-. Another possibility isto apply subpixel-precision correlation techniques. The idea is to compute the correlation RR n 2273s34 Zhang, Deriche, Faugeras, Luong score for each point in the neighborhood... |

7 |
Time-varying images: the effect of finite resolution on uniqueness
- Lee
- 1991
(Show Context)
Citation Context ... This approach, known as the eight point algorithm, was introduced by Longuet-Higgins [29] for solving the motion and structure from motion problem, and has been extensively studied in the literature =-=[30, 53, 56, 27]-=- for the computation of the Essential matrix E (see Sect. 3). It has proven to be very sensitive to noise. In practice, we are given many more than 8 matches and we use a least-squares method to solve... |

6 |
Moment-preserving pattern matching
- Chou, Chen
- 1990
(Show Context)
Citation Context |

5 |
et al. Pose estimation from corresponding point data
- Haralick
- 1989
(Show Context)
Citation Context ...MedS) method (see Sect. 6.3). Kumar and Hanson [26] compared different robust methods for pose refinement from 3D-2D line correspondences, while Meer et al. [38], for image smoothing. Haralick et al. =-=[18]-=- applied M-estimators to solve the pose problem from point correspondences. Thompson et al. [51] applied the LMedS estimator to detect moving objects using point correspondences between orthographic v... |

4 |
Recovering and characterizing image features using an e cient model based approach
- Deriche, Blaszka
- 1993
(Show Context)
Citation Context ...ows us to recover a corner position up to pixel precision. In order to recover the corner position up to sub-pixel position, one uses the model based approachwehave already developed and presented in =-=[8]-=-, where corners are extracted directly from the image by searching the parameters of the parametric model that best approximate the observed grey level image intensities around the corner position det... |

3 |
Time-varying images: the e ect of nite resolution on uniqueness
- Lee
- 1991
(Show Context)
Citation Context ... This approach, known as the eight point algorithm, was introduced by Longuet-Higgins [29] for solving the motion and structure from motion problem, and has been extensively studied in the literature =-=[30, 53, 56, 27]-=- for the computation of the Essential matrix E (see Sect. 3). It has proven to be very sensitive to noise. In practice, we are given many more than 8 matches and we use a least-squares method to solve... |

2 |
Inexact matching of 3D surfaces
- Li
(Show Context)
Citation Context ...s for both constituent points. This method proceeds as a steepest-descent approach, and is thus fast. However, it may get stuck easily at a bad local minimum. The second is the "looser-take-nothi=-=ng " [28]-=-. The method works as follows. For each point in the first image, the candidate which has gained the weakest matching strength is eliminated. The process suppresses at most one candidate at each itera... |

2 |
Image correspondence and segmentation by epipolar lines: Theory, algorithm and applications
- Xu, Nishimura, et al.
- 1993
(Show Context)
Citation Context ...oposed approach. A preliminary version of this paper appeared in the proceedings of the third European Conference on Computer Vision [12]. A similar idea has been independently exploited by Xu et al. =-=[57, 40]-=-, who also searched for image correspondences through the recovery of the epipolar geometry. There are however two main differences: ffl The weak perspective camera model is used in their work, and a ... |

1 | An adjustment-free stereo matching algorithm
- Ma, Thonnat, et al.
- 1993
(Show Context)
Citation Context ...y our algorithm because only the epipolar constraint is used for outlier rejection. This of course does not disturb the estimation of the fundamental matrix. A good stereo matching algorithm, such as =-=[44, 34]-=-, should be used to exploit other constraints like a disparity gradient limit. Acknowledgment The authors thank Thierry Blaszka for the corner detection code, Cyril Zeller for the correlation code and... |

1 |
Improving dydamic programming to solve image registration
- Matre, Wu
- 1987
(Show Context)
Citation Context |

1 |
Token tracking in a cluttered scene. Int'l
- Zhang
- 1994
(Show Context)
Citation Context ...istics in one form or another, for example, intensity similarity, which are not applicable to most cases. The difficulty is partly bypassed by taking long sequences of images over short time interval =-=[9, 58]-=-. Indeed, as the time interval is small and object velocity is constrained by physical laws, the interframe displacements of objects are bounded, i.e., the correspondence of a token at the subsequent ... |

1 |
Analysis of di erent robust methods for pose re nement
- Kumar, Hanson
- 1990
(Show Context)
Citation Context ...red to [48, Chap. 1] for a review of di erent robust methods. The two most popular robust methods are the M-estimators and the least-median-of-squares (LMedS) method (see Sect. 6.3). Kumar and Hanson =-=[26]-=- compared di erent robust methods for pose re nement from 3D-2D line correspondences, while Meer et al. [38], for image smoothing. Haralick et al. [18] applied M-estimators to solve the pose problem f... |