Multiple description decoding of overcomplete expansions using projections onto convex sets

Chou, Phil; Mehrotra, Sanjeev; Wang, A.

doi:10.1109/dcc.1999.755656

Cited by 44 publications

(36 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second term describes the sum of pairwise squared distances (SPSD) between elements of the -tuples. In Section IV (Proposition 4.1), we show that, under a high-resolution assumption, the second term in (23) is dominant, from which we conclude that in order to minimize (21) we have to choose the -tuples with the lowest SPSD. These -tuples are then assigned to central lattice points in such a way, that the first term in (23) is minimized.…”

Section: Theorem 31: For We Havementioning

confidence: 99%

n-channel entropy-constrained multiple-description lattice vector quantization

Østergaard

Jensen

Heusdens

2006

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-In this paper, we derive analytical expressions for the central and side quantizers which, under high-resolution assumptions, minimize the expected distortion of a symmetric multiple-description lattice vector quantization (MD-LVQ) system subject to entropy constraints on the side descriptions for given packet-loss probabilities. We consider a special case of the general -channel symmetric multiple-description problem where only a single parameter controls the redundancy tradeoffs between the central and the side distortions. Previous work on two-channel MD-LVQ showed that the distortions of the side quantizers can be expressed through the normalized second moment of a sphere. We show here that this is also the case for three-channel MD-LVQ. Furthermore, we conjecture that this is true for the general -channel MD-LVQ. For given source, target rate, and packet-loss probabilities we find the optimal number of descriptions and construct the MD-LVQ system that minimizes the expected distortion. We verify theoretical expressions by numerical simulations and show in a practical setup that significant performance improvements can be achieved over state-of-the-art two-channel MD-LVQ by using three-channel MD-LVQ.Index Terms-High-rate quantization, lattice quantization, multiple-description coding (MDC), vector quantization.

show abstract

Section: Theorem 31: For We Havementioning

confidence: 99%

n-channel entropy-constrained multiple-description lattice vector quantization

Østergaard

Jensen

Heusdens

2006

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…Reed-Solomon code is commonly used in practice for FEC packet-level recovery systems with delay constraints [29]- [31]. Fig.…”

Section: Fec For One Burst-loss Channelmentioning

confidence: 99%

Smart Media Striping Over Multiple Burst-Loss Channels

Cheung

Sharma²,

Lee

2007

IEEE J. Sel. Top. Signal Process.

View full text Add to dashboard Cite

Abstract-We consider a community of multi-homed wireless devices, where each device has both a wireless wide area network (WWAN) interface to connect to the Internet and a wireless local area network (WLAN) interface to connect to its neighbors. Suppose users in the community are interested in receiving the same piece of delay-sensitive media content, and are willing to share their network resources. It is obvious that the community can benefit from the bundling of WWAN links and achieve higher aggregate bandwidth that is not possible with a single user with a single WWAN connection. What is not obvious is that by inverse multiplexing or striping packets across multiple WWAN channels, one can also improve the goodput of delay-sensitive media traffic by striping FEC and ARQ packets across available channels. In this paper, we analyze the potential benefits of striping media traffic and develop algorithms that take advantage of these benefits to optimize the delivery of delay-sensitive media streams to a wireless multi-homed device community. Results show dramatic improvement over naïve striping schemes such as weighted round robin both in terms of packet loss ratio, and in terms of peak signal-tonoise ratio for H.264 video streaming.

show abstract

“…The basic idea is to decorrelate the vector components and then to introduce again correlation between coefficients, but in a known and controlled manner, so that erased coefficients can be statistically estimated from those received. Techniques based on overcomplete frame expansions have been proposed in [6], [15], [21].…”

Section: Code Constructionsmentioning

confidence: 99%

“…That means that either the KLT or the filters in the filter bank have finite length . The FIR filters are designed using the numerical optimization presented in Section III-C. 6 The MDTC is the same shown previously except that the KLT operates on blocks of finite length . Bits are still allocated according to a single description allocation strategy and the MDSQs are designed such that the index assignment strategy is the same for each of the components.…”

Section: Low-rate Finite Delay/complexity Performancementioning

confidence: 99%

Optimal filter banks for multiple description coding: analysis and synthesis

Dragotti

Servetto

Vetterli

2002

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Abstract-Multiple description (MD) coding is a source coding technique for information transmission over unreliable networks. In MD coding, the coder generates several different descriptions of the same signal and the decoder can produce a useful reconstruction of the source with any received subset of these descriptions. In this paper, we study the problem of MD coding of stationary Gaussian sources with memory. First, we compute an approximate MD rate distortion region for these sources, which we prove to be asymptotically tight at high rates. This region generalizes the MD rate distortion region of El Gamal, Cover, and Ozarow for memoryless Gaussian sources. Then, we develop an algorithm for the design of optimal two-channel biorthogonal filter banks for MD coding of Gaussian sources. We show that optimal filters are obtained by allocating the redundancy over frequency with a reverse "water-filling" strategy. Finally, we present experimental results which show the effectiveness of our filter banks in the low complexity, low rate regime.Index Terms-Filter bank design, integer-to-integer transforms, multiple description (MD) coding, rate distortion functions, robust source coding.

show abstract

Multiple description decoding of overcomplete expansions using projections onto convex sets

Cited by 44 publications

References 9 publications

n-channel entropy-constrained multiple-description lattice vector quantization

n-channel entropy-constrained multiple-description lattice vector quantization

Smart Media Striping Over Multiple Burst-Loss Channels

Optimal filter banks for multiple description coding: analysis and synthesis

Contact Info

Product

Resources

About