A bandwidth efficient subsampling-based block matching architecture for motion estimation
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Efficient hierarchical motion estimation algorithm and its VLSI architecture
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Text driven face-video synthesis using GMM and spatial correlation
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Pyramid based interpolation for face-video playback in audio visual recognition
ICB'07 Proceedings of the 2007 international conference on Advances in Biometrics
| Hi-index | 0.00 |
Motion compensation is an effective method for reducing temporal redundancy found in video sequence compression. However, the complexity of the full-search block matching algorithm (BMA) is extremely high and a number of fast algorithms have been proposed to reduce the computational complexity of the BMA. We propose three techniques for reducing the arithmetic complexity of the BMA. They are namely: (1) domain decimation, (2) error function subsampling, and (3) multiple candidates search. The domain decimation and error function decimation try to reduce the arithmetic complexity by reducing the number of operations in each comparison, the search range and number of locations searched. The multiple candidates search is a technique used to increase the robust of such algorithms. Combination of these techniques can generate algorithms with different tradeoff between arithmetic complexity and quality of prediction.