Abstract
A new hierarchical block matching algorithm with a novel arrangement of data flow is proposed. Its speed can be as fast as that of the conventional hierarchical block matching algorithms and its prediction quality is very close to the full search algorithm. In order to implement this algorithm, a multiprocessor array architecture for real-time processing is proposed. Due to the novel arrangement of data flow, the limitations of conventional ones will no longer exist. Moreover, the hardware complexity, size of local memory, input bandwidth, and speed performance of the proposed architecture are also analyzed. Finally, the simulation results are given to demonstrate the effectiveness of this new algorithm.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
