Skip to main content
Article thumbnail
Location of Repository

182 Parallel Implementation of the Full Search Block Matching Algorithm for Motion Estimation*

By P. Baglietto, M. Maresca, A. Migliaro and M. Migliardi

Abstract

Motion estimation is a key technique in most algorithms for video compression and particularly in the MPEG and H.261 standards. The most frequently used technique is based on a Full Search Block Matching Algorithm which is highly computing intensive and requires the use of special purpose architectures to obtain real-time performance. In this paper we propose an approach to the parallel implementation of the Full Search Block Matching Algorithm which is suitable for implementation on massively parallel architectures ranging from large scale SIMD computers to dedicated processor arrays realized in ASICs. While the first altemative can be used for the implementation of high performance coders the second alternative is particularly attractive for low cost video compression devices. This paper describes the approach proposed for the parallel implementation of the Full Search Block Matching Algorithm and the implementation of such an approach in an ASIC

Topics: Video Coding, Motion Estimation, Processor Array
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.1464
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://ieeexplore.ieee.org/iel... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.