DMCA
Error Control and Concealment for Video Communication -- A Review (1998)
Cached
Download Links
- [vision.poly.edu:8080]
- [inst.eecs.berkeley.edu]
- [engineering.purdue.edu]
- CiteULike
Other Repositories/Bibliography
Venue: | PROCEEDINGS OF THE IEEE |
Citations: | 438 - 13 self |
Citations
639 |
A mathematical Theory of Communication”, Bell Syst
- Shannon
- 1948
(Show Context)
Citation Context ...arately design the source and channel coder to achieve the optimal performance of the overall system. This result was first shown by Shannon for source and channels that are memoryless and stationary =-=[16]-=- and was later extended to a more general class of sources and channels [17]. However, this theorem assumes that the complexity and processing delay of the source and channel coder can be infinite. In... |
306 |
Design of Multiple Description Scalar Quantizers.
- Vaishampayan, Domaszewicz
- 1993
(Show Context)
Citation Context ...f the correlation among adjacent samples. In the following, we review two other approaches that are more efficient. 1) Multiple-Description Scalar Quantization (MDSQ): In the approach of Vaishampayan =-=[30]-=-, two substreams are obtained by producing two indexes for each quantized level. The index assignment is designed so that if both indexes are received, the reconstruction accuracy is equivalent to a f... |
114 |
Two-layer coding of video signals for VBR networks
- Ghanbari
- 1989
(Show Context)
Citation Context ...rror resilience in a video transport system has been layered coding combined with transport prioritization.3 In layered coding, video information is partitioned into more than one group or layer [3], =-=[18]-=-–[24]. Fig. 4 shows the block diagram of a generic two-layer coding and transport system. The base layer contains the essential information for the video source and can be used to generate 3The term t... |
113 |
The LOT: Transform coding without blocking effects,”
- Malvar, Staelin
- 1989
(Show Context)
Citation Context ...teed from a single description alone (including every other block) at a bit rate overhead of 0.3–0.4 bpp over that achievable by the LOT-DCT basis, which is designed to maximize the coding efficiency =-=[38]-=-. Interestingly, their study found that the required number of additional bits is fairly constant among different images, so that the relative overhead is lower for an image requiring a high bit rate.... |
112 | On a source coding problem with two channels and three receivers,” - Ozarow - 1980 |
112 | Concealment of damaged block transform coded images using projections onto convex sets
- Sun, Kwok
- 1995
(Show Context)
Citation Context ...ge and video signals by an energy minimization approach. An alternative is to use the POCS method. Sun and Kwok proposed to use this method to restore a damaged image block in a block transform coder =-=[74]-=-. The convex sets are derived by requiring the recovered block to have a limited bandwidth either isotropically (for a block in a smooth region) or along a particular direction (for a block containing... |
110 |
Optimal quantizer design for noisy channels: An approach to combined source-channel coding,”
- Farvardin, Vaishampayan
- 1987
(Show Context)
Citation Context ...rix [41]. Farvardin and Vaishampayan further extended the design of the optimal quantizer and also proposed a method for performing the code-word assignment to match the channel error characteristics =-=[42]-=-. The above studies were conducted for a general source. For image signals, Modestino and Daut first considered the application of convolution codes to protect against channel errors following a sourc... |
103 |
Recovery of lost or erroneously received motion vectors.
- Lam, Reibman, et al.
- 1993
(Show Context)
Citation Context ...so damaged, and hence the average or median is taken over the motion vectors above and below. It has been found that the last method produces the best reconstruction results [79], [80]. The method in =-=[81]-=- goes one step further. It selects among essentially the above four methods, depending on which one yields the least boundary matching error. This error is defined as the sum of the variations along t... |
98 |
Multiple Description Image Coding for Noisy Channels by Pairing Transform Coefficients.
- Wang, Orchard, et al.
- 1997
(Show Context)
Citation Context ...simplify the design process for a source signal with memory, one can assume the presence of a prewhitening transform so that the correlation-inducing transform can operate on uncorrelated samples. In =-=[34]-=- and [35], Wang et al. and Orchard et al., respectively, proposed applying a pair-wise correlating transform (PCT) to each pair of uncorrelated variables obtained from the Karhunen-Loeve transform (KL... |
89 |
Maximally smooth image recovery in transform coding.
- Wang, Zhu, et al.
- 1993
(Show Context)
Citation Context ...o signal is as smooth as possible. Wang et al. first used this approach to recover damaged blocks in still images coded using block-transform-based coders by making use of the spatial smoothness only =-=[71]-=-. Zhu et al. later extended this method to video coders using motion compensation and transform coding by adding the temporal smoothness measure [19]. In this latter case, the error function being min... |
89 |
Use of residual redundancy in the design of joint source/channel coders,”
- Sayood, Borkenhagen
- 1991
(Show Context)
Citation Context ...ENT FOR VIDEO COMMUNICATION 989 Table 3 Summary of Postprocessing Techniques for Error Concealment be used to improve the performance of the channel decoder in the presence of transmission errors. In =-=[89]-=-, Sayood and Borkenhagen proposed to use a Viterbi decoder in front of the source decoder for this purpose. VI. ENCODER AND DECODER INTERACTIVE ERROR CONCEALMENT In the previous two sections, we descr... |
87 | A distributed real-time MPEG video audio player
- Cen, Staehli, et al.
- 1995
(Show Context)
Citation Context ...mission queue to increase the number of retransmission trials for the base layer [97]. Cen et al. and Chen et al. proposed to reduce the video output rate at the encoder when the network is congested =-=[98]-=-, [99]. The feedback information about the network condition can be obtained by using the delay and loss-rate statistics at the decoder. C. Retransmission Without Waiting To make use of the retransmit... |
80 |
The sourcechannel separation theorem revisited.
- Vembu, Verdu, et al.
- 1995
(Show Context)
Citation Context ...ce of the overall system. This result was first shown by Shannon for source and channels that are memoryless and stationary [16] and was later extended to a more general class of sources and channels =-=[17]-=-. However, this theorem assumes that the complexity and processing delay of the source and channel coder can be infinite. In most real-world applications, the above assumptions are not true. First, bo... |
79 |
Packet loss resilience of MPEG–2 scalable video coding algorithms
- Aravind, Civanlar, et al.
- 1996
(Show Context)
Citation Context ...resilience in a video transport system has been layered coding combined with transport prioritization.3 In layered coding, video information is partitioned into more than one group or layer [3], [18]–=-=[24]-=-. Fig. 4 shows the block diagram of a generic two-layer coding and transport system. The base layer contains the essential information for the video source and can be used to generate 3The term transp... |
79 | Experimental Assessment of End-to-end Behavior on Internet.
- Sanghi, Agrawala
- 1993
(Show Context)
Citation Context ...retransmission, experiments show that the packet loss rate is in the range of 2–10%, while the round-trip delay is about 50–100 ms on an average and can be more than 2 s in coast-to-coast connections =-=[95]-=-. With such error and delay characteristics, the achievable QoS is usually poor. Marasli et al. proposed to achieve better service quality in terms of delay and loss rate by using retransmission over ... |
75 | Multi-resolution broadcast for digital HDTV using joint source/channel coding,” - Ramchandran, Ortega, et al. - 1993 |
71 |
Redudancy Rate-Distortion Analysis of Multiple Description Coding Using Pairwise Correlating Transforms.
- Orchard, Wang, et al.
- 1997
(Show Context)
Citation Context ...the design process for a source signal with memory, one can assume the presence of a prewhitening transform so that the correlation-inducing transform can operate on uncorrelated samples. In [34] and =-=[35]-=-, Wang et al. and Orchard et al., respectively, proposed applying a pair-wise correlating transform (PCT) to each pair of uncorrelated variables obtained from the Karhunen-Loeve transform (KLT). The t... |
67 |
Coding and cell-loss recovery in dct-based packet video
- Zhu, Wang, et al.
- 1993
(Show Context)
Citation Context ... data from several blocks. To prevent the loss of contiguous blocks because of a single packet loss, interleaved packetization can be used, by which successive blocks are put into nonadjacent packets =-=[19]-=-, [61]. This way, a packet loss will affect blocks in an interleaved order (i.e., a damaged block is surrounded by undamaged blocks), which will ease the error-concealment task at the decoder. Note th... |
66 |
Source coding for multiple descriptions
- Wolf, Wyner
- 1980
(Show Context)
Citation Context ...ventional single description coder (SDC) that is aimed at minimizing the distortion in the absence of channel loss. This has been shown using a rate-distortion analysis for different types of sources =-=[25]-=-–[27]. However, this reduced coding efficiency is in exchange for increased robustness to long burst errors and/or channel failures. With SDC, one would have to spend many error-control bits and/or in... |
65 |
The EREC: an error resilient technique for coding variable length blocks of data
- Redmill, Kingsbury
- 1996
(Show Context)
Citation Context ...e maximum separation between the synchronization code words. To reduce the introduced redundancy, however, these codes have to be used infrequently. Kingsbury et al. have developed EREC methods [55], =-=[56]-=-. In the method of [56], variable-length bit streams from individual blocks are distributed into slots of equal size. Initially, the coded data for each image block are placed into the designated slot... |
62 |
Rfc2032: Rtp payload format for h.261 video streams. Stardards Track, Network Working Group,
- Turletti, Huitema
- 1996
(Show Context)
Citation Context ... is assembled into transport packets in such a way that when a packet is lost, the other packets can still be useful because the header and coding mode information is embedded into successive packets =-=[65]-=-, [66]. A packet often contains data from several blocks. To prevent the loss of contiguous blocks because of a single packet loss, interleaved packetization can be used, by which successive blocks ar... |
61 |
Selective recovery of video packet loss using error concealment,”
- Wada
- 1989
(Show Context)
Citation Context ...he image needs intracoding due to the limited motion vector range [90], [91]. To further improve the coding efficiency, Wada proposed two schemes to perform selective recovery using error concealment =-=[92]-=-. When a packet loss is detected, the decoder sends the identity information of damaged blocks to the encoder. At the same time, error concealment is performed on the damaged blocks. Then normal decod... |
60 |
Resynchronization of motion compensated video affected by ATM cell loss.
- Haskell, Messerschmitt
- 1992
(Show Context)
Citation Context ...s of the corresponding block in the previous frame; c) using the average of the motion vectors from spatially adjacent blocks; d) using the median of motion vectors from the spatially adjacent blocks =-=[79]-=-. Typically, when a macroblock is damaged, its horizontally adjacent macroblocks are also damaged, and hence the average or median is taken over the motion vectors above and below. It has been found t... |
56 |
Multi-Directional Interpolation for Spatial Error Concealment,
- Kwok, Sun
- 1993
(Show Context)
Citation Context ...ction quality, an edge-adaptive smoothness measure can be used so that the variation along the edges is minimized but not across the edges. Several techniques have been developed along this direction =-=[72]-=-. This approach requires the detection of edge directions for the damaged blocks. This is a difficult task, and a mistake can yield noticeable artifacts in the reconstructed images. The method using t... |
51 | Self-synchronizing Huffman codes - Ferguson, Rabinowitz - 1984 |
46 | Real time video and audio in the world wide web
- Chen, Tan, et al.
- 1995
(Show Context)
Citation Context ...n queue to increase the number of retransmission trials for the base layer [97]. Cen et al. and Chen et al. proposed to reduce the video output rate at the encoder when the network is congested [98], =-=[99]-=-. The feedback information about the network condition can be obtained by using the delay and loss-rate statistics at the decoder. C. Retransmission Without Waiting To make use of the retransmitted da... |
45 |
Transform Coded Image Reconstruction Exploiting Interblock Correlation.
- Hemami, Meng
- 1995
(Show Context)
Citation Context ...ss property of the video signal is that a coefficient in a damaged block is likely to be close to the corresponding coefficients (i.e., with the same frequency index) in spatially adjacent blocks. In =-=[75]-=-, Hemami and Meng proposed to interpolate each lost coefficient in a damaged block from its corresponding coefficients in its four neighbor blocks. The interpolation coefficients are estimated by mini... |
44 |
Quantizing for noisy channels
- Kurtenbach, Wintz
- 1969
(Show Context)
Citation Context ...tz designed optimal quantizers to minimize the combined mean square error introduced by both quantization and channel errors given the input data probability distribution and the channel error matrix =-=[41]-=-. Farvardin and Vaishampayan further extended the design of the optimal quantizer and also proposed a method for performing the code-word assignment to match the channel error characteristics [42]. Th... |
41 |
Combined source-channel coding of images",
- Modestino, Daut
- 1977
(Show Context)
Citation Context ... were conducted for a general source. For image signals, Modestino and Daut first considered the application of convolution codes to protect against channel errors following a source coder using DPCM =-=[43]-=-. This technique was later extended to transform coders using DCT [44]. Three options were proposed to implement combined source and channel coding. In the first option, modulation and ECC are the sam... |
39 |
RTP payload format for H.263 video streams
- Zhu
- 1997
(Show Context)
Citation Context ...sembled into transport packets in such a way that when a packet is lost, the other packets can still be useful because the header and coding mode information is embedded into successive packets [65], =-=[66]-=-. A packet often contains data from several blocks. To prevent the loss of contiguous blocks because of a single packet loss, interleaved packetization can be used, by which successive blocks are put ... |
39 |
Temporal and spatial error concealment techniques for hierarchical MPEG-2 video codec.
- Aign, Fazel
- 1995
(Show Context)
Citation Context ...l, and the interpolation may not be accurate. To improve the estimation accuracy, Aign and Fazel proposed to interpolate pixel values within a damaged macroblock from its four 1-pixel-wide boundaries =-=[76]-=-. Two methods are proposed to interpolate the pixel values. In the first method, a pixel is interpolated from two pixels in its two nearest boundaries, as shown in Fig. 9(a). In the second method, sho... |
36 | Implementation Techniques for Continuous Media Systems and Applications
- Smith
- 1994
(Show Context)
Citation Context ...sed a cyclical user datagram protocol, which places the base-layer packets of a layered coder in the front of the transmission queue to increase the number of retransmission trials for the base layer =-=[97]-=-. Cen et al. and Chen et al. proposed to reduce the video output rate at the encoder when the network is congested [98], [99]. The feedback information about the network condition can be obtained by u... |
35 |
An Error Concealment Algorithm for Images subject to Channel Errors.
- Lam, Reibman
- 1995
(Show Context)
Citation Context ...efficient2 is damaged after some statistic test. In addition, the position of the damaged coefficient is also estimated. Lam and Reibman studied the problem of error detection in the frequency domain =-=[15]-=-. With this approach, a synchronization code word is inserted at the end of each scan line of blocks. When a synchronization code word is captured at the end of a scan line, the number of blocks decod... |
34 | Recommendation H.263 – Video Coding for low bit rate communication, Int. Telecommunication - Draft - 1995 |
34 |
An entropy coding system for digital HDTV applications
- Lei, Sun
- 1991
(Show Context)
Citation Context ...ill typically result in a shift of sequential blocks in a block-based coder. To solve this problem, a distinct synchronization code word can be inserted at a fixed interval either in the pixel domain =-=[51]-=-, [52] or in the bit-stream domain where the number of coded bits is used for measuring the interval [53], [54]. Side information such as spatial and temporal locations is normally included after the ... |
32 | Retransmission-based partially reliable transport service: An analytic model
- Marasli, Amer, et al.
- 1996
(Show Context)
Citation Context ...delay characteristics, the achievable QoS is usually poor. Marasli et al. proposed to achieve better service quality in terms of delay and loss rate by using retransmission over an unreliable network =-=[96]-=-. Instead of trying retransmission indefinitely to recover a lost packet, as in TCP, the number of retransmission trials is determined by the desired delay. Smith proposed a cyclical user datagram pro... |
31 |
Information loss recovery for block-based image coding techniques—A fuzzy logic approach
- Lee, Zhang, et al.
- 1995
(Show Context)
Citation Context ...], and Walsh transform [87]. Fuzzy logic has also been used to recover high-frequency components that cannot normally be recovered by the smoothing and interpolation methods presented in this section =-=[88]-=-. Last, besides performing error concealment in the source-coder domain, as done by the techniques presented in this section, it is also possible to use residual redundancy from the source coder in th... |
30 | Asymptotic Performance of Multiple Description Transform Codes.
- Batllo, Vaishampayan
- 1997
(Show Context)
Citation Context ...es [31]. The original MDSQ approach is developed for memoryless sources. To handle sources with memory, MDSQ can be embedded in a transform coder by coding each transform coefficient using MDSQ [32], =-=[33]-=-. This approach has been applied to transform-based image and video coders. 2) MDC Using Correlation-Inducing Linear Transforms: Another way of introducing correlation between multiple streams is by l... |
30 |
Multiple description image coding using signal decomposition and reconstruction based on lapped orthogonal transforms,”
- Chung, Wang
- 1999
(Show Context)
Citation Context ...t tradeoffs between compression gain and reconstruction gain. The latter is defined for a special case in which a lost block is recovered by the mean of four adjacent blocks. Recently, Chung and Wang =-=[37]-=- developed a reconstruction method that can achieve significantly better reconstruction quality than the mean reconstruction method. The method is based on the principle of maximally smooth recovery, ... |
30 |
Error recovery for variables length codes
- Maxted, Robinson
- 1985
(Show Context)
Citation Context ...ocol, it may not know which bit is in error and hence it cannot decode the subsequent bits. One way to prevent this is to designate one code word as the synchronization code word in the entropy coder =-=[48]-=-–[52]. A synchronization code word has the property that the entropy decoder will regain synchronization once a decoder captures such a code word. Generally, the resulting entropy coder will be less e... |
27 |
Combined source-channel coding of images using the block cosine transform
- Modestino, Daut, et al.
- 1981
(Show Context)
Citation Context ... Daut first considered the application of convolution codes to protect against channel errors following a source coder using DPCM [43]. This technique was later extended to transform coders using DCT =-=[44]-=-. Three options were proposed to implement combined source and channel coding. In the first option, modulation and ECC are the same for all the bits in every quantized transform coefficient. In the se... |
24 |
Performance of Packet Video with Combined Error Recovery
- Ramamurthy, Raychaudhuri
- 1995
(Show Context)
Citation Context ...ewpoint has changed slightly in the last few years. It has been realized that even for a coast-to-coast interactive service, one retransmission adds only about 70 ms of delay, which can be acceptable =-=[94]-=-. For one-way real-time video applications such as Internet video streaming and broadcast, the delay allowance can be further relaxed to a few seconds so that several retransmissions are possible. Ret... |
24 |
Digital Communications b Satellite
- Spilker
- 1977
(Show Context)
Citation Context ...imize the effect of transmission errors. Spilker noted that when the channel becomes very noisy, a coarse quantizer in the sourcecoding stage outperforms a fine quantizer for a PCM-based source coder =-=[40]-=-. Kurtenbach and Wintz designed optimal quantizers to minimize the combined mean square error introduced by both quantization and channel errors given the input data probability distribution and the c... |
23 | LForward Error Control for MPEG-2 Video Transport in a Wireless ATM
- Ayanoglu, Pancha, et al.
- 1996
(Show Context)
Citation Context ...ore, it must be used judiciously in video services that are very demanding in bandwidth but can tolerate a certain degree of loss. FEC has been studied for error recovery in video communications [59]–=-=[64]-=-. In H.261, an 18-bit error-correction code is computed and appended to 493 video bits for detection and correction of random bit errors in integrated services digital network (ISDN). For packet video... |
22 | Packet Video Modeling and - Ohta - 1994 |
22 |
Optimal block cosine transform image coding for noisy channels
- Vaishampayan, Farvardin
- 1990
(Show Context)
Citation Context ...nel SNR threshold to below 5 dB [44]. Vaishampayan and Farvardin considered the adaptation of bit allocation (assuming fixed-length coding) for DCT coefficients based on channel error characteristics =-=[45]-=-. The basic conclusion was that for noisier channels, fewer bits should be allocated to the high-frequency coefficients and more bits should be allocated to the low-frequency coefficients. D. Robust W... |
22 |
Video redundancy coding
- Wenger
- 1997
(Show Context)
Citation Context ...ffect of temporal error propagation, in the H.263 standard, input video frames are partitioned into separate groups called threads, and each thread is coded without using other threads for prediction =-=[47]-=-. This is referred to as video redundancy coding. For example, when two threads are used, the even and odd frames are grouped separately, and temporal prediction is performed within each group. All th... |
22 |
Cell-loss concealment techniques for layered video codecs in an atm network
- Kieu, Ngan
- 1994
(Show Context)
Citation Context ...ation is damaged. Then, concealment with this method can lead to catastrophic results in situations such as a scene change. Recovery of motion vectors and coding modes is discussed in Section V-E. In =-=[70]-=-, Kieu and Ngan considered the error-concealment problem in a layered coder that sends the motion vectors and low-frequency coefficients in the base layer and highfrequency coefficients in the enhance... |
21 | Design of a transport coding scheme for high-quality video over ATM networks - Parthsarathy, Modestino, et al. - 1997 |
21 |
Overview of the MPEG-4 Standard,
- KOENEN
- 2002
(Show Context)
Citation Context ...tinct synchronization code word can be inserted at a fixed interval either in the pixel domain [51], [52] or in the bit-stream domain where the number of coded bits is used for measuring the interval =-=[53]-=-, [54]. Side information such as spatial and temporal locations is normally included after the synchronization code word to identify where the decoded blocks belong. The synchronization code word in t... |
17 |
Application of Multiple Description Codes to Image and Video Transmission Over Lossy Networks
- Seshadri, Vaishampayan
(Show Context)
Citation Context ... indexes [31]. The original MDSQ approach is developed for memoryless sources. To handle sources with memory, MDSQ can be embedded in a transform coder by coding each transform coefficient using MDSQ =-=[32]-=-, [33]. This approach has been applied to transform-based image and video coders. 2) MDC Using Correlation-Inducing Linear Transforms: Another way of introducing correlation between multiple streams i... |
14 |
Layered transmission of signals over powerconstrained wireless channels
- Khansari, Vetterli
- 1995
(Show Context)
Citation Context ... of power to transmit the substreams in a wireless transmission environment. This combination of layered coding with unequal power control has been studied for video transmission in wireless networks =-=[22]-=-, [23]. In addition, prioritization can be realized with using different error-control treatments to various layers. For example, retransmission and/or FEC can be applied for the base layer, while no ... |
14 |
Postprocessing of late cells for packet video
- Ghanbari
- 1996
(Show Context)
Citation Context ...es not introduce the delay normally associated with retransmission [100]. A similar technique was developed by Ghanbari, which is motivated by the desire of making use of late cells in an ATM network =-=[101]-=-. With this scheme, when a video data unit is damaged, a retransmission request is sent to the encoder for recovering the damaged data. Instead of waiting for the arrival of retransmitted data, the da... |
13 | Layered image transmission over cellular radio channels," - Zhang, Liu, et al. - 1994 |
13 |
Self-synchronization variable-length codes for image transmission
- Lam, Reibman
- 1992
(Show Context)
Citation Context ... it may not know which bit is in error and hence it cannot decode the subsequent bits. One way to prevent this is to designate one code word as the synchronization code word in the entropy coder [48]–=-=[52]-=-. A synchronization code word has the property that the entropy decoder will regain synchronization once a decoder captures such a code word. Generally, the resulting entropy coder will be less effici... |
12 | Packet video for cell loss protection using deinterleaving and scrambling - Tom, Yeh, et al. - 1991 |
12 |
Cell-loss concealment in ATM video codes
- Ghanbari
- 1993
(Show Context)
Citation Context ...block (i.e., the block specified by the motion vector of the damaged block). This method is very effective when combined with layered coding that includes all the motion information in the base layer =-=[69]-=-. Because of its simplicity, this method has been widely used. In fact, the MPEG-2 standard allows the encoder to send the motion vectors for intracoded macroblocks, so that these blocks can be recove... |
12 |
Error concealment in digital simulcast ad-hdtv decoder
- Sun, Challapali, et al.
- 1992
(Show Context)
Citation Context ...d to the original pixel values (not the prediction error values). Due to the smoothness properties of natural images, the correlation between high-frequency components of adjacent blocks is small. In =-=[77]-=-, only the DC (zero frequency) and the lowest five AC (nonzero frequency) coefficients of a damaged block are estimated from the top and bottom neighboring blocks, while the rest of the AC coefficient... |
12 |
Error concealment techniques for an all-digital high-definition television system.
- Narula, Lim
(Show Context)
Citation Context ...t macroblocks are also damaged, and hence the average or median is taken over the motion vectors above and below. It has been found that the last method produces the best reconstruction results [79], =-=[80]-=-. The method in [81] goes one step further. It selects among essentially the above four methods, depending on which one yields the least boundary matching error. This error is defined as the sum of th... |
11 | Reconstruction-optimized lapped orthogonal transforms for robust image transmission
- Hemami
- 1996
(Show Context)
Citation Context ...cription by making use of the interblock correlation. To introduce additional correlation beyond what is originally present between adjacent image blocks, overlapping block transforms can be used. In =-=[36]-=-, Hemami designed a family of lapped orthogonal transform (LOT) bases, referred to as T6–T9, which achieve different tradeoffs between compression gain and reconstruction gain. The latter is defined f... |
10 | Transcoding of MPEG-II for enhanced resilience to transmission errors
- Swann, Kingsbury
- 1996
(Show Context)
Citation Context ...e reconstruction quality at the bit error rate (BER) of 10 –10 is significantly better. Recently, the above EREC method has been used to transcode an MPEG-2 bit stream to make it more error resilient =-=[57]-=-. With additional enhancement and error concealment, the video quality at a BER of 10 was considered acceptable. Kawahara and Adachi also applied the EREC method at the macroblock level together with ... |
10 | Subband-coded image reconstruction for lossy packet networks - Hemami, Gray - 1997 |
10 |
Packet Video. Modeling and Signal Processing
- Ohta
- 1994
(Show Context)
Citation Context ...t coder is by adding header information. For example, in packet-based video transmission, the output of the video encoder is packetized into packets, each of which contains a header and payload field =-=[10]-=-. The header further contains a sequence number subfield that is consecutive for sequentially transmitted packets. At the transport decoder, the sequence number can be used for packet-loss detection. ... |
8 |
Image reconstruction using vector quantized linear interpolation
- Hemami, Gray
- 1994
(Show Context)
Citation Context ...ectors can be estimated from those of the surrounding received macroblocks, and then these macroblocks can be recovered from the corresponding motion-compensated macroblocks in the previous frame. In =-=[46]-=-, Hemami and Gray proposed to add some auxiliary information in the compressed bit stream so that the decoder can interpolate lost image blocks more accurately. A damaged image block is interpolated a... |
8 |
The ERPC: An efficient error- resilient technique for encoding positional information of sparse data
- Cheng, Kingsbury
- 1992
(Show Context)
Citation Context ... to the maximum separation between the synchronization code words. To reduce the introduced redundancy, however, these codes have to be used infrequently. Kingsbury et al. have developed EREC methods =-=[55]-=-, [56]. In the method of [56], variable-length bit streams from individual blocks are distributed into slots of equal size. Initially, the coded data for each image block are placed into the designate... |
7 |
Design of entropy constrained multiple description scalar quantizers
- Vaishampayan, Domaszewicz
- 1994
(Show Context)
Citation Context ...ng multiple equally important descriptions is by splitting adjacent samples among several channels using an interleaving subsampling lattice and then coding the resulting subimages independently [28]–=-=[31]-=-. If one subimage is lost, it can be recovered satisfactorily based on correlation among adjacent samples in the original image. This approach requires a quite large bit-rate overhead because the code... |
7 |
Error concealment strategy for picture-header loss in MPEG compressed video
- Zdepski, Sun
- 1994
(Show Context)
Citation Context ...the block data. These important bits should be protected so that they can be delivered with a much lower error rate. One way to realize this is by using dual transmission of important information. In =-=[67]-=-, dual transmission for picture header information and quantization matrix was proposed for MPEG video. In [68], Civanlar and Cash considered video-on-demand services over an ATM network where the ser... |
7 |
The Grand Alliance system for
- Challapali, Lebegue, et al.
- 1995
(Show Context)
Citation Context ...einterleaving. Up to four lost cells out of 32 cells can be recovered. The Grand-Alliance high-definition television broadcast system has adopted a similar technique for combating transmission errors =-=[60]-=-. In addition to using the RS code, data randomization and interleaving are also employed for additional protection. Because a fixed amount of video data has to be accumulated to perform the block int... |
6 |
Video transmission technology with effective error protection and tough synchronization for wireless channels
- Kawahara, Adachi
- 1996
(Show Context)
Citation Context ...at a BER of 10 was considered acceptable. Kawahara and Adachi also applied the EREC method at the macroblock level together with unequal error protection for H.263 transmission over wireless networks =-=[58]-=-. Their simulation results show that the proposed method outperforms the plain FEC both for random bit errors at BER greater than 10 and for burst errors. In the error-resilient mode of MPEG-4 [53], [... |
6 |
Cell loss detection and recovery in variable rate video
- Lee, Lee, et al.
- 1990
(Show Context)
Citation Context ...herefore, it must be used judiciously in video services that are very demanding in bandwidth but can tolerate a certain degree of loss. FEC has been studied for error recovery in video communications =-=[59]-=-–[64]. In H.261, an 18-bit error-correction code is computed and appended to 493 video bits for detection and correction of random bit errors in integrated services digital network (ISDN). For packet ... |
4 |
Enhancement of one-dimensional variablelength DPCM images corrupted by transmission errors
- Rose, Heiman
- 1989
(Show Context)
Citation Context ...bits for error detection and correction [1]. To accomplish error detection at the video decoder, characteristics of natural video signals have also been exploited. In the methods proposed in [12] and =-=[13]-=-, differences of pixel values between two neighboring lines are used for detecting transmission errors in pulse code modulation (PCM) and differential (D)PCM coding. When the difference is greater tha... |
4 | Channel error recovery for transform image coding
- Mitchell, Tabatabai
- 1981
(Show Context)
Citation Context ...r detecting transmission errors in pulse code modulation (PCM) and differential (D)PCM coding. When the difference is greater than a threshold, the current image segment is declared to be damaged. In =-=[14]-=-, Mitchell and Tabatabai proposed to detect the damage to a single DCT coefficient by examining the difference between the boundary pixels in a block and its four neighbor blocks. At the decoder, four... |
4 |
A practical system for MPEG2 based video-on-demand over ATM packet networks
- Civanlar, Cash
- 1996
(Show Context)
Citation Context ...rate. One way to realize this is by using dual transmission of important information. In [67], dual transmission for picture header information and quantization matrix was proposed for MPEG video. In =-=[68]-=-, Civanlar and Cash considered video-on-demand services over an ATM network where the servers and the clients are Internet protocol based and are connected to the network via a fiber distributed data ... |
4 |
Post filtering for cell loss concealment in packet video
- Tzou
- 1989
(Show Context)
Citation Context ... methods reviewed here are for transform-based coders using nonoverlapping transforms. Error-concealment techniques have also been developed for other coding methods, including subband [82]–[84], LOT =-=[85]-=-, [86], and Walsh transform [87]. Fuzzy logic has also been used to recover high-frequency components that cannot normally be recovered by the smoothing and interpolation methods presented in this sec... |
4 |
Adaptation to cell loss in a 2-layer video codec for ATM networks. Picture Coding Symp
- Horne, Reibman
- 1993
(Show Context)
Citation Context ...for prediction. The information for the selected prediction frame buffer is also included in the encoded bit stream so that the decoder can use the same frame buffer for prediction. Horne and Reibman =-=[93]-=- proposed to send observed cell-loss statistics back to the encoder, which then adapts its coding parameters to match the prevailing channel conditions. More intrablocks and shorter slices are used wh... |
4 |
Device and method of signal loss recovery for realtime and/or interactive communications
- Zhu
- 1996
(Show Context)
Citation Context ...y. In the following, we describe a scheme that uses retransmission for recovering lost information for predictive video coders but does not introduce the delay normally associated with retransmission =-=[100]-=-. A similar technique was developed by Ghanbari, which is motivated by the desire of making use of late cells in an ATM network [101]. With this scheme, when a video data unit is damaged, a retransmis... |
4 | stream packetization and synchronization on nonguaranteed quality of services LANs - “Media |
3 |
Enhancement of PCM and DPCM images corrupted by transmission errors
- Ngan, Stelle
- 1982
(Show Context)
Citation Context ...e of 493 bits for error detection and correction [1]. To accomplish error detection at the video decoder, characteristics of natural video signals have also been exploited. In the methods proposed in =-=[12]-=- and [13], differences of pixel values between two neighboring lines are used for detecting transmission errors in pulse code modulation (PCM) and differential (D)PCM coding. When the difference is gr... |
3 | Source coding for multiple descriptions,” The Bell Syst - Wolf, Wyner, et al. - 1980 |
3 |
ED): 'MPEG-4 video verification model version 8.0
- Ebrahimi
- 1997
(Show Context)
Citation Context ...synchronization code word can be inserted at a fixed interval either in the pixel domain [51], [52] or in the bit-stream domain where the number of coded bits is used for measuring the interval [53], =-=[54]-=-. Side information such as spatial and temporal locations is normally included after the synchronization code word to identify where the decoded blocks belong. The synchronization code word in this ca... |
3 |
Wang A comparison of smoothness measures for error concealment in transform coding
- Zhu, Y
- 1995
(Show Context)
Citation Context ...ls. Such first-order smoothness measures can lead to blurred edges in the recovered image. Zhu and Wang later investigated the use of second-order smoothness criteria to reduce the blurring artifacts =-=[73]-=-. A combination of the quadratic variation and Laplacian operator was proposed, and the reconstructed images using this measure are visually more pleasing than those obtained with the first-order meas... |
3 |
Reconstructing lost video data in a lapped orthogonal transform based coder
- Haskell, Messerschmitt
- 1990
(Show Context)
Citation Context ...ds reviewed here are for transform-based coders using nonoverlapping transforms. Error-concealment techniques have also been developed for other coding methods, including subband [82]–[84], LOT [85], =-=[86]-=-, and Walsh transform [87]. Fuzzy logic has also been used to recover high-frequency components that cannot normally be recovered by the smoothing and interpolation methods presented in this section [... |
3 |
An interframe coding system for video teleconferencing signal transmission at a 1.5 Mbit/s rate
- Mukawa, Kuroda, et al.
- 1984
(Show Context)
Citation Context ... degrade the video quality under the same bit-rate budget. To reduce the bit-rate increase caused by intracoding, only part of the image needs intracoding due to the limited motion vector range [90], =-=[91]-=-. To further improve the coding efficiency, Wada proposed two schemes to perform selective recovery using error concealment [92]. When a packet loss is detected, the decoder sends the identity informa... |
2 | Low bit rate video transmission over fading channels for wireless microcellular systems - Kansari - 1996 |
2 |
Non-hierarchical signal decomposition and maximally smooth reconstruction for wireless video transmission
- Wang, Chung
- 1997
(Show Context)
Citation Context ...taining multiple equally important descriptions is by splitting adjacent samples among several channels using an interleaving subsampling lattice and then coding the resulting subimages independently =-=[28]-=-–[31]. If one subimage is lost, it can be recovered satisfactorily based on correlation among adjacent samples in the original image. This approach requires a quite large bit-rate overhead because the... |
2 |
Transmitting 4 MHz TV signals by combinational difference coding
- Yasuda, Kuroda, et al.
- 1977
(Show Context)
Citation Context ... hence degrade the video quality under the same bit-rate budget. To reduce the bit-rate increase caused by intracoding, only part of the image needs intracoding due to the limited motion vector range =-=[90]-=-, [91]. To further improve the coding efficiency, Wada proposed two schemes to perform selective recovery using error concealment [92]. When a packet loss is detected, the decoder sends the identity i... |
2 | et al., “Experimental assessment of end-to-end behavior on Internet - Sanghi - 1993 |
1 | Recommendation H.324, Terminal For Low Bitrate Multimedia Communication - Draft - 1997 |
1 |
Achievable rats for multiple descriptions
- El-Gamal, Cover
- 1982
(Show Context)
Citation Context ...onal single description coder (SDC) that is aimed at minimizing the distortion in the absence of channel loss. This has been shown using a rate-distortion analysis for different types of sources [25]–=-=[27]-=-. However, this reduced coding efficiency is in exchange for increased robustness to long burst errors and/or channel failures. With SDC, one would have to spend many error-control bits and/or introdu... |
1 |
Multiple description coding by pairing transform coefficients,” unpublished
- Orchard, Wang, et al.
(Show Context)
Citation Context ...e reconstruction quality obtained with the transform coder using PCT exceeds that of the JPEG coder (with even and odd blocks split among two channels) only when the block loss rate is larger than 10 =-=[39]-=-. Similarly, in the MDC coder using LOT, the T6–T9 bases were shown to provide better reconstruction 4JPEG is a standard of the Joint Photographic Experts Group of the ISO. WANG AND ZHU: ERROR CONTROL... |
1 | Self-synchronizing sequential coding with low redundancy,” Bell Syst - Neumann - 1971 |
1 | The grand alliance system for - Chapplapali - 1995 |
1 |
Variable bit rate HDTV CODEC with ATM cell loss compensation
- Kinoshita, Nakahashi, et al.
- 1993
(Show Context)
Citation Context ...from several blocks. To prevent the loss of contiguous blocks because of a single packet loss, interleaved packetization can be used, by which successive blocks are put into nonadjacent packets [19], =-=[61]-=-. This way, a packet loss will affect blocks in an interleaved order (i.e., a damaged block is surrounded by undamaged blocks), which will ease the error-concealment task at the decoder. Note that the... |
1 |
Method for the correction of cell losses for low bit-rate signals transport with the
- Cochennec
- 1993
(Show Context)
Citation Context ...data has to be accumulated to perform the block interleaving described above, relatively long delay will be introduced. To reduce the interleaving delay, a diagonal interleaving method is proposed in =-=[63]-=-. At the encoder side, input data are stored horizontally in a designated memory section, which are then read out diagonally to form ATM cells. In the decoder, the data are stored diagonally in the me... |
1 |
Image reconstruction from spatial subband images and its applications in packet video transmission
- Wang, Ramamoorthy
- 1991
(Show Context)
Citation Context ... reconstruction methods reviewed here are for transform-based coders using nonoverlapping transforms. Error-concealment techniques have also been developed for other coding methods, including subband =-=[82]-=-–[84], LOT [85], [86], and Walsh transform [87]. Fuzzy logic has also been used to recover high-frequency components that cannot normally be recovered by the smoothing and interpolation methods presen... |
1 |
Recovery with lost subband data in overcomplete image coding
- Gonzalez-Rosiles, Cabrera, et al.
- 1995
(Show Context)
Citation Context ...nstruction methods reviewed here are for transform-based coders using nonoverlapping transforms. Error-concealment techniques have also been developed for other coding methods, including subband [82]–=-=[84]-=-, LOT [85], [86], and Walsh transform [87]. Fuzzy logic has also been used to recover high-frequency components that cannot normally be recovered by the smoothing and interpolation methods presented i... |
1 |
Partial correction of transmission errors in Walsh transform image coding without recourse to error correction coding
- Wong, Steele
- 1978
(Show Context)
Citation Context ...ransform-based coders using nonoverlapping transforms. Error-concealment techniques have also been developed for other coding methods, including subband [82]–[84], LOT [85], [86], and Walsh transform =-=[87]-=-. Fuzzy logic has also been used to recover high-frequency components that cannot normally be recovered by the smoothing and interpolation methods presented in this section [88]. Last, besides perform... |
1 | A distributed real-time MPEG video audio player - al - 1995 |
1 | Recommendation H.223/Annex A - Annex C, Multiplexing protocol for low bitrate mobile multimedia communications - Draft - 1997 |
1 |
et al., “Low bit rate video transmission over fading channels for wireless microcellular systems
- Kansari
- 1996
(Show Context)
Citation Context ...wer to transmit the substreams in a wireless transmission environment. This combination of layered coding with unequal power control has been studied for video transmission in wireless networks [22], =-=[23]-=-. In addition, prioritization can be realized with using different error-control treatments to various layers. For example, retransmission and/or FEC can be applied for the base layer, while no or wea... |