IMAGE PROCESSING, PATTERN RECOGNITION
Conforming identification of the fundamental matrix in image matching problem
V. A. Fursovab, A. V. Gavrilova, E. V. Goshinab, K. G. Pugacheva
a Samara National Research University, Samara, Russia
b Image Processing Systems Institute of the RAS - Branch of the FSRC "Crystallography and Photonics" RAS, Samara, Russia
The article considers the conforming identification of the fundamental matrix in the image matching problem. The method consists in the division of the initial overdetermined system into lesser dimensional subsystems. On these subsystems, a set of solutions is obtained, from which a subset of the most conforming solutions is defined. Then, on this subset the resulting solution is deduced. Since these subsystems are formed by all possible combinations of rows in the initial system, this method demonstrates high accuracy and stability, although it is computationally complex. A comparison with the methods of least squares, least absolute deviations, and the RANSAC method is drawn.
conforming identification; parallel algorithm; least squares method; least absolute deviations; epipolar geometry; projective geometry.
PDF file (738 kB)
V. A. Fursov, A. V. Gavrilov, E. V. Goshin, K. G. Pugachev, “Conforming identification of the fundamental matrix in image matching problem”, Computer Optics, 41:4 (2017), 559–563
Citation in format AMSBIB
\by V.~A.~Fursov, A.~V.~Gavrilov, E.~V.~Goshin, K.~G.~Pugachev
\paper Conforming identification of the fundamental matrix in image matching problem
\jour Computer Optics
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|