Survey on Block Matching Motion Estimation Algorithms and Architectures with New Results
Journal of VLSI Signal Processing Systems
An approach to increase the performance of motion estimation algorithms implemented in hardware
WebMedia '06 Proceedings of the 12th Brazilian Symposium on Multimedia and the web
Motion identification from image sequences: Information theory and pixel selection
Computers & Mathematics with Applications
Efficient hierarchical motion estimation algorithm and its VLSI architecture
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A configurable motion estimation architecture for block-matching algorithms
IEEE Transactions on Circuits and Systems for Video Technology
A low-power and bandwidth-efficient motion estimation IP core design using binary search
IEEE Transactions on Circuits and Systems for Video Technology
Fast global motion estimation via iterative least-square method
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
A Low Cost Architecture for Variable Block Size Motion Estimation
Journal of Signal Processing Systems
| Hi-index | 0.00 |
This paper presents a new block matching motion estimation algorithm and its VLSI architecture design. The proposed global elimination algorithm (GEA) was derived from successive elimination algorithm (SEA), which can skip unnecessary sum of absolute difference (SAD) calculation by comparing minimum SAD with subsampled SAD (SSAD). Our basic idea is to separate the decision of early termination and SAD calculation for each candidate block to make data flow more regular and suitable for hardware. In short, we first compare the rough characteristics of all candidate blocks with the current block (SSAD). In turn, we select several best roughly matched candidate blocks to re-compare them with the current block by using detailed characteristics (SAD). Other features of GEA include fixed processing cycles, no initial guess, and high video quality (almost the same as full search). Unlike other fast algorithms, the mapping of GEA to hardware is very simple. We proposed an architecture that is composed of a systolic part to efficiently compute SSAD, an adder tree to support both SSAD and SAD calculations, and a comparator tree to avoid expensive sorting circuits. Simulation results show that our design is much more area efficient than many full-search architectures while maintaining high video quality and processing capability.