원문정보
보안공학연구지원센터(IJSIP)
International Journal of Signal Processing, Image Processing and Pattern Recognition
Vol.6 No.3
2013.06
pp.129-138
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Block matching for motion estimation has been widely used in video compression for effi-cient transmission and storage of video bit stream by reducing the temporal redundancy ex-isting in a video sequence. The motion estimation is a process to predict the motion between two successive frames. This paper is primarily a review of the block matching algorithms using fast computational and winner-update strategies. The paper describes and analyses different types of block matching algorithms, namely Full Search (FS), Fast Computational of Full Search (FCFS), Three Step Search (TSS), New Three Step Search (NTSS), Three Step Search with Winner Update Strategy (WinUpTSS), Four Step Search (FSS) and Diamond Search (DS) algorithms.
목차
Abstract
1. Introduction
2. Block Matching Algorithms
2.1. Full Search (FS)-
2.2. Fast Computational Full Search (FCFS)
2.3. Three Step Search (TSS)
2.4. New Three Search Step Search (NTSS)
2.5. Winner-Update Three Step Search (WinUpTSS)
2.6. Four Step Search (FSS)
2.6. Diamond Search (DS)
2. Simulation Results
3. Conclusion
Acknowledgements
References
1. Introduction
2. Block Matching Algorithms
2.1. Full Search (FS)-
2.2. Fast Computational Full Search (FCFS)
2.3. Three Step Search (TSS)
2.4. New Three Search Step Search (NTSS)
2.5. Winner-Update Three Step Search (WinUpTSS)
2.6. Four Step Search (FSS)
2.6. Diamond Search (DS)
2. Simulation Results
3. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보