Academic Journals Database
Disseminating quality controlled scientific knowledge

Complexity Reduction of Fast Block Matching Algorithm

ADD TO MY LIST
 
Author(s): P.Muralidhar | A.Vishnupriya | C.B. Rama Rao

Journal: International Journal of Engineering and Advanced Technology
ISSN 2249-8958

Volume: 1;
Issue: 6;
Start page: 277;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Block Matching Motion Estimation Algorithm | Global Elimination | Matching complexity reduction | Feature based partitioning.

ABSTRACT
This paper presents a new block matching motion estimation algorithm using the macro block features to reduce the computational complexity of motion estimation in video encode applications. Motion estimation block is the computationally intensive block in video encoders. To reduce computational cost various motion estimation algorithms have been proposed. Global Elimination is an algorithm based on pixel averaging to reduce the complexity of motion search while keeping performance close to that of full search. Here adaptive version of Global elimination is proposed that uses macro block features like variance and Hadamard transform to further reduce the computational complexity of motion estimation. Performance achieved is close to the full search method and global elimination. Operational complexity is reduced compared to global elimination method.
Why do you need a reservation system?      Save time & money - Smart Internet Solutions