M. W. Garrett and M. Vetterli, "Joint source/channel coding of statistically multiplexed real time services on packet networks," in IEEE/ACM Trans. Netw., vol. 1, Feb. 1993, pp. 71--80.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....The interested reader can find details on error concealment algorithms for video in [9, t0] for example. Robustness to transmission losses can also be enhanced by using error correction [tt] and by matching the degree of protection to the perceptual importance of the transmitted information [12]. The remaining network based QoS parameter, jitter or cell delay variation (CDV) typically causes more problems for VBR video than CBR video. Therefore, we discuss it briefly here, although space constraints prevent us from giving a detailed treatment. Because different cells of a stream see ....

....demands for bandwidth. In particular, it allows selective shedding of bits when the link capacity is exceeded. It is not surprising, then, that the first published work considering feedback between the network and the video system within the context of explicit rate feedback used a layered codec [12]. There are still numerous open issues that remain to be tackled for a successful deployment of VBR video. In the source coding arena, despite the fact that layered coding has been studied in various forms (e.g. multiresolution, scalable) for a number of years, there are still concerns about its ....

M. W. Garrett and M. Vetterli, "Joint source/channel coding of statistically multiplexed real time services on packet networks," IEEE/ACM Trans. on Networking, vol. 1, pp. 71-80, Feb. 1993.

....since frame boundaries change as the traffic advances inside the network. In contrast, our approach does not require such an arrangement. Skelly et al. 22] proposed a histogram based model in order to describe a slowly varying VBR The original sequence was generated by Garrett and Vetterli [26]. video traffic source like a motion JPEG video. In their model, the traffic generation rate from a video source is assumed to be constant during a fairly long period since the bit rate of a motion JPEG video changes very slowly. Using this assumption, Shroff and Schwartz [42] derived an analytic ....

M. W. Garrett and M. Vetterli, "Joint source/channel coding of statistically multiplexed real-time services on packet networks," IEEE/ACM Trans. on Networking, vol. 1, no. 1, pp. 71--80, February 1993.

....such a way that l ,P, and B frames evenly coincide with one another. Such an arrangement may be implementable for a singlehop network, but it is impractical for a multihop network since frame boundaries change as the traffic advances 1. The original sequence was generated by Garrett and Vetterli [30]. Fig. 2. MPEG coded video sequence: Starwars. a) Arrival rate sequence. b) Arrival rate histogram. inside the network. In contrast, our approach does not require such an arrangement. Skelly et al. 26] proposed a histogram based model in order to describe a slowly varying VBR video traffic ....

M.W. Garrett and M. Vetterli, "Joint Source/Channel Coding of Statistically Multiplexed Real-Time Services on Packet Networks," IEEE/ACM Trans. Networking, vol. 1, no. 1, pp. 71-80, Feb. 1993.

....2.1 Data partitioning and layered coding Scalable and joint source channel coding are important ways for providing real time transport. Very early evidence of combined source channel coding technique exists in [28] which discusses its usage for images. More recently, works presented in [8,22,35] discussed the usage of such techniques for real time services. Particular emphasis is given to scalable coding for VBR video over ATM networks in [9,12] Data loss is a major problem for transmitting video over wireless networks. Bit error rates of around 10 to 10 may arise for long ....

M.W. Garrett and M. Vetterli. Joint source/channel coding of statistically multiplexed real-time services on packet networks. IEEE/ACM Transactions on Networking, 1(1):71--80, February 1993.

....an interface to the network QoS mechanisms is necessary) Chapter 7 redefines one end to end only approach developed in this thesis (section 5.2.4) to be a combined one with explicit cooperation (section 7.2) 3.3.2. 1 Pre encoder payload analysis Embedded coding packetization ( Jay93, GV93, ST89] means transmitting the bits representing a sample in different packets. Thus packets of different importance are generated corresponding to the bit significances (LSB MSB: least most significant bit) Other known mechanisms are working at the signal (PCM) level in conjunction with other ....

M. Garrett and M. Vetterli. "Joint Source/Channel Coding of Statistically Multiplexed Real Time Services on Packet Network". IEEE/ACM Transactions on Networking, February 1993.

No context found.

Mark W. Garrett and Martin Vetterli. Joint source/channel coding of statistically multiplexed real-time services on packet networks. IEEE/ACM Transactions on Networking, 1(1):71--80, February 1993.

No context found.

M. W. Garrett and M. Vetterli, "Joint source/channel coding of statistically multiplexed real-time services on packet networks," IEEE/ACM Trans. Networking, vol. 1, pp. 71--80, Feb. 1993.

....in Section 3.5. Finally, a frame rate scalable extension to SVIP is presented in Section 3.6 followed by a conclusion. 3. 2 Error Resilience Bandwidth scalable video compression schemes are often designed with transport prioritization in mind and produce packets that are highly inter dependent [47, 28, 45, 134, 124, 135]. In particular, it has been shown [47, 28, 45] that by separating the source material into a base layer and an enhancement layer and by applying priority queuing [28, 45] or di#erent loss probabilities [47] results superior to the one layer approach are obtained for statistically multiplexed ....

....SVIP is presented in Section 3.6 followed by a conclusion. 3. 2 Error Resilience Bandwidth scalable video compression schemes are often designed with transport prioritization in mind and produce packets that are highly inter dependent [47, 28, 45, 134, 124, 135] In particular, it has been shown [47, 28, 45] that by separating the source material into a base layer and an enhancement layer and by applying priority queuing [28, 45] or di#erent loss probabilities [47] results superior to the one layer approach are obtained for statistically multiplexed networks. However, due to the lack of prioritized ....

[Article contains additional citation context not shown here]

M. Garrett and M. Vetterli. Joint source/channel coding of statistically multiplexed real-time services on packet networks. ACM/IEEE Trans. Networking, 1(1), pp. 71--80, February 1993.

No context found.

M. W. Garrett and M. Vetterli, "Joint source/channel coding of statistically multiplexed real time services on packet networks," in IEEE/ACM Trans. Netw., vol. 1, Feb. 1993, pp. 71--80.

No context found.

M. W. Garrett and M. Vetterli, "Joint source/channel coding of statistically multiplexed real time services on packet networks," in IEEE/ACM Trans. Netw., vol. 1, Feb. 1993, pp. 71--80.

No context found.

Garrett M.W. and Vetterli M., Joint Source/Channel Coding of Statistically Multiplexed Real-Time Services on Packet Networks, IEEE/ACM Transactions on Networking,vol. 1, pp. 7180, February 1993.

No context found.

M. W. Garrett and M. Vetterli. Joint Source/Channel Coding of Statistically Multiplexed RealTime Services over Packet Networks. IEEE/ACM Trans. Networking, 1(1):71-80, 1993.

No context found.

M. W. Garrett and M. Vetterli, "Joint Source Channel Coding of Statistically Multiplexed Real-Time Services on Packet Networks," IEEE/ ACM Transactions on Networking, Vol. 1, No. 1, February 1993, pp. 71-79.

No context found.

M. W. Garrett and M. Vetterli, "Joint Source Channel Coding of Statistically Multiplexed Real--Time Services on Packet Networks," IEEE/ ACM Transactions on Networking, Vol. 1, No. 1, February 1993, pp. 71--79.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC