A comparison of block-matching search algorithms in motion estimation

  • Authors:

  • Saket Jamkar;Swapnil Belhe;Sankalp Dravid;M. S. Sutaone

  • Affiliations:

  • Government College of Engineering, Pune, Shivajinagar, Pune 411 005, India;Government College of Engineering, Pune, Shivajinagar, Pune 411 005, India;Government College of Engineering, Pune, Shivajinagar, Pune 411 005, India;Government College of Engineering, Pune, Shivajinagar, Pune 411 005, India

  • Venue:
  • ICCC '02 Proceedings of the 15th international conference on Computer communication
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper deals with a comparison of the search algorithms used for Motion Estimation in Video Compression. A comparison is made between four block search algorithms: Full Search, Three Step Search, Two Dimensional Logarithmic Search and Binary Search. The computational complexity of the search algorithms as represented by CPU time and the algorithm quality as represented by the Pixel Difference Classification and Average Minimum Absolute Distance are given.A comparison of the performance of search algorithms with block sizes of 8 × 8 and 16 × 16 is also given with sample images to show the perceptual difference. All the algorithms were tested on test video-streams called "news.qcif" and "container.qcif" and the algorithms were implemented on TurboC and executed on a Pentium 3 machine.