DocumentCode
3284608
Title
A simple and efficient way to prune motion vector trees in MC-EZBC
Author
Zeng, Jianfen ; Fan, Liang
Author_Institution
Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou, China
fYear
2004
fDate
29 Sept.-1 Oct. 2004
Firstpage
399
Lastpage
402
Abstract
MC-EZBC is one kind of subband wavelet coders exploiting temporal correlation and fully embedded in quality/bit-rate, spatial, and frame rate. By combining MCTF and EZBC and other non-trivial techniques as well, the latest MC-EZBC achieves the best rate-distortion performance in literature. However, the way to find the λmv.opt, used for optimally pruning the motion vector trees still allows room for improvement, since it is not adaptive to the motion vector trees and it costs high off-line computation as well. We propose a novel method to find an adaptive λmv.opt for each motion vector tree. Simulation results show that the new way is fast and efficient, and that it brings a gain about 0.05-0.2 dB for widely used testing video clips.
Keywords
correlation methods; distortion; filtering theory; trees (mathematics); video coding; wavelet transforms; MC-EZBC; motion vector trees pruning; motion-compensated temporal filtering; non-trivial technique; rate-distortion performance; subband wavelet coder; temporal correlation; video clips testing; Computational efficiency; Computational modeling; Cost function; Lagrangian functions; Quantization; Rate-distortion; Scalability; Sun; Testing; Video compression;
fLanguage
English
Publisher
ieee
Conference_Titel
Multimedia Signal Processing, 2004 IEEE 6th Workshop on
Print_ISBN
0-7803-8578-0
Type
conf
DOI
10.1109/MMSP.2004.1436577
Filename
1436577
Link To Document