loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 IEEE International Conference on Multimedia and Expo (ICME'01)
Flexible Fast Block Matchig Algorithm Design based on Complexity-Distortion Optimization
Tokyo, Japan
August 22-August 25
ISBN: 0-7695-1198-8
Pol Lin Tai, National Tsing Hua University, Taiwan, R.O.C
Chii Tung Liu, National Tsing Hua University, Taiwan, R.O.C
Shih Yu Huang, Ming Chuan University, Twainwan, R.O.C
Jia Shung Wang, National Tsing Hua University, Taiwan, R.O.C
In this paper, we propose a novel fast block matching algorithm design strategy based on the complexity-distortion optimization. The goal of our design is to achieve the maximum image quality under a target computational complexity and to provide a flexible fast block matching algorithm that allows user to terminate algorithm at any target computational complexity. Based on the proposed predictive complexity-distortion benefit list technique, which is employed to predict the motion compensation benefit, we modify the full-search block matching, three-step search, new three-step search, and four-step search to the flexible algorithm. Experimental results show that the flexible algorithms could achieve better performance than traditional fixed complexity algorithms from the viewpoint of complexity-distortion optimization.
Citation:
Pol Lin Tai, Chii Tung Liu, Shih Yu Huang, Jia Shung Wang, "Flexible Fast Block Matchig Algorithm Design based on Complexity-Distortion Optimization," icme, pp.176, 2001 IEEE International Conference on Multimedia and Expo (ICME'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.