Parallelisation of block matching motion estimation algorithms
Steliaros, M.K., Martin, G.R. and Packwood, R.A. (1997) Parallelisation of block matching motion estimation algorithms. Technical Report. Department of Computer Science, Coventry, UK.
- Published Version
Block matching motion estimation accounts for a high computational overhead in most low bit-rate video coders intended for video-conferencing and multimedia applications. Conventional fixed size block matching (FSBM) and more sophisticated variable size block matching (VSBM) algorithms are profiled to determine how parallelism can be applied to increase efficiency. Three parallel implementations are considered: a homogeneous workstation network using PVM; a Parsytec Super-Cluster, 128-node T800 transputer-based MIMD machine; and a shared memory multiprocessor, using a 'threads' programming model. It is shown that significant improvements in computational performance can be made, even on commonly available computing platforms. Using an MPEG-4 image test sequence, detailed evaluation of a POSIX-conformant threads implementation resulted in near-theoretical maximum speedups being obtained.
|Item Type:||Monograph (Technical Report)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Mr Ebrahim Ardeshir|
|Date Deposited:||04 Jan 2012 09:19|
|Last Modified:||01 Nov 2012 18:06|
Actions (login required)