An algorithm for computation of the scene geometry by the log-polar area matching around salient points

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Computation of a scene geometry belongs to the one of the fundamental problems of computer vision. It can be computed from point correspondences found in a pair of stereo images or a video sequence. This is achieved by an image matching algorithm. However, found correspondences usually are burdened with large errors due to noise and outliers. In this paper we propose an improvement to the point matching algorithm which is twofold. At first the salient points are found which are corners detected by the structural tensor. Then the log-polar representations are computed around found salient points and the matching is done in the extended log-polar space. Such representation has very desirable properties which allow detection of a local change of scale and rotation of the matched areas. This feature is employed in the matching algorithm to eliminate outliers. The proposed method can be used in variety of computer vision tasks, such as stereovision, recovering shape and motion from video, or camera calibration and autocalibration. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Cyganek, B. (2008). An algorithm for computation of the scene geometry by the log-polar area matching around salient points. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4910 LNCS, pp. 222–233). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free