An FFT-Based Technique and Best-first Search for Image Registration

被引:12
|
作者
Samritjiarapon, Olan [1 ]
Chitsobhuk, Orachat [1 ]
机构
[1] King Mongkuts Inst Technol Ladkrabang, Fac Engn, Bangkok, Thailand
关键词
image registration; phase correlation; best-first search;
D O I
10.1109/ISCIT.2008.4700214
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The image registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different time, from different sensors, or from different viewpoints. One of the major challenges related to image registration is the estimation of large motion, when input images contain small overlapped area. Common image registration using the search algorithm can accurately finds large motion but requires high computation cost due to large search space. Fourier-based technique is an alternative approach since it can rapidly achieve the registration results through its FFT algorithm. However, only Fourier-based technique cannot produce the correct results in the case of large translation. Thus, this paper presents a Fourier-based technique cooperated with best-first search algorithm to analyze the correct translation between two input images. The Fourier-based technique is used to estimate the candidate translations to decrease searching space while best-first search algorithm is used to further search for the correct translation. The proposed technique can estimate large translations, scalings, and rotations in images by an extension of well-known phase correlation technique. The experimental results using various image details show the accuracy of the proposed technique to detect large translations compared to the other techniques in frequency domain.
引用
收藏
页码:364 / 367
页数:4
相关论文
共 50 条
  • [31] Efficient best-first dictionary search given graph-based input
    Lucas, S
    15TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 4, PROCEEDINGS: APPLICATIONS, ROBOTICS SYSTEMS AND ARCHITECTURES, 2000, : 434 - 437
  • [32] Flexible Protein-Protein Docking Based on Best-First Search Algorithm
    Noy, Efrat
    Goldblum, Amiram
    JOURNAL OF COMPUTATIONAL CHEMISTRY, 2010, 31 (09) : 1929 - 1943
  • [33] The Landmark-based Meta Best-First Search Algorithm for Classical Planning
    Vernhes, Simon
    Infantes, Guillaume
    Vidal, Vincent
    PROCEEDINGS OF THE SIXTH STARTING AI RESEARCHERS' SYMPOSIUM (STAIRS 2012), 2012, 241 : 336 - +
  • [34] FFT based image registration
    Averbuch, A
    Keller, Y
    2002 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-IV, PROCEEDINGS, 2002, : 3608 - 3611
  • [35] On Hash-Based Work Distribution Methods for Parallel Best-First Search
    Jinnai, Yuu
    Fukunaga, Alex
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2017, 60 : 491 - 548
  • [36] Performance Study of Reduced Search FFT-Based Acquisition
    Sagiraju, Phani K.
    Akopian, David
    Raju, G. V. S.
    PROCEEDINGS OF THE 2007 NATIONAL TECHNICAL MEETING OF THE INSTITUTE OF NAVIGATION - NTM 2007, 2007, : 153 - 160
  • [37] Program Synthesis with Best-First Bottom-Up Search
    Ameen S.
    Lelis L.H.S.
    1600, AI Access Foundation (77): : 1275 - 1310
  • [38] Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP
    Lou, Qi
    Dechter, Rina
    Ihler, Alexander
    THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 6392 - 6400
  • [39] On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search
    Clausen, J
    Perregaard, M
    ANNALS OF OPERATIONS RESEARCH, 1999, 90 (0) : 1 - 17
  • [40] Evaluation of a simple, scalable, parallel best-first search strategy
    Kishimoto, Akihiro
    Fukunaga, Alex
    Botea, Adi
    ARTIFICIAL INTELLIGENCE, 2013, 195 : 222 - 248