Fast, Robust Block Motion Estimation Using Simulated Annealing

  • SHIE Mon-chau
    Department of Electrical Engineering, National Taiwan University
  • FANG Wen-hsien
    Department of Electronic Engineering, National Taiwan University of Science and Technology
  • HUNG Kuo-jui
    Department of Electronic Engineering, National Taiwan University of Science and Technology
  • LAI Feipei
    Department of Electrical Engineering, National Taiwan University

この論文をさがす

抄録

This paper presents a simulated annealing (SA)-based algorithm for fast and robust block motion estimation.To reduce computational complexity, the existing fast search algorithms move iteratively toward the winning point based only on a finite set of checking points in every stage.Despite the efficiency of these algorithms, the search process is easily trapped into local minima, especially for high activity image sequences.To overcome this difficulty, the new algorithm uses two sets of checking points in every search stage and invokes the SA to choose the appropriate one.The employment of the SA provides the search a mechanism of being able to move out of local minima so that the new algorithm is less susceptible to such a dilemma.In addition, two schemes are employed to further enhance the performance of the algorithm.First, a set of initial checking points which exploit high correlations among the motion vectors of the temporally and spatially adjacent blocks are used.Second, an alternating search strategy is addressed to visit more points without increasing computations.Simulation results show that the new algorithm offers superior performance with lower computational complexity compared to previous works in various scenarios.

収録刊行物

被引用文献 (5)*注記

もっと見る

参考文献 (10)*注記

もっと見る

詳細情報 詳細情報について

  • CRID
    1573668927147701120
  • NII論文ID
    110003208401
  • NII書誌ID
    AA10826239
  • ISSN
    09168508
  • 本文言語コード
    en
  • データソース種別
    • CiNii Articles

問題の指摘

ページトップへ