Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Signal Processing Im...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Signal Processing Image Communication
Article . 2007 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2020
Data sources: DBLP
versions View all 2 versions
addClaim

Structure unanimity multiple description coding

Authors: Canhui Cai; Jing Chen 0001; Sanjit K. Mitra;

Structure unanimity multiple description coding

Abstract

A novel multiple description coding framework, called structure unanimity multiple description coding, is proposed in this paper. Each wavelet coefficient is first decomposed into an odd position coefficient made from the bits in the odd positions and an even position coefficient made from the bits in the even positions. These two types of coefficients form the odd image and the even image, respectively, which are next encoded, and then transmitted using two different channels. Since the two images share the same hierarchical tree structure, only coefficient values in the redundancy parts need to be coded, resulting in improved coding efficiency. To meet the requirements of the packet switching network, these two images are rearranged in tree blocks, and the tree blocks in the even image and odd image are grouped to form the row and column packets, respectively. These packets are next separately dispatched through diverse channels. Since the row and the column packets have limited intersections, even with simultaneous loss of row and column packets, the proposed system exhibits good error resilient ability. Experimental results have verified the improved performance of the proposed algorithm.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    2
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
2
Average
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!