A fast motion estimation algorithm for mobile communications

The limitation of processing power, battery life and memory capacity of portable terminals requires reducing encoding complexity in mobile communications. Motion estimation (ME) is the most computationally intensive module in a typical video codec, which determines not only the encoder’s performance but also the reconstructed video quality. In this paper, a fast ME algorithm for H.264/AVC baseline profile coding is proposed based on the analysis of motion vector field and error surface, and the statistical distributions of different type macroblocks (MBs). Simulation results showed that: in comparison with MVFAST, the proposed algorithm can decrease the computational load over 7.2% with no requirement of expanding memory capacity while maintaining the same video quality as MVFAST. Furthermore, its simplicity makes it easy to be implemented on hardware.     

A fast block-matching algorithm based on variable shape search

INTRODUCTION Block-matching motion estimation is a key video coding technology that reduces the temporal redundancy between adjacent frames. The 3GPP/ 3GPP2 mandatory video codecs (MPEG-4 Simple Profile or H.263 Baseline) have adopted this tech- nology extensively. However, block-matching motion estimation is quite computationally intensive if the Full Search (FS) algorithm is used which exhaus- tively checks all possible candidate motion vectors within the search window. Therefore…     

Adaptive foreground and shadow segmentation using hidden conditional random fields

Video object segmentation is important for video surveillance, object tracking, video object recognition and video editing. An adaptive video segmentation algorithm based on hidden conditional random fields (HCRFs) is proposed, which models spatio-temporal constraints of video sequence. In order to improve the segmentation quality, the weights of spatio-temporal con- straints are adaptively updated by on-line learning for HCRFs. Shadows are the factors affecting segmentation quality. To separate foreground objects from the shadows they cast, linear transform for Gaussian distribution of the background is adopted to model the shadow. The experimental results demonstrated that the error ratio of our algorithm is reduced by 23% and 19% respectively, compared with the Gaussian mixture model (GMM) and spatio-temporal Markov random fields (MRFs).     

High throughput bandwidth optimized VLSI design for motion compensation in AVS HDTV decoder

In this paper we present a motion compensation （MC） design for the newest Audio Video coding Standard （AVS） of China. Because of compression-efficient techniques of variable block size （VBS） and sub-pixel interpolation, intensive pixel calculation and huge memory access are required. We propose a parallel serial filtering mixed luma interpolation data flow and a three-stage multiplication free chroma interpolation scheme. Compared to the conventional designs, the integrated architecture supports about 2.7 times filtering throughput. The proposed MC design utilizes Vertical Z processing order for reference data re-use and saves up to 30% memory bandwidth. The whole design requires 44.3k gates when synthesized at 108 MHz clock frequency using 0.18-μm CMOS technology and can support up to 1920×1088@30 fps AVS HDTV video decoding.     

Adaptive early termination of fast mode decision in MVC based on inter-view correlation

Variable size motion estimation (ME) and disparity estimation (DE) are employed to select the best coding mode for each macroblock (MB) in the current joint multiview video model (JMVM).This technique achieves the highest possible coding efficiency,but it results in extremely large computation complexity which obstructs the multiview video coding (MVC) from practical application.This paper proposes an adaptive early termination of fast mode decision algorithm for MVC.It makes use of the coding information o...     

A parallel memory architecture for video coding

To efficiently exploit the performance of single instruction multiple data （SIMD） architectures for video coding, a parallel memory architecture with power-of-two memory modules is proposed. It employs two novel skewing schemes to provide conflict-free access to adjacent elements （8-bit and 16-bit data types） or with power-of-two intervals in both horizontal and vertical directions, which were not possible in previous parallel memory architectures. Area consumptions and delay estimations are given respectively with 4, 8 and 16 memory modules. Under a 0.18-pm CMOS technology, the synthesis results show that the proposed system can achieve 230 MHz clock frequency with 16 memory modules at the cost of 19k gates when read and write latencies are 3 and 2 clock cycles, respectively. We implement the proposed parallel memory architecture on a video signal processor （VSP）. The results show that VSP enhanced with the proposed architecture achieves 1.28× speedups for H.264 real-time decoding.     

Blocking optimized SIMD tree search on modern processors

Tree search is a widely used fundamental algorithm. Modern processors provide tremendous computing power by integrating multiple cores, each with a vector processing unit. This paper reviews some studies on exploiting single instruction multiple date (SIMD) capacity of processors to improve the performance of tree search, and proposes several improvement methods on reported SIMD tree search algorithms. Based on blocking tree structure, blocking for memory alignment and dynamic blocking prefetch are proposed to optimize the overhead of memory access. Furthermore, as a way of non-linear loop unrolling, the search branch unwinding shows that the number of branches can exceed the data width of SIMD instructions in the SIMD search algorithm. The experiments suggest that blocking optimized SIMD tree search algorithm can achieve 1.6 times response speed faster than the un-optimized algorithm.     

PID-based bit allocation strategy for asymmetric stereoscopic video coding with fuzzy quality controller

Asymmetric stereoscopic video coding can take advantage of binocular suppression in human vision by representing one of the two views in lower quality.This paper proposes a bit allocation strategy for asymmetric stereoscopic video coding.In order to improve the accuracy of bit allocation and rate control in the left view,a proportionalintegral-derivative controller is adopted.Meanwhile,to control the quality fluctuation between consecutive frames of the left view,a quality controller is adopted.Besides,a fuzzy controller is proposed to control the variation in quality between the left and right views by comparing the PSNR disparity of two views with a fixed threshold,which is used to quantize the binocular psycho-visual redundancy and adjust the quantization parameter (QP) of the right view correspondingly.The proposed algorithm has been implemented in H.264/AVC video codec,and the experimental results show its effectiveness in rate control while keeping a good quality for the left view,and fewer bits are allocated for the right view so that the overall bit rate is saved by 7.2% at most without the loss of subjective visual quality for stereoscopic video.     

An optimal quality adaptation mechanism for end-to-end FGS video transmission

In this paper, we propose a novel optimal quality adaptation algorithm for MPEG-4 fine granular scalability (FGS) stream over wired network. Our algorithm can maximize perceptual video quality by minimizing video quality variation and increasing available bandwidth usage rate. Under the condition that the whole bandwidth evolution is known, we design an optimal algorithm to select layer. When the knowledge of future bandwidth is not available, we also develop an online algorithm based on the optimal algorithm. Simulation showed that both optimal algorithm and online algorithm can offer smoothed video quality evolution.     

跳水运动视频中的运动目标分割

针对跳水运动视频中的人体运动目标分割问题,提出一种简单有效的基于颜色特征运动目标检测及分割算法。首帧进行图像预处理,利用色相和亮度两个分量加强颜色差异,然后使用OTSU算法对图像进行阈值分割。结合RGB颜色空间启发式肤色聚类结果确定运动目标所在的连通区域,最终完成首帧运动目标的自动检测。有效地克服了复杂背景变化的影响,能够快速实现跳水运动目标的分割,且对运动对象的快速整体运动有较强的鲁棒性。     

Rate-distortion optimized bitstream switching for peer-to-peer live streaming

Peer-to-peer （P2P） technology provides a cost-effective and scalable way to distribute video data. However, high heterogeneity of the P2P network, which rises not only from heterogeneous link capacity between peers but also from dynamic variation of available bandwidth, brings forward great challenge to video streaming. To attack this problem, an adaptive scheme based on rate-distortion optimization （RDO） is proposed in this paper. While low complexity RDO based frame dropping is exploited to shape bitrate into available bandwidth in peers, the streamed bitstream is dynamically switched among multiple available versions in an RDO way by the streaming server. Simulation results show that the proposed scheme based on RDO achieves great gain in overall perceived quality over simple heuristic schemes.     

基于免疫单亲遗传算法在TSP中的应用

基本遗传算法保持群体多样性的能力较差,所以经常在问题求解的过程中极易陷入局部最优解。根据生物的免疫原理和单亲遗传算法并结合最近邻域算法思想提出的一种改进算法———基于免疫单亲遗传算法（IPGA）。免疫遗传算法中的基因重组、免疫记忆以及免疫元动态等特性,这些特性有助于改进基本遗传算法群体多样性的保持能力。最后结合48个城市旅行商问题进行了求解,仿真结果表明,基于免疫单亲遗传算法具有更好的性能,相对于传统的遗传算法收敛速度提高了30%。     

Multiple description scalable video coding based on 3D lifted wavelet transform

INTRODUCTION With the expansion of multimedia applications, video transmission is becoming an important issue in the research area of communication. It is very im- portant to compress a large amount of video data effectively, which has already attracted considerable attention recently. To make source coders both er- ror-resilient and network-adaptive are two main challenges facing the video compression techniques. It is necessary to make the bitstreams temporal, spa- tial and SNR scalabl…     

Efficient video downscaling transcoder from MPEG-2 to H.264

The new H.264 video coding standard achieves significantly higher compression performance than MPEG-2. As the MPEG-2 is popular in digital TV, DVD, etc., bandwidth or memory space can be saved by transcoding those streams into H.264 in these applications. Unfortunately, the huge complexity keeps transcoding from being widely used in practical applications. This paper proposes an efficient transcoding architecture with a smart downscaling decoder and a fast mode decision algorithm. Using the proposed architecture, huge buffering memory space is saved and the transcoding complexity is reduced. Performance of the proposed fast mode decision algorithm is validated by experiments.     

应用于液压集成块优化的一种混合遗传-退火算法

This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks (HMB). Due to the limitation of its local search ability of genetic algorithm (GA) in solving a massive combinatorial optimization problem, simulated annealing (SA) is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.     

Temporal Error Concealment Technique for MPEG-4 Video Streams

Concerning inter4v mode employed widely in MPEG-4 video, a new temporal error concealment scheme for MPEG-4 video sequences is proposed, which can selectively interpolate one or four motion vectors (MVs) for the missing macroblock (MB) according to the estimated MB coding mode. Performance of the proposed scheme is compared with the existing schemes with multiple testing sequences at different bit error rates. Experimental results show that the proposed algorithm can mask the impairments caused by transmission errors more efficiently than 0 MV and average MV methods by consuming more time for different bit error rates. It has an acceptable image quality close to that obtained by the selective motion vector matching (SMVM) algorithm, while taking less than half of cycles of operations. The proposed concealment scheme is suitable for low complexity video real-time implementations.     

An adaptive FEC to protect RoHC and UDP-Lite H.264 video critical data

INTRODUCTION Recommendation H.264 was approved by ITU-T in May 2003 and the approved draft specifi cation is available for public review (Wiegand, 2003) The H.264 video codec has a very broad application range that covers all forms of digital compressed video from low bit rate Internet streaming applica tions to HDTV broadcast and digital cinema applica tions with near lossless coding. About 50% band width would be saved by using H.264 when compared to the existing most efficient com…     

An optimal quality adaptation mechanism for end-to-end FGS video FGS video transmission

In this paper, we propose a novel optimal quality adaptation algorithm for MPEG-4 fine granular scalability (FGS) stream over wired network. Our algorithm can maximize perceptual video quality by minimizing video quality variation and increasing available bandwidth usage rate. Under the condition that the whole bandwidth evolution is known, we design an optimal algorithm to select layer. When the knowledge of future bandwidth is not available, we also develop an online algorithm based on the optimal algorithm. Simulation showed that both optimal algorithm and online algorithm can offer smoothed video quality evolution.     

纳米金属蒸镀高密度录像带的制作原理与工艺

纳米金属蒸镀高密度录像带是纳米材料与纳米技术成功应用的范例之一 .阐述了纳米金属斜蒸镀的基本原理 ,给出了纳米金属蒸镀录像带 (ME tape)磁层的柱状结构 .介绍了蒸镀带生产过程中对原材料的要求及生产工艺 ,并将其性能特征与通用 VHS录像带做了对比     

Coping with handover effects in video streaming over cellular networks

The 3rd generation partnership project (3GPP) has defined the protocols and codecs for implementing media streaming services over packet-switched 3G mobile networks. The specification is based on IETF RFCs on audio/video transport. It also adds new features to achieve better adaptation to the mobile network environment. In this paper, we propose an algorithm for handover detection and fast buffer refill that is based on the existing feedback and signaling mechanisms. The proposed algorithm refills the receiver buffer at a faster pace during a limited time frame after a hard handover is detected in order to achieve higher video quality.