Modified winner-update search algorithm for fast block matching
Pattern Recognition Letters - Video computing
Analog Integrated Circuits and Signal Processing
Fast Vector Matching Methods and Their Applications to Handwriting Recognition
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Survey on Block Matching Motion Estimation Algorithms and Architectures with New Results
Journal of VLSI Signal Processing Systems
Accelerating feature-vector matching using multiple-tree and sub-vector methods
Pattern Recognition
Stabilized linear model for neuromagnetic source localization
BIEN '07 Proceedings of the fifth IASTED International Conference: biomedical engineering
Fast block matching using prediction and rejection criteria
Signal Processing
Efficient hierarchical motion estimation algorithm and its VLSI architecture
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Application of Kohonen network for automatic point correspondence in 2D medical images
Computers in Biology and Medicine
Video block motion estimation based on gray-code kernels
IEEE Transactions on Image Processing
Efficient NCC-Based Image Matching Based on Novel Hierarchical Bounds
PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Colorization of black-and-white cartoons
Image and Vision Computing
A model-based adaptive motion estimation scheme using Renyi's entropy for wireless video
Journal of Visual Communication and Image Representation
Fast normalized cross correlation based on adaptive multilevel winner update
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Multimodal genetic algorithms-based algorithm for automatic point correspondence
Pattern Recognition
Fast global motion estimation via iterative least-square method
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
Fingerprint mosaicking by rolling and sliding
AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
Machine efficient adaptive image matching based on the nonparametric transformations
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Adaptive window growing technique for efficient image matching
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I
Region-growing detection of moving objects in video sequences based on optical flow
Pattern Recognition and Image Analysis
Hierarchical stereo matching based on image bit-plane slicing
ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume 2
Hi-index | 0.01 |
Block matching is a widely used method for stereo vision, visual tracking, and video compression. Many fast algorithms for block matching have been proposed in the past, but most of them do not guarantee that the match found is the globally optimal match in a search range. This paper presents a new fast algorithm based on the winner-update strategy which utilizes an ascending lower bound list of the matching error to determine the temporary winner. Two lower bound lists derived by using partial distance and by using Minkowski's inequality are described. The basic idea of the winner-update strategy is to avoid, at each search position, the costly computation of the matching error when there exists a lower bound larger than the global minimum matching error. The proposed algorithm can significantly speed up the computation of the block matching because (1) computational cost of the lower bound we use is less than that of the matching error itself; (2) an element in the ascending lower bound list will be calculated only when its preceding element has already been smaller than the minimum matching error computed so far; (3) for many search positions, only the first several lower bounds in the list need to be calculated. Our experiments have shown that, when applying to motion vector estimation for several widely-used test videos, 92% to 98% of operations can be saved while still guaranteeing the global optimality. Moreover, the proposed algorithm can be easily modified either to meet the limited time requirement or to provide an ordered list of best candidate matches