LAUSR

Abstract The article considers the conforming identification f the fundamental matrix in the image matching problem. The method consists in the divisi on of the initial overdetermined system into lesser dimensional subsystems. On these subsys tems, 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 for med by all possible combinations of rows in the initial system, this method demonstrates hig h accuracy and stability, although it is computationally complex. A comparison with the meth ods of least squares, least absolute deviations, and the RANSAC method is drawn.