Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Digital Image Processing: PIKS Inside
Digital Image Processing: PIKS Inside
Robust Multi-Sensor Image Alignment
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
ZNCC-based template matching using bounded partial correlation
Pattern Recognition Letters
Standard Codecs: Image Compression to Advanced Video Coding
Standard Codecs: Image Compression to Advanced Video Coding
A Class of Algorithms for Fast Digital Image Registration
IEEE Transactions on Computers
Successive elimination algorithm for motion estimation
IEEE Transactions on Image Processing
IEEE Transactions on Circuits and Systems for Video Technology
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
Exploiting transitivity of correlation for fast template matching
IEEE Transactions on Image Processing
Efficient template matching for multi-channel images
Pattern Recognition Letters
Hi-index | 0.00 |
Strong temporal correlation between adjacent frames of a video signal has been successfully exploited in standard video compression algorithms. In this work, we show that the temporal correlation in a video signal can also be used for fast video to reference image alignment. To this end, we first divide the input video sequence into groups of pictures (GOPs). Then for each GOP, only one frame is completely correlated with the reference image, while for the remaining frames, upper and lower bounds on the correlation coefficient (ρ) are calculated. These newly proposed bounds are significantly tighter than the existing Cauchy-Schwartz inequality based bounds on ρ. These bounds are used to eliminate majority of the search locations and thus resulting in significant speedup, without effecting the value or location of the global maxima. In our experiments, up to 80% search locations are found to be eliminated and the speedup is up to five times the FFT based implementation and up to seven times the spatial domain techniques.