Modeling MPEG Coded Video Traffic by Markov-Modulated Self-Similar Processes

Markov modulated self-similar processes are proposed to model MPEG video sequences that can capture the LRD (Long Range Dependency) characteristics of video ACF (Auto-Correlation Function). The basic idea is to decompose an MPEG compressed video sequence into three parts according to different motion/content complexity such that each part can individually be described by a self-similar process. Beta distribution is used to characterize the marginal cumulative distribution (CDF) of the self-similar processes. To model the whole data set, Markov chain is used to govern the transitions among these three self-similar processes. In addition to the analytical derivation, initial simulations have demonstrated that our new model can capture the LRD of ACF and the marginal CDF very well. Network cell loss rate using our proposed synthesized traffic is found to be comparable with that using empirical data as the source traffic.     

一种新的基于场景的VBR MPEG压缩视频源统计模型

由于VBRMPEG视频流可以获得统计复用增益和恒定的图像质量,它已经成为网络视频业务的主流,但是也给网络服务质量的控制带来了困难。因此,我们很有必要针对这些视频业务流对承载它们的网络带来的影响进行研究和评估。精确的MPEGVBR视频源统计模型不但有助于提高网络仿真的准确度,而且有助于研究网络其它方面的问题,如网络延时、分组丢失、延迟扰动等。本文提出了一种新的基于场景的VBRMPEG压缩视频源统计模型,该模型不仅计算简便,能快速产生符合要求的视频流样本,还能同时拟合原始视频业务数据的概率分布情况、自相关函数和自相似特性。     

SIMULATION AND MODELLING OF VARIABLE BIT RATE MPEG VIDEO TRANSMISSION OVER ATM NETWORKS

This paper proposes an efficient transmission mechanism based on frame spreading, for variable bit rate (VBR) MPEG compressed video, through an asynchronous transfer mode (ATM) multiplexer, such as a cable head-end. We implement a priority scheme in a software MPEG encoder which produces proportionate traffic in both (i.e. high and low) priority partitions for all three types of video frames used in MPEG, i.e. intraframe (I), predicted (P) and bidirectionally interpolated (B). Furthermore, we simulate an ATM multiplexing scheme with a pushout buffer mechanism providing priority scheduling at the multiplexer for the two video partitions. We load the multiplexer with VBR MPEG traffic and collect performance statistics such as the cell loss ratios for various frame spreading scenarios. In order to study the transmission mechanisms via simulation, we develop two statistical models, using the transform-expand-sample technique (TES) for VBR MPEG video with two levels of priority. The first model is matched with the empirical histogram and autocorrelation function of each frame type (I, P and B). The second model is created with the assumption of a gamma distribution for the number of bits in each frame type. We conduct experiments using both models and compare the results.     

Image/video spatial scalability in compressed domain

Image/video compression is widely used in various applications with the advent of the Joint Photographic Expert Group (JPEG), Motion Picture Expert Group (MPEG), and H.261 standards. Hence, most visual data are stored in the compressed format. Spatial scalable encoding of visual data has several applications, including browsing visual databases, querying multimedia databases, interactive multimedia communications, etc. We propose two novel techniques, namely, format compatible (FC) discrete cosine transform (DCT) and format modified (FM) DCT to implement image/video spatial scalability directly in the DCT compressed domain. The FC-DCT technique can be used to manipulate the standard bit streams, such as JPEG, MPEG, etc., while the FM-DCT technique can be employed in a variety of applications which require fast processing. In contrast to the traditional spatial-domain techniques, the compressed-domain techniques remove the unnecessary decompression and recompression procedures, thus, they have the advantages of reduced computational complexity and storage requirements. Simulation results demonstrate that the proposed DCT-domain techniques can achieve a comparable performance at a much lower computational complexity compared to the spatial-domain techniques     

Manipulation and compositing of MC-DCT compressed video

Many advanced video applications require manipulations of compressed video signals. Popular video manipulation functions include overlap (opaque or semitransparent), translation, scaling, linear filtering, rotation, and pixel multiplication. We propose algorithms to manipulate compressed video in the compressed domain. Specifically, we focus on compression algorithms using the discrete cosine transform (DCT) with or without motion compensation (MC). Such compression systems include JPEG, motion JPEG, MPEG, and H.261. We derive a complete set of algorithms for all aforementioned manipulation functions in the transform domain, in which video signals are represented by quantized transform coefficients. Due to a much lower data rate and the elimination of decompression/compression conversion, the transform-domain approach has great potential in reducing the computational complexity. The actual computational speedup depends on the specific manipulation functions and the compression characteristics of the input video, such as the compression rate and the nonzero motion vector percentage. The proposed techniques can be applied to general orthogonal transforms, such as the discrete trigonometric transform. For compression systems incorporating MC (such as MPEG), we propose a new decoding algorithm to reconstruct the video in the transform domain and then perform the desired manipulations in the transform domain. The same technique can be applied to efficient video transcoding (e.g., from MPEG to JPEG) with minimal decoding     

A GACS modeling approach for MPEG broadcast video

Accurate MPEG source models are needed to support high speed networks such as ATM and Internet. In this paper, we propose a video model called Gaussian auto-regressive and chi-square processes (GACS) for MPEG coded video traffic. The GACS models the sizes of MPEG I, P, and B frames according to the MPEG syntax I-frame>P-frame>B-frame. This is done by decomposing the process of each frame size into a weighted sum of a number of chi-square sequences. Each chi-square sequence is then obtained by squaring a Gaussian process, which is efficiently generated by using an auto-regressive (AR) model whose parameters are determined from an estimated covariance matrix. We evaluate the effectiveness of our model by conducting a series of experiments using a wide variety of long empirical video sequences. The results show that the proposed model leads to excellent data fit and accurate prediction of queuing performance.     

Variable complexity motion compensated error concealment in video coding

Transmission of compressed video through a data network may involve loss of data owing to channel errors and/or congestion. To conceal the effect of such errors in perceived video quality, concealment schemes happen to be an important choice in terms of their pertinence to encoder-decoder models. This paper focuses on the scenario where error bursts do not extend to more than one frame of digital video. For this, there exist block-based and pixel-based concealment techniques and their applicability is often ruled by a trade-off between perceived video quality and computational complexity. The paper proposes a variable complexity concealment technique and compares the results with existing schemes qualitatively and quantitatively for a range of MPEG test sequences and macroblock loss rates.     

Super-resolution mosaicing from MPEG compressed video

In this paper we address the problem of mosaic construction from MPEG 1/2 compressed video for the purpose of video browsing. State-of-the-art mosaicing methods work on raw video, but most video content is available in compressed form such as MPEG 1/2. Applying these methods to compressed video requires full decoding which is very costly. The resulting mosaic is in general too large to display on the screen and is thus inappropriate for the purpose of video browsing. Therefore, we directly extract very low-resolution frames from MPEG 1/2 compressed video for the mosaic construction and then apply a super-resolution (SR) method based on iterative backprojections in order to increase the mosaic resolution and its visual quality. Global motion to be used in the SR method for aligning and warping the frames is estimated from motion information contained in the compressed stream. We also use the estimated global motion in the blur estimation and in the choice of the degradation model used for the restoration in the SR algorithm. The method for the SR mosaic construction from MPEG 1/2 compressed video that we present in this paper is less costly than mosaic construction from full decoded video. Furthermore, the resulting mosaic size is more appropriate for the purpose of video browsing.     

Flexible and robust packet transport for digital HDTV

The packet-oriented transport approach used in the advanced digital television (ADTV) system for terrestrial HDTV broadcast is described. ADTV achieves robust HDTV delivery on terrestrial simulcast channels via MPEG video compression, prioritization of MPEG data, and `cell-relay' type packet transport in conjunction with a two-tier physical transmission scheme. General design issues relevant to the development of the proposed transport protocol are discussed. ADTV's prioritization algorithm for partitioning MPEG-encoded video into high-priority (HP) and standard-priority (SP) bit streams is outlined. The data transport format supporting these prioritized compressed video bit streams is described. The three principal sublayers of the ADTV transport protocol are discussed in terms of specific functions, impact of system performance, and hardware implementation factors. A proof-of-concept simulation model that incorporates transport encoding and decoding functionality is outlined, and performance evaluation results are given for illustrative transmission scenarios     

基于MPEG压缩域的快速、鲁棒的全局运动信息提取方法

全局运动信息在视频分析中起着重要的作用.本文根据MPEG编码特点,提出了一种从MPEG压缩域中快速有效地进行全局运动参数估计的算法.该算法充分利用了MPEG压缩码流中的信息,通过提取预测残差DC图像的运动背景区域,估计全局运动参数,从而保证了参数估计的准确性,有效地克服了已有文献中仅仅采用运动矢量进行全局运动估计的局限性.根据不同的MPEG测试序列的对比分析,结果表明,本算法可快速准确地对MPEG视频序列进行全局运动信息估计,同时具有很高的鲁棒性.     

用于多视视频加深度的错误隐藏算法

提出了一种针对多视视频加深度(MVD)的错误隐藏( EC)算法。算法充分利用MVD特有的深度 信息及当前丢失宏块周围正确解码的宏块信息,将丢失宏块分为3类不同属性的宏块。针对3类宏块的特 点,分别提出了基于候选运动矢量修正(CMVR)、基于深度的外边界匹配(DOBMA)以及自适应 权 值的EC(AWEC)等模式。实验表明,本文提出的算法在保证相同的视频主客观质量情况下, 能够快速有效地实现EC。     

Quality-optimised MPEG2 video data rate control using fuzzy logictechniques

Fuzzy logic control has been employed to improve the rate control mechanism for a MPEG2 video encoder. The data rate of compressed video is controlled by video encoders for either variable bit rate (VBR) or constant bit rate (CBR) applications. In VBR video transmission, it is considered to be more efficient to regulate the video rate by the video coder than by network management in order to avoid network congestion and maintain stable video quality. This rationale can also be applied to CBR transmission. Two fuzzy-logic-based rate control techniques are proposed which maintain the buffer occupancy within a specified range. In the proposed technique for VBR applications, a video quality measure is taken as the crucial control parameter. In CBR rate control, the video data rate or the buffer occupancy is also considered as a fuzzy logic variable. Proposed techniques are designed to control either data rate or video quality, depending on the mode of transmission, i.e. CBR or VBR for the MPEG2 encoder. The performance is compared to a typical VBR MPEG video coder with fixed quantiser step sizes for VBR and also to the CBR video coder with MPEG2 TM5 at typical channel rates. Simulation results are presented with peak signal-to-noise ratio, data rate variation and buffer occupancy as the performance measures     

网络业务量的一种稳定多分形模型及其检验

目前网络业务量研究中有自相似和多分形两种主要的先验模型。自相似模型简洁,运用单一的H 指数来描述业务量特性,但它并不能完全表达业务量的信息;多分形模型更准确,但它运用函数形式的多分形谱来刻画信号,不便于实际分析。本文在无穷可分层叠的理论框架下提出了网络业务量的一种稳定多分形模型。运用小波变换方法,通过多个业务量记录的检验,证实此模型从尺度行为和边缘分布两方面都能准确刻画业务量。作为一般多分形过程的特例,该模型把多分形指数的表达式确定下来,并归结为4个参数的估计。     

Threshold‐Based Camera Motion Characterization of MPEG Video

We propose an efficient scheme for camera motion characterization in MPEG‐compressed video. The proposed scheme detects six types of basic camera motions through threshold‐based qualitative interpretation, in which fixed thresholds are applied to motion model parameters estimated from MPEG motion vectors (MVs). The efficiency and robustness of the scheme are validated by the experiment with real compressed video sequences.     

Low‐Complexity MPEG‐4 Shape Encoding towards Realtime Object‐Based Applications

Although frame‐based MPEG‐4 video services have been successfully deployed since 2000, MPEG‐4 video coding is now facing great competition in becoming a dominant player in the market. Object‐based coding is one of the key functionalities of MPEG‐4 video coding. Realtime object‐based video encoding is also important for multimedia broadcasting for the near future. Object‐based video services using MPEG‐4 have not yet made a successful debut due to several reasons. One of the critical problems is the coding complexity of object‐based video coding over frame‐based video coding. Since a video object is described with an arbitrary shape, the bitstream contains not only motion and texture data but also shape data. This has introduced additional complexity to the decoder side as well as to the encoder side. In this paper, we have analyzed the current MPEG‐4 video encoding tools and proposed efficient coding technologies that reduce the complexity of the encoder. Using the proposed coding schemes, we have obtained a 56 percent reduction in shape‐coding complexity over the MPEG‐4 video reference software (Microsoft version, 2000 edition).     

Performance modeling of MPEG‐4 video streaming over IEEE 802.11 using distribution coordination function

Delivering video streaming over wireless Internet is becoming increasingly popular. However, most of the research studies focused on the modeling analysis of system performance such as saturation throughput and channel utilization. Perceived quality of video streaming cannot be assessed solely based on the results of analytical models. In this paper, we propose a model to assess the perceived quality of MPEG‐4 video streaming over IEEE 802.11 distribution coordination function (DCF)‐based wireless local area networks. The analysis of our proposed model considers not only effects of losses such as collision loss from channel access competition but also wireless loss caused by wireless interferences. Moreover, the impact of the loss of specific MPEG‐4 video frames is also taken into account in the performance analysis. The model was validated by comparing our performance results with results obtained from simulation and analytical models. The results show that our proposed model is able to predict the perceived quality of MPEG‐4 video streaming over DCF‐based WLAN more accurately than other models. Copyright © 2010 John Wiley & Sons, Ltd.     

TES-based video source modeling for performance evaluation ofintegrated networks

The letter considers modeling methodologies of variable bit-rate (VBR) video sources for performance evaluation of integrated networks. The authors consider an example in which compressed H.261 standard VBR video is transmitted over a local area network carrying both video and data. A group-of-block (GOB) level source model has been constructed using TES (transform-expand-sample)-a new general methodology for generating stationary autocorrelated time series, which can simultaneously capture a prescribed marginal distribution and autocorrelation function. The TES model is used to drive CSMA/CD network simulations for a performance evaluation study. Numerical comparisons with a conventional autoregressive (AR) modeling approach are given     

Compressed video processing for cut detection

One of the challenging problems in video databases is the organisation of video information. Segmenting a video into a number of clips and characterising each clip has been suggested as one mechanism for organising video information. This approach requires a suitable method to automatically locate cut points (boundaries between consecutive camera shots in a video). Several existing techniques solve this problem using uncompressed video. Since video is increasingly being captured, moved, and stored in compressed form, there is a need for detecting shot boundaries directly in compressed video. The authors address this issue and show certain feature extraction steps in MPEG compressed video that allow the implementation of most of the existing cut detection methods developed for uncompressed video for MPEG video stream. They also examine the performance of three tests for cut detection by viewing the problem of cut detection as a statistical hypothesis testing problem. As the experimental results indicate, the statistical hypothesis testing approach permits fast and accurate detection of video cuts