A robust matching algorithm based on global motion smoothness criterion

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

This article is free to access.

Abstract

A new robust matching algorithm for motion detection and computation of precise estimates of motion vectors of moving objects in a sequence of images is presented. Common matching algorithms of dynamic image analysis usually utilize local smoothness constraints. The proposed method exploits global motion smoothness. The suggested matching algorithm is robust to motion discontinuity as well as to noise degradation of a signal. Computer simulation and experimental results demonstrate an excellent performance of the method in terms of dynamic motion analysis. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Mozerov, M., & Kober, V. (2005). A robust matching algorithm based on global motion smoothness criterion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3773 LNCS, pp. 295–301). https://doi.org/10.1007/11578079_31

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