By Topic

A simple and efficient way to prune motion vector trees in MC-EZBC

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jianfen Zeng ; Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou, China ; Liang Fan

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.

Published in:

Multimedia Signal Processing, 2004 IEEE 6th Workshop on

Date of Conference:

29 Sept.-1 Oct. 2004