A fast and memory-saving algorithm for sequence-based image registration

被引:1
|
作者
机构
[1] China Airborne Missile Academy
来源
Wu, M. (wumingjun@gmail.com) | 1600年 / Editorial Office of High Power Laser and Particle Beams, P.O. Box 919-805, Mianyang, 621900, China卷 / 24期
关键词
Fast algorithm; Homography; Image registration; Image sequence; Memory-saving;
D O I
10.3788/HPLPB20122405.1038
中图分类号
学科分类号
摘要
A fast and memory-saving registration algorithm is proposed for image sequence-based computer vision applications. First, a new scheme, which is independent of the image content, is adopted to generate a series of feature points. Then, a forward-and-backward tracking approach is used to obtain the reliable feature point pairs. In the approach, the forward tracking is performed to get all the potential feature point pairs, and the backward tracking is utilized to measure the forward-backward discrepancies which enable selection of the final reliable point pairs. Finally, building upon these reliable pairs, the homography is computed by using normalized direct linear transformation. Due to the intensive exploitation of the interframe continuity existing in image sequences, the proposed registration algorithm provides comparable experimental results to current state-of-the-art techniques, while using a fraction of the computation time and a fraction of the memory as well. Specifically, with a memory usage of 421 kB only, this algorithm runs at 32 frames per second for a sequence with an image resolution of 480×360.
引用
收藏
页码:1038 / 1042
页数:4
相关论文
共 11 条
  • [1] Ozuysal M., Calonder M., Lepetit V., Et al., Fast keypoint recognition using random ferns, IEEE Trans on Pattern Anal Mach Intell, 32, 3, pp. 448-461, (2010)
  • [2] Mikolajczyk K., Tuytelaars T., Schmid C., Et al., A comparison of affine region detectors, International Journal of Computer Vision, 65, 1, pp. 43-72, (2005)
  • [3] Mikolajczyk K., Schmid C., A performance evaluation of local descriptors, IEEE Trans on Pattern Anal Mach Intell, 27, 10, pp. 1615-1630, (2005)
  • [4] Shi J., Tomasi C., Good features to track, IEEE Conference on Computer Vision and Pattern Recognition, pp. 593-600, (1994)
  • [5] Lowe D.G., Distinctive image features from scale-invariant keypoints, International Journal of Computer Vision, 60, 2, pp. 91-110, (2004)
  • [6] Bay H., Ess A., Tuytelaars T., Et al., SURF: Speeded up robust features, Computer Vision and Image Understanding, 110, 3, pp. 346-359, (2008)
  • [7] Rosten E., Porter R., Drummond T., Faster and better: A machine learning approach to corner detection, IEEE Trans on Pattern Anal Mach Intell, 32, 1, pp. 105-119, (2010)
  • [8] Calonder M., Lepetit V., Strecha C., Et al., BRIEF: Binary robust independent elementary features, The 11th European Conference on Computer Vision, (2010)
  • [9] Fischler M.A., Rolles R.C., Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography, Commun ACM, 24, 6, pp. 381-395, (1981)
  • [10] Rousseeuw P.J., Leroy A., Robust Regression and Outlier Detection, (1987)