loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC '99)
"Bit Rate on Demand" Using Pruned Tree-Structured Hierarchical Lookup Vector Quantization
Snowbird, Utah
March 29-March 31
ISBN: 0-7695-0096-X
Kunal Mukherjee, University of Central Florida
Amar Mukherjee, University of Central Florida
Tinku Acharya, Intel Corporation
We propose a real-time image coding system, which is capable of adapting instanta-neously to the available channel bandwidth. The range of operational bandwidths for this system has a finer calibration than ordinary hierarchical vector quantization (HVQ) or wavelet based hierarchical vector quantization (WHVQ) methods suggested in the litera-ture.These properties make it very attractive for networks with fluctuating available band-width, like the internet. All encoder and decoder operations are strictly constant time per pixel, proceeding through table lookups, and are intrinsically suitable for parallel and hardware implementation.
Citation:
Kunal Mukherjee, Amar Mukherjee, Tinku Acharya, ""Bit Rate on Demand" Using Pruned Tree-Structured Hierarchical Lookup Vector Quantization," dcc, pp.42, Data Compression Conference (DCC '99), 1999
Usage of this product signifies your acceptance of the Terms of Use.