KEYWORDS: Video, Chromium, Detection and tracking algorithms, Receivers, Signal attenuation, Error analysis, Java, Signal to noise ratio, Video compression, Mathematics
In this work, we propose an effective And-Or tree based packetization algorithm of Luby Transform (LT) codes to
provide stable video streaming services by minimizing the deterioration of video streaming service quality caused by lost
packets over error-prone wireless network. To accomplish our goal, the proposed packetization algorithm considers the
relationships among encoded symbols of LT codes based on an And-Or tree analysis tool, and then puts the these
encoded symbols into packets to minimize the packet loss effect during packet transmission and improve the decoding
success rate of LT codes by reducing the correlations among packets. We conduct a mathematical analysis to prove
performance of our packetization algorithm of LT codes compared with conventional packetization algorithm. Finally,
the proposed system is fully implemented in Java and C/C++, and widely tested to show that the proposed packetization
algorithm works reasonably well. The experimental results are provided to demonstrate that the proposed packetization
algorithm supports more stable video streaming services with higher peak signal-to-nose ratio (PSNR) than the
conventional packetization algorithm with various packet loss patterns, including random and burst packet loss patterns.
KEYWORDS: Control systems, Video, Scalable video coding, Video coding, Computer programming, Internet, Video compression, Video processing, Computer science, Computer engineering
This paper presents an effective IPTV channel management method using SVC (scalable video coding) that considers concurrently both channel zapping time and network utilization. A broadcasting channel is encoded in two-layered bitstream (base-layer channel and
enhancement-layer channel) to supply for heterogeneous environments. The proposed algorithm locates only a limited numbers of base-layer channels close to users to reduce the network delay part of channel zapping time and adjusts the length of GOP (group of picture) into each base-layer channel to decrease the video decoding delay part of channel zapping time, which are performed based on user's channel preference information. Finally, the experimental results are provided to show the performance of the proposed schemes.
In this work, we present an effective overlay multicast tree constructing algorithm to meet delay constraint for real-time media service with the minimum networking price over Differentiated-Service networks. In addition, a dynamic and scalable tree maintaining algorithm is proposed for seamless service by updating the small parts of the tree when some End-systems join or leave the multicast group. An effective solution is obtained by changing the tree structure among Data-server, Proxy-senders and End-systems and the class vector of Proxy-senders. Finally, experimental results are
presented to compare the performance of the proposed algorithm.
This paper presents an H.263+-based overlay video multicast system over the Internet. The proposed overlay video multicast system consists of two parts: overlay multicast tree suitable for the video traffic delivery and H.263+ rate control adaptive to overlay multicast tree. Overlay multicast tree is constructed to minimize the average delay for video traffic delivery, and H.263+ rate control is implemented to enhance the human visual perceptual quality over the multicast tree. Finally, we show by experimental results that the proposed overlay multicast system can provide the
effective overlay multicast service over the Internet.
KEYWORDS: Video, Video compression, Data transmission, Statistical analysis, Video processing, Stars, Receivers, Smoothing, Standards development, Data modeling
In this paper, we present effective quality-of-service renegotiating schemes for streaming video. The conventional network supporting quality-of-service generally allows a negotiation at call setup. However, it is not efficient for the video application since the compressed video traffic is statistically non-stationary. Thus, we consider the network supporting quality-of-service renegotiations during the data transmission, and study effective quality-of-service renegotiating schemes for streaming video. Simple token bucket model, whose parameters are token filling rate and token bucket size, is adopted for the video traffic model. The renegotiating time instants and the parameters are determined by analyzing the statistical information of compressed video traffic. In this paper, two renegotiating approaches, i.e. fixed renegotiating interval case and variable renegotiating interval case, are examined. Finally, the experimental results are provided to show the performance of the proposed schemes.
This paper presents an effective VOD transmission scheme under RCBR network that is suitable for the statistically non-stationary video traffic since it supports the bandwidth renegotiation during data transmission. The proposed system includes two parts: the VOD server architecture and traffic smoothing/admission control algorithms. The proposed VOD server system consists of video DB and metadata DB that includes compression history information including the quantization parameters versus output rate profile, encoded frame positions and encoding types, etc. And, the proposed traffic smoothing and admission control algorithms are performed based on the aforementioned metadata and control the traffic properties of the selected VOD through the communication between them to be accommodated under the current network situations. And, the experimental results are provided to demonstrate the efficiency of the proposed system.
This paper presents a novel adaptive H.263+ rate control algorithm for interactive video communication under the networks supporting bandwidth renegotiation, which can communicate with end-users to accommodate their time-varying bandwidth requests during data transmission. They are especially suitable for the transmission of non-stationary video traffics. The proposed rate control algorithm communicates with the network to renegotiate the required bandwidth for the underlying video and choose their control strategies according to the renegotiation results. The proposed algorithm treats both the spatial and temporal qualities at the same time to enhance human visual perceptual quality. Experimental results are provided to demonstrate that the proposed rate control algorithms can achieve superior performance with a low computational.
KEYWORDS: Video, Computer programming, Receivers, Internet, Video coding, Video compression, Distortion, Control systems, Motion models, Video processing
A feedback-based Internet video transmission scheme based on the ITU-T H.263+ is presented. The proposed system is capable of continually adjusting the stream size to avoid the congestion in response to network condition changes. It consists of several major components such as TCP-friendly end- to-end congestion control with available bandwidth estimation, encoding frame rate control and transmission buffer smoothing at the server. These components are designed to meet the low computational complexity requirement so that the whole system can operate in real time. Among these, video-aware congestion control, which is called the receiver-based congestion control mechanism (RCCM), and the variable frame rate H.263+ encoding are the two key features. Through a seamless integration of these feature components, it is demonstrated that network adaptivity is enhanced to mitigate the packet loss and the bandwidth fluctuation, resulting in a smoother video experience at the receiver.
Most existing H.263+ rate control algorithms, e.g. the one adopted in the test model of the near-term (TMN8), focus on the macroblock layer rate control and low latency under the assumptions of with a constant frame rate and through a constant bit rate (CBR) channel. These algorithms do not accommodate the transmission bandwidth fluctuation efficiently, and the resulting video quality can be degraded. In this work, we propose a new H.263+ rate control scheme which supports the variable bit rate (VBR) channel through the adjustment of the encoding frame rate and quantization parameter. A fast algorithm for the encoding frame rate control based on the inherent motion information within a sliding window in the underlying video is developed to efficiently pursue a good tradeoff between spatial and temporal quality. The proposed rate control algorithm also takes the time-varying bandwidth characteristic of the Internet into account and is able to accommodate the change accordingly. Experimental results are provided to demonstrate the superior performance of the proposed scheme.
A low bit rates, the bit budget for I-frame coding in H.263+ can be too high to be practical. A hybrid DCT/wavelet transform based I-frame coding is proposed in this work as a solution to the rate control problem. This new coder is compatible with the H.263+ bit stream syntax, and aims at an R-D optimized performance with a reasonable amount of computational complexity. By employing fast estimation of the coding efficiency with a rate- distortion model and performing an R-D based rate allocation, the hybrid coding scheme achieves higher coding gain at low bit rates.
Two new rate control algorithms for H.263+ are proposed in this work. Almost all rate control algorithms studied before are performed under the constant frame rate. However, at very low bit rates, video quality can be degraded severely in order to support a fixed frame rate. Our first rate control algorithm preserves good video quality by adjusting the frame rate under a given channel condition and keeping motion smoothness simultaneously. Our second rate control algorithm is a global bit allocation scheme which guarantees the reasonable sub-optimality with a low computational complexity. Experimental results are provided to demonstrate the performance of the proposed algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.