In this paper, we propose a low-complexity priority based packet scheduling algorithm for streaming MPEG-4 Scalable to Lossless (SLS) encoded audio. In the proposed system, the SLS encoded frames are partitioned into data units of different quality layers, which are transmitted according to their quality contribution to the final decoded audio and their urgency relative to the playback progress. Experimental results show that the proposed scheduling algorithm has an even lower compared to traditional greedy algorithm for packet scheduling, while outperforms them by a significant margin in for terms of quality of the streamed audio.

In this paper, we are concerned with robust H.264/AVC video transmission over lossy packet networks and present a hierarchical unequal packet loss protection (HULP) scheme in a transmission system that efficiently combines erasure coding, H.264/AVC error resilience techniques and importance measures in video coding schemes. The importance of the video stream packets is distinguished by three criteria: the frame sequence number in a group of pictures (GOP), the per-frame bitrate and the H.264/AVC data partition type. Using a fixed amount of redundancy, more important packets of a video stream are protected with a more powerful erasure code than the less important packets. We demonstrate the effectiveness of this approach by system implementation and performance evaluation. In the presence of packet loss, we show that the received video quality, as measured by PSNR, is significantly improved when the HULP scheme is used. More importantly, in our experiments, HULP can achieve higher PSNR values and better user perceived quality, but requiring less redundancy, than equal loss protection (ELP) schemes.

This paper presents a real-time H.264/AVC baseline profile video encoder. The encoder hardware is implemented using a cost-effective, low-power ADI Blackin-561 DSP and related peripherals for real-time video capturing, coding and streaming. The encoder software is developed using a two-stage pipelining framework for efficient parallel video data encoding. A synchronization mechanism with shared memory semaphores is used to schedule the hardware processes and software procedures to acquire the real-time encoding performance. Techniques for reducing the execution time in both stages are also described in this paper. Performance evaluation results verified that the encoder is capable of performing real-time encoding of CIF-resolution and medium-motion VGA-resolution videos, while maintaining good video quality.

The paper describes a fast MPEG-2 to H.264 transcoder by leveraging the MPEG-2 metadata set to reduce the computational complexity of the H.264 encoding process. With the proposed fast transcoding algorithms, our software-based transcoder can perform real-time transcoding a MPEG-2 movie from a DVD disc (at D1 resolution and full frame-rate) and simultaneously performing RTP/UDP streaming of the H.264 video with AC-3 audio over IP networks using only a 1.6 GHz PC notebook. We can achieve about 20-30% faster than the full re-encoding method even at the same target bit-rate and without visible quality degradation. Benchmarking with existing software systems has shown similar results.

Temporal scalability in H.264/SVC video compression standard can be achieved with the hierarchical B-pictures (HB) structure. When performing motion estimation (ME) in the HB structure, the temporal distance between the current frame and reference frame(s) can be large (up to 32 frames apart). This limits the performance of fast search algorithm as larger search window is often necessary. Extensive experiments showed that popular fast suboptimal block ME algorithms are ineffective at tracking large motions across several frames. In this paper, we propose a new framework called Lacing which integrates well with any fast block ME techniques to significantly improve the motion prediction accuracy in quality of the motion-compensated frame and also result in smoother motion vector fields with lower entropy.

In H.264 video coding, there are a substantial number of 4x4 blocks becoming all-zeros after transformation and quantization. This is a waste of computational resources because these skipped blocks do not require forward transform and quantization. We proposed a very effective early detection of fast skipped block detections based on the theoretical derivation of H.264 integer transform and quantization. The experimental results show that the algorithm can detect 9.71%-43.35% more zero blocks than Yong's method.

It is well known that motion estimation is the most computationally intensive processing unit of the H.264 video encoder. Various fast motion estimation algorithms have been proposed to reduce its complexity. Generally, these approaches achieve speedup by reducing the number of candidate search points within the search window. In this paper, we propose a new method, which uses the Sum-of-Absolute-Differences mapping (SAD map) to dynamically cache the SAD values and then reuse them for different block sizes. Experimental results on standard video sequences verified that the proposed method is capable of increasing the encoder speed by up to 15% without any loss in PSNR value or increase in bit rate. Due to its generic nature, this method can be applied in any fast motion estimation methods although it is especially effective in the full search motion estimation method.

As one important component in H.264 video encoder, interpolation of half and quarter pixels is also computational intensive. Compared to integer pixel motion estimation, "finer" interpolation provides better block match. However, this good motion compensation performance is obtained at the expense of increased complexity. Based on our previous work, this paper presents an improved fast and adaptive interpolation method that further reduces the complexity of video encoding process. Experimental results on typical video sequences demonstrate that the proposed method is able to increase encoder speed ranging from 10% to 22% compared with our previous work without any PSNR loss or bit rate increase.

The H.264/AVC video coding standard aims to enable significantly improved compression performance compared to all existing video coding standards. In order to achieve this, a robust rate-distortion optimization (RDO) technique is employed to select the best coding mode and reference frame for each macroblock. As a result, the complexity and computation load increase drastically. This paper presents a fast mode decision algorithm for H.264/AVC intraprediction based on local edge information. Prior to intraprediction, an edge map is created and a local edge direction histogram is then established for each subblock. Based on the distribution of the edge direction histogram, only a small part of intraprediction modes are chosen for RDO calculation. Experimental results show that the fast intraprediction mode decision scheme increases the speed of intracoding significantly with negligible loss of peak signal-to-noise ratio.

The new video coding standard, H.264/MPEG-4 AVC, uses variable block sizes ranging from 4/spl times/4 to 16/spl times/16 in interframe coding. This new feature has achieved significant coding gain compared to coding a macroblock (MB) using fixed block size. However, this feature results in extremely high computational complexity when brute force rate distortion optimization (RDO) algorithm is used. This paper proposes a fast intermode decision algorithm to decide the best mode in intercoding. It makes use of the spatial homogeneity and the temporal stationarity characteristics of video objects. Specifically, spatial homogeneity of a MB is decided based on the MB's edge intensity, and temporal stationarity is decided by the difference of the current MB and it colocated counterpart in the reference frame. Based on the homogeneity and stationarity of the video objects, only a small number of intermodes are selected in the RDO process. The experimental results show that the fast intermode decision algorithm is able to reduce on the average 30% encoding time, with a negligible peak signal-to-noise ratio loss of 0.03 dB or, equivalently, a bit rate increment of 0.6%.

The paper presents a fast block INTER mode decision algorithm to improve significantly the time efficiency of the encoder in H.264. It makes use of the spatial homogeneity of a video object's textures and the temporal stationarity characteristics inherent in video sequences. Specifically, the homogeneity decision of a block is based on edge information, and MB differencing is used to judge whether the MB is time-stationary. Based on the above analysis, only parts of inter prediction modes are chosen for RDO (rate distortion optimization) calculation. Experimental results show that the new scheme is able to achieve a reduction of 30% encoding time on average, with a negligible average PSNR loss of only 0.03 dB and a mere 0.6% bit rate increase compared with the original H.264 reference software.

The emerging H.264-AVC video coding standard aims to significantly improve compression performance compared to all existing video coding standards. In order to achieve this, a robust rate-distortion optimization (RDO) technique is employed to select the best coding mode and reference frame for each macroblock. As a result, the complexity and computation load increase drastically. This paper presents a fast mode decision algorithm for H.264 intra prediction based on local edge information. Prior to intra prediction, an edge map is created and a local edge direction histogram is then established for each sub-block. Based on the distribution of the edge direction histogram, only a small part of intra prediction modes are chosen for RDO calculation. Experimental results show that the last intra mode decision scheme increases the speed of intra coding significantly with negligible loss of PSNR.

Conventional rate control schemes focus on the problem of finding an optimal quantization value for P- and B-frames. No rate control is available for the encoding of I-frames. This could pose big problems due to the large number of bits an I-frame could generate, and due to the fact that the number of bits varies drastically from sequence to sequence, depending on their image complexity. This problem becomes severe especially at very low bit rate. Therefore, a mechanism to allocate data bits to an I-frame according to its complexity is indispensable in order to have constant coding quality. This work presents a mechanism to establish for I-frames a generic relationship between the quantization value, data bits, and their image complexity. Experimental results show that this generic relationship provides a fairly accurate estimation of quantization value for an I-frame at given data bits and image complexity, and is very useful in controlling the data bits generated by an I-frame.

Many rate control algorithms focus on the adjustment of quantisation values to retain a certain buffer level, and arbitrary frame-skipping is often needed to keep the buffer from overflow at very low bit-rates. A content adaptive rate control is proposed to optimise the balance between spatial and temporal quality via active frame-skipping. The occurrence of frame-skipping is jointly dependent on the temporal and spatial quality of the video, and on the fullness of the buffer. This helps to achieve a consistent spatial and temporal quality and to enhance the overall perceptual quality. Experimental results show that the new scheme is simple but very effective, with large average PSNR gains and consistently improved visual quality, and the improvement in perceptual quality is much more significant than that in average PSNRs.

Color encoded phase-stepping light projection method is a new and promising technique for 3D shape modeling However, the 3D model acquired is often smeared by large error. The main cause of the error is color coupling amongst the three primary colors RGB. In this paper, we first analyzed the color-coupling problem. It is found that there is a strong coupling between G and R element. The coupling between R and G are proportional to the phase interval between them and the overall intensity of image. Second, we proposed an adaptive phase stepping method to alleviate the color coupling errors efficiently and improve accuracy effectively. An algorithm corresponding to a specific paradigm with R-G-B phase step set to 0-45-180 is given and is applied to measure different objects. Experimental results demonstrate the effectiveness of the method.

This paper proposes an adaptive frame layer rate control scheme for H.264 by introducing a linear model to predict the mean absolute difference (MAD) of current frame by that of previous one. The target bit rate for each frame is computed by adopting a fluid flow traffic model and linear tracking theory. The corresponding quantization parameter is computed by using a quadratic rate-distortion model. The rate distortion optimization (RDO) is then performed for all macroblocks (MBs) in the current frame by the quantization parameter. Both constant bit rate (CBR) and variable bit rate (VBR) cases are studied. The average PSNR is improved up to 0.75 dB compared to an encoder with fixed quantization parameter.

We introduce a PDA-based live video streaming system on GPRS network based on MPEG-4 video compression standard. Due to the limited computational resources of PDA, all the key modules of MPEG-4 codec are efficiently implemented and optimized such as multithreading, buffer design, wireless communication, encoder and decoder. Several novel techniques are developed in the coding, streaming as well as the post- processing stages of the system.

With the recent development of third-generation communication technologies, encoding live video using a PDA and sharing it among friends has become a reality. However, the embedded processor inside a PDA is still not powerful enough and there are two major hurdles to overcome: (1) video coding needs to meet the rigorous constraint of the available computation capacity of a PDA; (2) In a PDA the computing power allocated to video coding may vary drastically (in bursts). In this paper, a new adaptive rate control algorithm is proposed for video coding over a PDA. This adaptive rate control scheme takes into account the time constraint of a PDA, and its bit allocation depends not only on the available data bits, but more importantly, on the available coding time. Experimental results show that, compared to the existing rate control scheme, the new algorithm can always achieve the maximum frame rate, maximize the utilization of the available bandwidth and computing power, increase the average PSNR, and improve the subjective perceptual quality of the reconstructed video.