Sciweavers

84
Voted
DCC
2001
IEEE
16 years 2 months ago
Multihypothesis Motion Estimation for Video Coding
Markus Flierl, Bernd Girod
DCC
2001
IEEE
16 years 2 months ago
A Posteriori Quantized Matching Pursuit
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
Pascal Frossard, Pierre Vandergheynst
116
Voted
DCC
2001
IEEE
16 years 2 months ago
Compression of the Layered Depth Image
A layered depth image (LDI) is a new popular representation and rendering method for objects with complex geometries. Similar to a 2D image, the LDI consists of an array of pixels...
Jiangang Duan, Jin Li
71
Voted
DCC
2001
IEEE
16 years 2 months ago
Streaming Thin Client Compression
Bernd O. Christiansen, Klaus E. Schauser, Malte M&...
DCC
2001
IEEE
16 years 2 months ago
Quantized Oversampled Filter Banks with Erasures
Pier Luigi Dragotti, Jelena Kovacevic, Vivek K. Go...
116
Voted
DCC
2001
IEEE
16 years 2 months ago
Video Coding for Streaming Media Delivery on the Internet
We provide an overview of an architecture of today's Internet streaming media delivery networks and describe various problems that such systems pose with regard to video codin...
Gregory J. Conklin, Gary S. Greenbaum, Karl Olav L...
139
Voted
DCC
2001
IEEE
16 years 2 months ago
LIPT: A Reversible Lossless Text Transform to Improve Compression Performance
Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (D...
Fauzia S. Awan, Nan Zhang 0005, Nitin Motgi, Raja ...
107
Voted
DCC
2001
IEEE
16 years 2 months ago
The Coding-Optimal Transform
We propose a new transform coding algorithm that integrates all optimization steps into a coherent and consistent framework. Each iteration of the algorithm is designed to minimiz...
Cynthia Archer, Todd K. Leen
132
Voted
DCC
2001
IEEE
16 years 2 months ago
Towards Compressing Web Graphs
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
Micah Adler, Michael Mitzenmacher