#### DMCA

## Distributed video coding (2005)

### Cached

### Download Links

Venue: | PROC. OF THE IEEE 93 (2005) 71–83 |

Citations: | 310 - 11 self |

### Citations

1341 | Least squares quantization in pcm
- Lloyd
- 1982
(Show Context)
Citation Context ..., which, however, may consist of noncontiguous subcells mapped into the same quantizer index . This setting was considered, e.g., by Fleming, Zhao and Effros [48], who generalized the Lloyd algorithm =-=[49]-=- for locally optimal fixed-rate Wyner–Ziv vector quantization design. Later, Fleming and Effros [50] included rate-distortion optimized vector quantizers in which the rate measure is a function of the... |

1247 |
Noiseless coding of correlated information sources
- Slepian, Wolf
- 2004
(Show Context)
Citation Context ...E PROCEEDINGS OF THE IEEE, VOL. 93, NO. 1, JANUARY 2005 71Fig. 2. Slepian–Wolf theorem, 1973: achievable rate region for distributed compression of two statistically dependent i.i.d. sources X and Y =-=[1]-=-. Fig. 3. Compression of a sequence of random symbols X using statistically related side information Y . We are interested in the distributed case, where Y is only available at the decoder, but not at... |

1044 | The rate-distortion function for source coding with side information at the decoder II
- Wyner
- 1978
(Show Context)
Citation Context ...compression performance approaches the Slepian–Wolf bound. C. Rate-Distortion Theory for Lossy Compression With Receiver Side Information Shortly after Slepian and Wolf’s seminal paper, Wyner and Ziv =-=[31]-=-–[33] extended this work to establish informationtheoretic bounds for lossy compression with side information at the decoder. More precisely, let and represent samples of two i.i.d. random sequences, ... |

1024 |
Writing on Dirty Paper
- Costa
- 1983
(Show Context)
Citation Context ... in the case of Gaussian memoryless sources and mean-squared error distortion [31], [33]. This result is the dual of Costa’s “dirty paper” theorem for channel coding with sender-only side information =-=[34]-=-–[37]. As Gaussian-quadratic cases, both lend themselves to intuitive sphere-packing interpretations. also holds for source sequences that are the sum of arbitrarily distributed side information and i... |

938 | Overview of the H.264/AVC video coding standard
- Wiegand, Sullivan, et al.
- 2003
(Show Context)
Citation Context ...perimental findings in [54]. III. LOW-COMPLEXITY VIDEO ENCODING Implementations of current video compression standards, such as the ISO MPEG schemes or the ITU-T recommendations H.263 and H.264 [56], =-=[57]-=- require much more computation for the encoder than for the decoder; typically the encoder is 5–10 times more complex than the decoder. This asymmetry is well suited for broadcasting or for streaming ... |

403 | Distributed source coding using syndromes (DISCUS): Design and construction
- Pradhan, Ramchandran
- 1999
(Show Context)
Citation Context ...smitted bit streams are identical. Most distributed source coding techniques today are derived from proven channel coding ideas. The wave of recent work was ushered in 1999 by Pradhan and Ramchandran =-=[3]-=-. Initially, they addressed the asymmetric case of source coding with side information at the decoder for statistically dependent binary and Gaussian sources using scalar and trellis coset constructio... |

341 | Nested linear/lattice codes for structured multiterminal binning
- Zamir, Shamai, et al.
- 2002
(Show Context)
Citation Context ...have been undertaken only recently. The first attempts to design quantizers for reconstruction with side information were inspired by the information-theoretic proofs. Zamir and Shamai [39] (see also =-=[40]-=-) proved that under certain circumstances, linear codes and nested lattices may approach the Wyner–Ziv rate-distortion function, in particular if the source data and side information are jointly Gauss... |

310 | Priority Encoding Transmission
- Albanese, Bloemer, et al.
- 1996
(Show Context)
Citation Context ...tes. The conventional approach to achieve such graceful degradation employs layered video coding schemes [74]–[83] combined with unequal error protection, such as priority encoding transmission (PET) =-=[84]-=-, [85]. Unfortunately, all layered video coding schemes standardized to date incur a substantial rate-distortion loss relative to single-layer schemes and, hence, are not used in practical systems. By... |

218 | Distributed source coding for sensor networks
- Xiong, Liveris, et al.
- 2004
(Show Context)
Citation Context ...ted lattices. Xiong et al. [44], [45] implemented a Wyner–Ziv encoder as a nested lattice quantizer followed by a Slepian–Wolf coder, and in [46], a trellis-coded quantizer was used instead (see also =-=[47]-=-). In general, a Wyner–Ziv coder can be thought to consist of a quantizer followed by a Slepian–Wolf encoder, as illustrated in Fig. 5. The quantizer divides the signal space into cells, which, howeve... |

203 |
Distributed compression in a dense microsensor network
- Pradhan, Kusuma, et al.
- 2002
(Show Context)
Citation Context ...ed the asymmetric case of source coding with side information at the decoder for statistically dependent binary and Gaussian sources using scalar and trellis coset constructions. Their later work [4]–=-=[7]-=- considers the symmetric case where and are encoded with the same rate. Wang and Orchard [8] used an embedded trellis code structure for asymmetric coding of Gaussian sources and showed improvements o... |

181 |
Recent results in the Shannon theory
- Wyner
- 1974
(Show Context)
Citation Context ...few years that emerging applications have motivated serious attempts at practical techniques. However, it was understood already 30 years ago that Slepian–Wolf coding is a close kin to channel coding =-=[2]-=-. To appreciate this relationship, consider i.i.d. binary sequences and in Fig. 3. If and are similar, a hypothetical “error sequence” consists of zeros, except for some ones that mark the positions w... |

164 |
Compression with side information using turbo codes
- Aaron, Girod
- 2002
(Show Context)
Citation Context ...rs tend to be very simple, the computional load for the decoder, which exploits the source statistics, is much higher. García-Frías and Zhao [9], [10], Bajcsy and Mitran [11], [12], and our own group =-=[13]-=- independently proposed compression schemes where statistically dependent binary sources are compressed using turbo codes. It has been shown that the turbo code-based scheme can be applied to compress... |

160 |
PRISM: A New Robust Video Coding Architecture Based on Distributed Compression Principles
- Puri, Ramchandran
- 2002
(Show Context)
Citation Context ... applications may GIROD et al.: DISTRIBUTED VIDEO CODING 73Both our own group at Stanford University, Stanford, CA [58]–[62], as well as Ramchandran’s group at the University of California, Berkeley =-=[63]-=-–[65], have proposed practical schemes that are based on this novel video compression paradigm. We will review the coding algorithms and their performance in the following sections. Fig. 6. Transcodin... |

146 |
Compression of correlated binary sources using turbo codes
- Garcia-Frias, Zhao
- 2001
(Show Context)
Citation Context ... as Bayesian networks or Viterbi decoders. While the encoders tend to be very simple, the computional load for the decoder, which exploits the source statistics, is much higher. García-Frías and Zhao =-=[9]-=-, [10], Bajcsy and Mitran [11], [12], and our own group [13] independently proposed compression schemes where statistically dependent binary sources are compressed using turbo codes. It has been shown... |

143 | Unequal loss protection: graceful degradation of image quality over packet erasure channels through forward error correction - Mohr, Riskin, et al. - 2000 |

140 | Wyner-ziv coding of motion video - Aaron, Zhang, et al. - 2002 |

118 |
Systematic lossy source/channel coding
- Shamai, Verdu, et al.
- 1998
(Show Context)
Citation Context ...calability (FGS) coding and, more importantly, the LDPC code can be used to provide resilience to channel errors. Wyner–Ziv coding is also the key ingredient of systematic lossy source-channel coding =-=[73]-=-. In this configuration, a source signal is transmitted over an analog channel without channel coding. An encoded version of the source signal is sent over a digital channel as enhancement information... |

112 | On Source Coding with Side Information at the Decoder - Wyner - 1975 |

109 | On the performance of Hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes - Rowitch, Milstein - 2000 |

108 | Transform-domain Wyner-Ziv Codec for Video
- Aaron, Rane, et al.
- 2004
(Show Context)
Citation Context ... a block-wise DCT of each Wyner–Ziv frame is performed. The transform coefficients are independently quantized, grouped into coefficient bands, and then compressed by a Slepian–Wolf turbo coder [55], =-=[61]-=-. Similar to the pixel-domain scheme, the decoder utilizes previously reconstructed frames to generate a side information frame, with or without motion compensation. The correlation between a coeffici... |

106 | Robust internet video transmission based on scalable coding and unequal error protection - Horn, Stuhlmüller, et al. - 1999 |

101 |
Duality between source coding and channel coding and its extension to the side information case
- Pradhan, Chou, et al.
- 2003
(Show Context)
Citation Context ...he case of Gaussian memoryless sources and mean-squared error distortion [31], [33]. This result is the dual of Costa’s “dirty paper” theorem for channel coding with sender-only side information [34]–=-=[37]-=-. As Gaussian-quadratic cases, both lend themselves to intuitive sphere-packing interpretations. also holds for source sequences that are the sum of arbitrarily distributed side information and indepe... |

94 | The rate loss in the Wyner-Ziv problem
- Zamir
- 1996
(Show Context)
Citation Context ... holds for source sequences that are the sum of arbitrarily distributed side information and independent Gaussian noise [37]. For general statistics and a mean-squared error distortion measure, Zamir =-=[38]-=- proved that the rate loss is less than 0.5 b/sample. D. Practical Wyner–Ziv Coding As with Slepian–Wolf coding, efforts toward practical Wyner–Ziv coding schemes have been undertaken only recently. T... |

89 | The Distributed Karhunen-Loeve Transform
- Gastpar
- 2006
(Show Context)
Citation Context ...uantizers and entropy coders. Pradhan and Ramchandran considered the use of transforms in Wyner–Ziv coding of images and analyzed the bit allocation problem for the Gaussian case [67]. Gastpar et al. =-=[68]-=-, [69] investigated the Karhunen–Loève transform (KLT) for distributed source coding, but they assumed that the covariance matrix of the source vector given the side information does not depend on the... |

86 | On the duality between information embedding and source coding with side information and some applications - Barron, Chen, et al. - 2001 |

62 | Coding for the Slepian-Wolf problem with turbo codes
- Bajcsy, Mitran
- 2001
(Show Context)
Citation Context ...rbi decoders. While the encoders tend to be very simple, the computional load for the decoder, which exploits the source statistics, is much higher. García-Frías and Zhao [9], [10], Bajcsy and Mitran =-=[11]-=-, [12], and our own group [13] independently proposed compression schemes where statistically dependent binary sources are compressed using turbo codes. It has been shown that the turbo code-based sch... |

55 | Developments in model-based video coding - Pearson - 1995 |

53 |
Layered Wyner-Ziv video coding
- Xu, Xiong
(Show Context)
Citation Context ...te-free codec performs only 1–2.5 dB worse than a state-of-the-art standard video codec. Xu and Xiong used LDPC codes and nested Slepian–Wolf quantization to construct a layered Wyner–Ziv video codec =-=[72]-=-. This codec approaches the rate-distortion performance of a conventional codec with fine-granular scalability (FGS) coding and, more importantly, the LDPC code can be used to provide resilience to ch... |

53 |
Rate-distortion optimized layered coding with unequal error protection for robust internet video
- Gallant, Kossentini
- 2001
(Show Context)
Citation Context ...ortion from transmission errors to achieve graceful degradation with worsening channel error rates. The conventional approach to achieve such graceful degradation employs layered video coding schemes =-=[74]-=-–[83] combined with unequal error protection, such as priority encoding transmission (PET) [84], [85]. Unfortunately, all layered video coding schemes standardized to date incur a substantial rate-dis... |

51 | Wyner-Ziv video coding with hash-based motion compensation at the receiver
- Aaron, Rane, et al.
- 2004
(Show Context)
Citation Context ...nd systems where video is compressed once and decoded many times. However, some applications may GIROD et al.: DISTRIBUTED VIDEO CODING 73Both our own group at Stanford University, Stanford, CA [58]–=-=[62]-=-, as well as Ramchandran’s group at the University of California, Berkeley [63]–[65], have proposed practical schemes that are based on this novel video compression paradigm. We will review the coding... |

44 | Network vector quantization
- Fleming, Zhao, et al.
- 2004
(Show Context)
Citation Context ...ntizer divides the signal space into cells, which, however, may consist of noncontiguous subcells mapped into the same quantizer index . This setting was considered, e.g., by Fleming, Zhao and Effros =-=[48]-=-, who generalized the Lloyd algorithm [49] for locally optimal fixed-rate Wyner–Ziv vector quantization design. Later, Fleming and Effros [50] included rate-distortion optimized vector quantizers in w... |

43 | Towards practical Wyner-Ziv coding of video
- Aaron, Setton, et al.
(Show Context)
Citation Context ...ixel-Domain Encoding The simplest system that we have investigated is the combination of a pixel-domain intraframe encoder and interframe decoder system for video compression, as shown in Fig. 7 [58]–=-=[60]-=-. A subset of frames, regularly spaced in the sequence, serve as key frames which are encoded and decoded using a conventional intraframe 8 8 discrete cosine transform (DCT) codec. The frames between ... |

42 | Wyner-Ziv coding of video: Applications to compression and error resilience
- Aaron, Rane, et al.
(Show Context)
Citation Context ...ncoder complexity is not a requirement for broadcasting, but decoder complexity might be a concern. We presented first results of error-resilient video broadcasting with pixel-domain Wyner–Ziv coding =-=[59]-=-, [86], and then with an improved Wyner–Ziv video codec which used a hybrid video codec with Reed–Solomon (RS) codes [87]. For a practical Wyner–Ziv codec, consider the forward error protection scheme... |

39 | Nested linear/lattice codes for Wyner-Ziv encoding
- Zamir, Shamai
- 1998
(Show Context)
Citation Context ...coding schemes have been undertaken only recently. The first attempts to design quantizers for reconstruction with side information were inspired by the information-theoretic proofs. Zamir and Shamai =-=[39]-=- (see also [40]) proved that under certain circumstances, linear codes and nested lattices may approach the Wyner–Ziv rate-distortion function, in particular if the source data and side information ar... |

39 | Design of optimal quantizers for distributed source coding
- Rebollo-Monedero, Zhang, et al.
- 2003
(Show Context)
Citation Context ...]. Cardinal and Van Asche [53] considered Lloyd quantization for ideal Slepian–Wolf coding, without side information. An independent, more general extension of the Lloyd algorithm appears in our work =-=[54]-=-. A quantizer is designed assuming that an ideal Slepian–Wolf coder is used to encode the quantization index. The introduction of a rate measure that depends on both the quantization index and the sid... |

37 | Georghiades, “Design of Slepian-Wolf codes by channel code partitioning - Stankovic, Liveris, et al. |

36 | Distributed compression for sensor networks
- Kusuma, Doherty, et al.
(Show Context)
Citation Context ...ces may approach the Wyner–Ziv rate-distortion function, in particular if the source data and side information are jointly Gaussian. This idea was further developed and applied by Pradhan et al. [3], =-=[41]-=-, [42] and Servetto [43], who published heuristic designs and performance analysis focusing on the Gaussian case, based Fig. 5. Practical Wyner–Ziv coder is obtained by cascading a quantizer and a Sle... |

34 |
Compression of binary memoryless sources using punctured turbo codes
- Garcia-Frias, Zhao
- 2002
(Show Context)
Citation Context ...t the turbo code-based scheme can be applied to compression of statistically dependent nonbinary symbols [14], [15] and Gaussian sources [13], [16] as well as compression of single sources [10], [17]–=-=[19]-=-. Iterative channel codes can also be used for joint source-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–[21]. Liveris et al. [21]... |

33 |
LDPC codes can approach the Slepian Wolf bound for general binary sources
- Schonberg, Pradhan, et al.
- 2002
(Show Context)
Citation Context ...s can also be used for joint source-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–[21]. Liveris et al. [21]–[23], Schonberg et al. =-=[24]-=-–[26], and other authors [27]–[30] have suggested that low-density parity-check (LDPC) codes might be a powerful alternative to turbo codes for distributed coding. 72 PROCEEDINGS OF THE IEEE, VOL. 93,... |

32 | Lattice quantization with side information
- Servetto
- 2000
(Show Context)
Citation Context ...er–Ziv rate-distortion function, in particular if the source data and side information are jointly Gaussian. This idea was further developed and applied by Pradhan et al. [3], [41], [42] and Servetto =-=[43]-=-, who published heuristic designs and performance analysis focusing on the Gaussian case, based Fig. 5. Practical Wyner–Ziv coder is obtained by cascading a quantizer and a Slepian–Wolf encoder. on ne... |

30 | About priority encoding transmission
- Boucheron, Salamatian
- 2000
(Show Context)
Citation Context ...he conventional approach to achieve such graceful degradation employs layered video coding schemes [74]–[83] combined with unequal error protection, such as priority encoding transmission (PET) [84], =-=[85]-=-. Unfortunately, all layered video coding schemes standardized to date incur a substantial rate-distortion loss relative to single-layer schemes and, hence, are not used in practical systems. By not r... |

29 | On some new approaches to practical Slepian-Wolf compression inspired by channel coding
- Coleman, Lee, et al.
- 2004
(Show Context)
Citation Context ...source-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–[21]. Liveris et al. [21]–[23], Schonberg et al. [24]–[26], and other authors =-=[27]-=-–[30] have suggested that low-density parity-check (LDPC) codes might be a powerful alternative to turbo codes for distributed coding. 72 PROCEEDINGS OF THE IEEE, VOL. 93, NO. 1, JANUARY 2005Fig. 4. ... |

27 |
Design of trellis codes for source coding with side information at the decoder
- Wang, Orchard
- 2001
(Show Context)
Citation Context ...ly dependent binary and Gaussian sources using scalar and trellis coset constructions. Their later work [4]–[7] considers the symmetric case where and are encoded with the same rate. Wang and Orchard =-=[8]-=- used an embedded trellis code structure for asymmetric coding of Gaussian sources and showed improvements over the results in [3]. Since then, more sophisticated channel coding techniques have been a... |

27 | Enhancing analog image transmission systems using digital side information: a new wavelet based image coding paradigm - Pradhan, Ramchandran - 2001 |

26 | Turbo codes for nonuniform memoryless sources over noisy channels - Zhu, Alajaji - 2002 |

25 |
Wyner-Ziv coding based on
- Yang, Cheng, et al.
- 2003
(Show Context)
Citation Context ...by cascading a quantizer and a Slepian–Wolf encoder. on nested lattices. Xiong et al. [44], [45] implemented a Wyner–Ziv encoder as a nested lattice quantizer followed by a Slepian–Wolf coder, and in =-=[46]-=-, a trellis-coded quantizer was used instead (see also [47]). In general, a Wyner–Ziv coder can be thought to consist of a quantizer followed by a Slepian–Wolf encoder, as illustrated in Fig. 5. The q... |

25 | Systematic lossy forward error protection for error-resilient digital video broadcasting - A Wyner-Ziv coding approach
- Rane, Aaron, et al.
(Show Context)
Citation Context ... complexity is not a requirement for broadcasting, but decoder complexity might be a concern. We presented first results of error-resilient video broadcasting with pixel-domain Wyner–Ziv coding [59], =-=[86]-=-, and then with an improved Wyner–Ziv video codec which used a hybrid video codec with Reed–Solomon (RS) codes [87]. For a practical Wyner–Ziv codec, consider the forward error protection scheme shown... |

24 | Joint source-channel coding of binary sources with side information at the decoder using ira codes
- Liveris, Zixiang, et al.
- 2002
(Show Context)
Citation Context ...e sources [10], [17]–[19]. Iterative channel codes can also be used for joint source-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–=-=[21]-=-. Liveris et al. [21]–[23], Schonberg et al. [24]–[26], and other authors [27]–[30] have suggested that low-density parity-check (LDPC) codes might be a powerful alternative to turbo codes for distrib... |

23 | Joint source-channel decoding of correlated sources over noisy channels - Garcia-Frias - 2001 |

20 |
Coding for the Wyner-Ziv problem with turbo-like codes
- Mitran, Bajcsy
- 2002
(Show Context)
Citation Context ...s are compressed using turbo codes. It has been shown that the turbo code-based scheme can be applied to compression of statistically dependent nonbinary symbols [14], [15] and Gaussian sources [13], =-=[16]-=- as well as compression of single sources [10], [17]–[19]. Iterative channel codes can also be used for joint source-channel decoding by including both the statistics of the source and the channel in ... |

17 | Symmetric and asymmetric Slepian-Wolf codes with systematic and non-systematic linear codes
- Gehrig, Dragotti
- 2005
(Show Context)
Citation Context ...e-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–[21]. Liveris et al. [21]–[23], Schonberg et al. [24]–[26], and other authors [27]–=-=[30]-=- have suggested that low-density parity-check (LDPC) codes might be a powerful alternative to turbo codes for distributed coding. 72 PROCEEDINGS OF THE IEEE, VOL. 93, NO. 1, JANUARY 2005Fig. 4. Lossy... |

16 | Unequal Error Protection of MPEG-4 Compressed Video - Heinzelman, Budagavi, et al. - 1999 |

15 | SlepianWolf coding of multiple M-ary sources using LDPC codes - Lan, Liveris, et al. - 2004 |

15 |
Slepian-Wolf coded nested quantization (SWC-NQ) for Wyner-Ziv coding: performance analysis and code design
- Liu, Cheng, et al.
- 2004
(Show Context)
Citation Context ...and performance analysis focusing on the Gaussian case, based Fig. 5. Practical Wyner–Ziv coder is obtained by cascading a quantizer and a Slepian–Wolf encoder. on nested lattices. Xiong et al. [44], =-=[45]-=- implemented a Wyner–Ziv encoder as a nested lattice quantizer followed by a Slepian–Wolf coder, and in [46], a trellis-coded quantizer was used instead (see also [47]). In general, a Wyner–Ziv coder ... |

15 | The distributed, partial, and conditional Karhunen-Loeve transforms
- Gastpar, Dragotti, et al.
- 2003
(Show Context)
Citation Context ...ers and entropy coders. Pradhan and Ramchandran considered the use of transforms in Wyner–Ziv coding of images and analyzed the bit allocation problem for the Gaussian case [67]. Gastpar et al. [68], =-=[69]-=- investigated the Karhunen–Loève transform (KLT) for distributed source coding, but they assumed that the covariance matrix of the source vector given the side information does not depend on the value... |

14 |
Nested quantization and SlepianWolf coding: A Wyner-Ziv coding paradigm for i.i.d. sources
- Xiong, Liveris, et al.
- 2003
(Show Context)
Citation Context ...signs and performance analysis focusing on the Gaussian case, based Fig. 5. Practical Wyner–Ziv coder is obtained by cascading a quantizer and a Slepian–Wolf encoder. on nested lattices. Xiong et al. =-=[44]-=-, [45] implemented a Wyner–Ziv encoder as a nested lattice quantizer followed by a Slepian–Wolf coder, and in [46], a trellis-coded quantizer was used instead (see also [47]). In general, a Wyner–Ziv ... |

14 | Asche, Joint entropy-constrained multiterminal quantization, in
- Cardinal, V
- 2002
(Show Context)
Citation Context ...optimal quantizers among those with contiguous code cells was provided in [51]. Unfortunately, it has been shown that code cell contiguity precludes optimality in general [52]. Cardinal and Van Asche =-=[53]-=- considered Lloyd quantization for ideal Slepian–Wolf coding, without side information. An independent, more general extension of the Lloyd algorithm appears in our work [54]. A quantizer is designed ... |

13 |
Transforms for high-rate distributed source coding, in
- Rebollo-Monedero, Aaron, et al.
- 2003
(Show Context)
Citation Context ...the quantization index and the side information divorces the dimensionality of the quantizer from the block length of the Slepian–Wolf coder, a fundamental requirement for practical system design. In =-=[55]-=-, we showed that at high rates, under certain conditions, optimal quantizers are lattice quantizers, disconnected quantization cells need not be mapped into the same index, and there is asymptotically... |

10 | Illustration of the duality between channel coding and rate distortion with side information - Su, Eggers, et al. - 2000 |

9 | Quantization as histogram segmentation: Globally optimal scalar quantizer design in network systems
- Muresan, Effros
- 2002
(Show Context)
Citation Context ...the resulting quantizers either lack in performance or are prohibitively complex. An efficient algorithm for finding globally optimal quantizers among those with contiguous code cells was provided in =-=[51]-=-. Unfortunately, it has been shown that code cell contiguity precludes optimality in general [52]. Cardinal and Van Asche [53] considered Lloyd quantization for ideal Slepian–Wolf coding, without side... |

9 |
Robust predictive coding and the Wyner-Ziv problem
- Sehgal, Ahuja
- 2003
(Show Context)
Citation Context ...leasing visual artifacts are observed due to interframe error propagation. With PRISM, the decoded video quality is minimally affected and there is no drift between encoder and decoder. Sehgal et al. =-=[70]-=- have also proposed a Wyner–Ziv coding scheme based on turbo codes to combat interframe error propagation. In their scheme, Wyner–Ziv coding is applied to certain “peg frames,” while the remaining fra... |

9 | Channel Adaptive Unequal Error Protection for Scalable Video Transmission over wireless channel - Wang, Zhang, et al. - 2001 |

8 |
A causal state-free video encoding paradigm
- Sehgal, Jagmohan, et al.
- 2003
(Show Context)
Citation Context ...ining frames are encoded by a conventional predictive video encoder. This ensures that any decoding errors in the predictive video decoder can only propagate until the next peg frame. Jagmohan et al. =-=[71]-=- applied Wyner–Ziv coding to each frame to design a “state-free” video codec in which the encoder and decoder need not maintain precisely identical states while decoding the next frame. The state-free... |

7 |
rate-distortion function for source coding with side information at the decoder
- “The
- 1976
(Show Context)
Citation Context ...ession performance approaches the Slepian–Wolf bound. C. Rate-Distortion Theory for Lossy Compression With Receiver Side Information Shortly after Slepian and Wolf’s seminal paper, Wyner and Ziv [31]–=-=[33]-=- extended this work to establish informationtheoretic bounds for lossy compression with side information at the decoder. More precisely, let and represent samples of two i.i.d. random sequences, of po... |

6 |
Data compression of unknown single and correlated binary sources using punctured turbo codes
- García-Frías, Zhao
- 2001
(Show Context)
Citation Context ...ayesian networks or Viterbi decoders. While the encoders tend to be very simple, the computional load for the decoder, which exploits the source statistics, is much higher. García-Frías and Zhao [9], =-=[10]-=-, Bajcsy and Mitran [11], [12], and our own group [13] independently proposed compression schemes where statistically dependent binary sources are compressed using turbo codes. It has been shown that ... |

6 |
Joint estimation and data compression of correlated non-binary sources using punctured turbo codes
- Zhao, García-Frías
- 2002
(Show Context)
Citation Context ... statistically dependent binary sources are compressed using turbo codes. It has been shown that the turbo code-based scheme can be applied to compression of statistically dependent nonbinary symbols =-=[14]-=-, [15] and Gaussian sources [13], [16] as well as compression of single sources [10], [17]–[19]. Iterative channel codes can also be used for joint source-channel decoding by including both the statis... |

6 |
Codecell contiguity in optimal fixed-rate and entropy-constrained network scalar quantizers
- Effros, Muresan
- 2002
(Show Context)
Citation Context ...gorithm for finding globally optimal quantizers among those with contiguous code cells was provided in [51]. Unfortunately, it has been shown that code cell contiguity precludes optimality in general =-=[52]-=-. Cardinal and Van Asche [53] considered Lloyd quantization for ideal Slepian–Wolf coding, without side information. An independent, more general extension of the Lloyd algorithm appears in our work [... |

5 |
of binary sources with side information at the decoder using LDPC codes
- “Compression
- 2002
(Show Context)
Citation Context ... Iterative channel codes can also be used for joint source-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–[21]. Liveris et al. [21]–=-=[23]-=-, Schonberg et al. [24]–[26], and other authors [27]–[30] have suggested that low-density parity-check (LDPC) codes might be a powerful alternative to turbo codes for distributed coding. 72 PROCEEDING... |

5 | Optimal FEC assignment for scalable video transmission over burst error channel with loss rate feedback - Su, Yang, et al. - 2003 |

4 |
Wyner–Ziv coding of motion video,” presented at
- Aaron, Zhang, et al.
- 2002
(Show Context)
Citation Context ...-demand systems where video is compressed once and decoded many times. However, some applications may GIROD et al.: DISTRIBUTED VIDEO CODING 73Both our own group at Stanford University, Stanford, CA =-=[58]-=-–[62], as well as Ramchandran’s group at the University of California, Berkeley [63]–[65], have proposed practical schemes that are based on this novel video compression paradigm. We will review the c... |

4 | Layered Wyner-Ziv video coding,” Submitted to - Xu, Xiong - 2004 |

3 |
Near Shannon-limit coding for the Slepian-Wolf problem
- Mitran, Bajcsy
- 2002
(Show Context)
Citation Context ...coders. While the encoders tend to be very simple, the computional load for the decoder, which exploits the source statistics, is much higher. García-Frías and Zhao [9], [10], Bajcsy and Mitran [11], =-=[12]-=-, and our own group [13] independently proposed compression schemes where statistically dependent binary sources are compressed using turbo codes. It has been shown that the turbo code-based scheme ca... |

3 | A ‘reversed’ multimedia coding paradigm - “PRISM - 2003 |

3 |
Performance Analysis of Priority encoding transmission of MPEG video streams
- Andronico, Lombardo, et al.
- 1996
(Show Context)
Citation Context ...n from transmission errors to achieve graceful degradation with worsening channel error rates. The conventional approach to achieve such graceful degradation employs layered video coding schemes [74]–=-=[83]-=- combined with unequal error protection, such as priority encoding transmission (PET) [84], [85]. Unfortunately, all layered video coding schemes standardized to date incur a substantial rate-distorti... |

2 | Variability of performance in video coding - Pearson - 1997 |

2 |
source coding: Symmetric rates and applications to sensor networks
- “Distributed
- 2000
(Show Context)
Citation Context ...ressed the asymmetric case of source coding with side information at the decoder for statistically dependent binary and Gaussian sources using scalar and trellis coset constructions. Their later work =-=[4]-=-–[7] considers the symmetric case where and are encoded with the same rate. Wang and Orchard [8] used an embedded trellis code structure for asymmetric coding of Gaussian sources and showed improvemen... |

2 |
source coding: A noise-robust approach to data compression
- “Turbo
- 2002
(Show Context)
Citation Context ...n that the turbo code-based scheme can be applied to compression of statistically dependent nonbinary symbols [14], [15] and Gaussian sources [13], [16] as well as compression of single sources [10], =-=[17]-=-–[19]. Iterative channel codes can also be used for joint source-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–[21]. Liveris et al.... |

2 | Error control for video multicast using heirarchical FEC - Tan, Zakhor - 1999 |

2 | Error Resilient Packet Video with Unequal Error - Wang, Srinath - 2001 |

2 | Spectrally Efficient Partitioning of MPEG Video Streams for Robust Transmission Over Multiple Channels - Xu, Hemami - 2002 |

1 |
code constructions for the entire Slepian-Wolf rate region for arbitrarily correlated sources
- “Distributed
- 2004
(Show Context)
Citation Context ... also be used for joint source-channel decoding by including both the statistics of the source and the channel in the decoding process [13], [17]–[21]. Liveris et al. [21]–[23], Schonberg et al. [24]–=-=[26]-=-, and other authors [27]–[30] have suggested that low-density parity-check (LDPC) codes might be a powerful alternative to turbo codes for distributed coding. 72 PROCEEDINGS OF THE IEEE, VOL. 93, NO. ... |

1 |
A ‘reversed’ multimedia coding paradigm,” presented at the
- “PRISM
- 2003
(Show Context)
Citation Context ...ications may GIROD et al.: DISTRIBUTED VIDEO CODING 73Both our own group at Stanford University, Stanford, CA [58]–[62], as well as Ramchandran’s group at the University of California, Berkeley [63]–=-=[65]-=-, have proposed practical schemes that are based on this novel video compression paradigm. We will review the coding algorithms and their performance in the following sections. Fig. 6. Transcoding arc... |

1 | compression of correlated non-binary sources using punctured turbo codes - “Data - 2002 |