Generalized multiple description coding with correlating transforms
Vivek K Goyal,Jelena Kovacevic +1 more
TL;DR: Numerical studies show that this method performs well at low redundancies, as compared to uniform MD scalar quantization, and several transform optimization results are presented for memoryless Gaussian sources.
read more
Abstract: Multiple description (MD) coding is source coding in which several descriptions of the source are produced such that various reconstruction qualities are obtained from different subsets of the descriptions. Unlike multiresolution or layered source coding, there is no hierarchy of descriptions; thus, MD coding is suitable for packet erasure channels or networks without priority provisions. Generalizing work by Orchard, Wang, Vaishampayan and Reibman (see Proc IEEE Int. Conf. Image Processing, vol.I, Santa Barbara, CA, p.608-11, 1997), a transform-based approach is developed for producing M descriptions of an N-tuple source, M/spl les/N. The descriptions are sets of transform coefficients, and the transform coefficients of different descriptions are correlated so that missing coefficients can be estimated. Several transform optimization results are presented for memoryless Gaussian sources, including a complete solution of the N=2, M=2 case with arbitrary weighting of the descriptions. The technique is effective only when independent components of the source have differing variances. Numerical studies show that this method performs well at low redundancies, as compared to uniform MD scalar quantization.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multiple description coding: compression meets the network
TL;DR: By allowing image reconstruction to continue even after a packet is lost, this type of representation can prevent a Web browser from becoming dormant, and the source can be approximated from any subset of the chunks.
Grassmannian frames with applications to coding and communication
Thomas Strohmer,Robert W. Heath +1 more
TL;DR: The application of Grassmannian frames to wireless communication and to multiple description coding is discussed and their connection to unit norm tight frames for frames which are generated by group-like unitary systems is discussed.
1.1K
Designing structured tight frames via an alternating projection method
TL;DR: This paper proposes an alternating projection method that is versatile enough to solve a huge class of inverse eigenvalue problems (IEPs), which includes the frame design problem, and addresses the most basic design problem: constructing tight frames with prescribed vector norms.
Great expectations: the value of spatial diversity in wireless networks
Suhas Diggavi,Naofal Al-Dhahir,A. Stamoulis,A.R. Calderbank +3 more
- 08 Nov 2004
TL;DR: This paper adopts spatial diversity as a central theme, and illustrates its benefits across the physical (signal transmission/coding and receiver signal processing) and networking (resource allocation, routing, and applications) layers.
Multiple sender distributed video streaming
Thinh Nguyen,Avideh Zakhor +1 more
TL;DR: This work proposes a receiver-driven protocol for simultaneous video streaming from multiple senders to a single receiver in order to achieve higher throughput, and to increase tolerance to packet loss and delay due to network congestion.
References
•Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
- 01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Matrix analysis: Frontmatter
Roger A. Horn,Charles R. Johnson +1 more
- 01 Jan 1985
TL;DR: This book presents results of both classic and recent matrix analyses using canonical forms as a unifying theme, and demonstrates their importance in a variety of applications.
21.4K
•Book
Sphere packings, lattices, and groups
John H. Conway,Neil J. A. Sloane,Eiichi Bannai +2 more
- 01 Dec 1987
TL;DR: The second edition of this book continues to pursue the question: what is the most efficient way to pack a large number of equal spheres in n-dimensional Euclidean space?
4.7K
Quantization
Robert M. Gray,David L. Neuhoff +1 more
TL;DR: The key to a successful quantization is the selection of an error criterion – such as entropy and signal-to-noise ratio – and the development of optimal quantizers for this criterion.
2.1K
Internet Protocol, Version 6 (IPv6) Specification
S. Deering,R. Hinden +1 more
- 01 Dec 1995
TL;DR: In this paper, the authors specify version 6 of the Internet Protocol (IPv6), also referred to as IP Next Generation or IPng, and propose a new protocol called IPng.