Abstract
Presents a comparison of motion compensation (MC) schemes using winner-take-all (WTA) networks for the embedded zero-tree wavelet (EZW) algorithm. The proposed MC schemes maintain the advantages of the EZW algorithm in terms of coding efficiency and scalable coding. The approaches are based on using the ancestor-descendant tree hierarchies from the EZW algorithm to form the candidate matrices for the WTA network. The various WTA MC schemes differ from one another in the way the candidate matrices are used to update a codebook. The various WTA MC schemes are compared, and simulation results using standard video sequences are presented.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call