基于半八边形模板的运动估计算法?

H.264视频编码标准中,运动估计占用了编码器极大的运算量.针对 H.264快速块匹配,本文提出了一种基于半八边形搜索模板的运动估计算法.该方法使用一个十字形模板来预测搜索方向,依据绝对差和(Sum of Absolute Differences, SAD)分布的方向性自适应地选取半八边形模板进行搜索,在搜索过程中,判断 SAD 值下降最快的方向精确定位匹配点,减少搜索点之间的冗余,提高搜索速度.理论分析表明该算法同经典六边形算法相比可以减少搜索点数.实验结果显示,在重建图像质量接近全搜索的同时,新算法减少了运动估计20%–30%的运算量.     

基于H.264的一种视频编码算法的研究与FPGA实现

H.264是由ITU-T视频编码专家组VCEG和ISO/IEC运动图像专家组MPEG联合制订的新一代视频编码标准。而运动估计是整个编码过程中最耗时的一部分,它的效率直接决定了整个编码系统的效率。因此本文在混合非对称十字多六边形搜索算法原理的基础上,提出了一种混合六边形搜索算法,使四种标准算法合理搭配。并且在FPGA上设计了一种有效的硬件结构实现该算法。     

H.264/AVC编码器算法优化分析

H.264/AVC是JVT(联合视频组)和MPEG(活动图像编码专家组)联合提出的具有更高压缩效率的视频编码标准,主要分析本编码器主要采用的快速算法有:帧内模式快速选择算法、帧间模式快速选择算法、快速运动搜索算法等内容,对于进一步深化设计H.264/AVC编码器具有一定帮助。     

基于X264的运动估计算法研究

H.264是目前最新的视频编解码标准,研究运动估计基本原理和研究状况的基础上,对X264编码器的三种运动估计算法进行分析和比较,实验结果表明可以在保证例像质量的情况下,提高编码速度,有效压缩视频.     

基于快速运动估计算法UMHexagonS的研究

UMHexagonS算法已经被视频编码标准H.264正式采纳作为整像素的快速运动估计算法。该算法的运算量相对于快速全搜索算法可节约90%以上,同时能够保持较好的率失真性能。本文结合JM10.2的源代码对UMHexagonS算法进行了分析,并对该算法进行了改进。通过利用运动矢量间的相关性,采用一种新的自适应的非对称十字形模板来代替原算法中的非对称十字形模板,并将改进的算法在JM10.2测试模型上进行了验证。实验结果表明,本文建议的方法在保证编码性能的同时,可以有效减少运动估计所需要的时间。     

降低分辨率的MPEG2到H.264快速转码算法研究

H.264编码多应用于移动设备以及移动设备要求低分辨率视频的特性,要求在MPEG2向H.264转码的过程中,在保持高效率的同时对视频降低分辨率。在MPEG2到H.264的转码过程进行分析基础上,提出一种可以降低视频分辨率的快速转码算法。通过利用决策树仅对一个视频块进行运动估计的方法,提高降低分辨率后转码的效率。能够在大幅度降低计算复杂度的同时,实现从MPEG2到H.264的降低分辨率转换。实验结果表明,在基本保持图像质量的基础上,转码的时间缩短近60%。     

一种快速实现H.264运动估计的方法

本文提出一种快速实现H.264运动估计的算法。该算法利用视频图像中存在大量空/时域冗余这一特点,在运动估计过程中引入预判空间相关性和时域稳定性的方法,节省了大量不必要的计算步骤。试验结果表明,该算法运动估计时间仅为JM84的30.3%,峰值信噪比(PSNR)仅降低1.1%,码率平均增加3.95%。     

一种基于差错估计的H.264视频容错算法

针对最新的视频编码标准H．264,设计了一种基于差错估计的容错算法。该算法结合信道条件,估计差错在视频编码帧之间的扩散;根据每个宏块差错的程度,自适应地判断是否对该宏块进行帧内编码,从而抑制差错的积累。在存在反向信道的环境中,该算法可以利用解码器反馈的实际宏块错误信息,跟踪差错扩散,对其进行更准确的估计,以提高容错性能。仿真表明,在各种信道条件下,该算法相对于随机帧内宏块更新算法．重建图像平均峰值信噪比有1．3～2．5dB的提高。同时,该算法对信道估计的要求不高,运算量和存储量的增加较低,具有实用性。     

AVC/H.264标准中高效运动估计硬件结构设计

为解决视频编码标准AVC/H.264中运动估计高计算复杂度问题,提出了一个高效运动估计硬件实现结构.该结构能够实现多尺寸块运动估计处理,并且具有高流水效率和高性价比的特点.结构灵活性强,通过改变PE单元和加法树的流水级数能够达到面积和计算能力的折中.实验表明,该结构在搜索窗为65×65时,针对图像尺寸为720×576的视频,每秒最高可以编码48幅图像.     

一种用于AVS视频编码的块运动估计算法

通过对现有的视频图像编码中的帧间预测技术所用的运动估计算法的分析,提出了一种适用于AVS视频编码标准的快速而有效的块运动估计算法,该算法采用5个检测点的大菱形和9个检测点的小田字形双模板结构,通过调用大菱形模板和小田字形模板进行块运动匹配搜索,随着搜索的进行,大菱形模板可以被循环调用,但约定小田字形模板仅被调用一次.通过与全搜索算法和菱形搜索算法比较,这种新的块运动估计算法在保证编码性能几乎不变的情况下,编码复杂性能够得到有效的降低.     

Design and implementation of real‐time software‐based H.261 video codec

ITU‐T H.261 is a video coding standard for videophone and video‐conferencing applications on LAN and ISDN, which requires a great amount of computing power for DCT and motion estimation, traditionally provided by hardware. Since motion estimation is a major problem in developing real‐time video codec, in this paper we propose a simple and fast motion estimation algorithm to reduce searching time. Mainly, a real‐time software‐based H.261 video codec is investigated and implemented, in which several fast methods such as programming technique and Intel MMX? instruction are used to improve computing speed. The experimental results have demonstrated that our H.261 codec can compress video in CIF format over 30 fps and in QCIF at 105 fps, and can achieve a very high decoding rate. © 2002 Wiley Periodicals, Inc. Int J Imaging Syst Technol 12, 73–83, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.10013     

基于能量守恒全零DCT系数块的预先判别算法

针对全零DCT系数块,为避免对其进行变换和量化操作以减少编码器的运算量,从DCT公式、量化和能量守恒出发,在分析现有判别法对全零DCT系数块的误判与漏判的基础上,提出了一种预先判断全零DCT系数块的新方法,可应用于基于块的视频编码器中.同时,结合H.264整数变换和量化的特点对该算法进行了改进和仿真实验.实验结果表明,新提出的算法在保持PSNR不变的情况下,较现有典型方案有高出达32%的检出率,因而可更大幅度地降低DCT变换量化模块的计算复杂度.     

Novel fast block motion estimation using diamond‐arc‐hexagon search patterns

Abstract

This work presents a novel block motion estimation (ME) approach, diamond‐arc‐hexagon search (DAHS), which uses diamond, arc, and hexagon search patterns to accomplish the fast searching process. According to the characteristic of the center‐based motion vector distribution for the real‐world video sequence, DAHS employs a small diamond pattern extended hexagon search to refine the central area search. Furthermore for estimation in large motion situations, the strategy of the large diamond‐to‐arc search can preserve good performance. Experimental results indicate that DAHS is suitable for both (quasi‐) stationary and large motion searches. DAHS outperforms the efficient three‐step (E3SS) and hexagon‐based search (HEXBS) in prediction quality, and improves the searching speed about 9% compared to E3SS. The proposed algorithm was tested using several sequences and delivered excellent performance in search speed and prediction of video quality. The DAHS can be applied to real‐time video processes, such as H.264/MPEG‐4 advanced video coding (AVC) and scalable video coding (SVC).     

Optical flow-based motion compensation algorithm for very low-bit-rate video coding

In this article, we propose an efficient compression algorithm for very low-bit-rate video applications. The algorithm is based on (a) an optical-flow motion estimation to achieve more accurate motion prediction fields; (b) discrete cosine transformation (DCT) coding of the motion vectors from the optical-flow estimation to reduce the motion overheads; and (c) an adaptive threshold technique to match optical flow motion prediction and minimize the residual errors. Unlike the classic block-matching based DCT video coding schemes in MPEG-1/2 and H.261/3, the proposed algorithm uses optical flow for motion compensation and the DCT is applied to the optical flow field instead of predictive errors. Thresholding techniques are used to treat different regions to complement optical flow technique and to efficiently code residual data. While maintaining a comparable peak signal-to-noise ratio (PSNR) and computational complexity with that of ITU-T H.263/TMN5, the reconstructed video frames of the proposed coder are free of annoying blocking artifacts, and hence visually much more pleasant. The computer simulation are conducted to show the feasibility and effectiveness of the algorithm. Results at 11 kbps are presented which can be used for videophone applications in the existing public switched telephone network (PSTN). © 1998 John Wiley & Sons, Inc. Int J Imaging Syst Technol, 9, 230–237, 1998     

A MV-Based Steganographic Algorithm for H.264/AVC without Distortion

H.264/AVC video is one of the most popular multimedia and has been widely used as the carriers of video steganography. In this paper, a novel motion vector (MV) based steganographic algorithm is proposed for the H.264/AVC compressed video without distortion. Four modules are introduced to eliminate the distortion caused by the modifications of motion vectors and guarantee the security of the algorithm. In the embedding block, the motion vector space encoding is used to embed a (2n+1)-ary notational number into an n-dimension vector composed of motion vectors generated from the selection block. Scrambling is adopted to disturb the order of steganographic carriers to improve the randomness of the carrier before the operation of embedding. The re-motion compensation (re-MC) block will re-construct the macroblock (MB) whose motion vectors have been modified by embedding block. System block plays the role of the generator for chaotic sequences and encryptor for secret data. Experimental results demonstrate that our proposed algorithm can achieve high embedding capacity without stego video visual quality distortion, it also presents good undetectability for existing MV-based steganalysis feature. Performance comparisons with other existing algorithms are provided to demonstrate the superiority of the proposed algorithm.     

Objective analysis and bit rate analysis of HEVC compressed 4D-fMRI images

Medical imaging and clinical diagnostics are complementary to one another since their analysis is typical and contains critical information. The growing volume of data has become one of the biggest challenges, as the acquisition of medical modalities is currently having high resolution from the improved and efficient machines (3 to 7 T or more). Moreover, image and video compression is a need with the consideration that there should not be any gap for losing the important information. Less bitrate requirement with high compression ratio without sacrificing important detail is a challenge these days. The current study, is dealing with the compression of 4D-functional medical resonance images (fMRI) with a codec, that is, high-efficient video coding (HEVC/H.265) and its objective analysis along with its predecessor that is advanced video coding (AVC/H.264) and with VP8 (WebM Project of Google) reported here. Further, the bit rate analysis that has been conducted, also accounts in conjunction with the bitrate investigation, which is an imperative perspective vital for the telemedicine field. The simulation results reported here represents the compression ratio (CR = 118.23:1) with HEVC/H.265 codec over the compression ratio (CR = 20.52:1) provided by AVC/H.264 and VP8 (CR = 78.29:1). There has been significant improvement observed in alignment of the peak signal-to-noise ratio (APSNR), structural similarity (SSIM), and mean squared error (MSE) metrics. Overall, the performance of the anticipated technique is satisfactory for the forthcoming telemedicine or clinical use.     

H.264/AVC baseline profile to MPEG‐4 visual simple profile transcoding to reduce the spatial resolution

In this study, we propose a heterogeneous transcoding method of converting an H.264/Advanced video coding (AVC) Baseline profile (BP) video bitstream into an MPEG‐4 Visual simple profile (VSP) video bitstream. The proposed method reduces the spatial resolution for mobile terminals, which support only low resolution video bitstreams. When the H.264/AVC BP video bitstream is transformed into the MPEG‐4 VSP video bitstream, the conversions between the H.264/AVC BP block types and the MPEG‐4 VSP block types are performed by analyzing the macroblocks (MBs) conversion probability and calculating the difference values of motion vector. The proposed transcoding method runs on average 5.5 times faster than the cascaded transcoding methods, for a degradation of the PSNR (peak‐signal‐to ratio) of less than 0.5 dB. © 2006 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 16, 24–33, 2006     

Fast intra prediction mode decision for H.264/AVC video coding

Abstract

Intra coding is used for reducing the spatial redundancy in video coding. H.264 supports several macroblocks of predictions for intra coding such as luma block four 16×16 modes, nine 4×4 modes and chroma block four modes, which significantly improve intra coding efficiency, but increase the encoding complexity. In order to select the best mode, we need to calculate the cost of the various modes. In this paper, a fast intra prediction mode decision for H.264/AVC video coding is proposed. Based on Laplacian, this intra prediction mode decision detects edges and selects the best mode for the block. This mode decision can shorten the time to reduce the encoding time. The experimental results show that the proposed algorithm achieves an encoding time saving of 70% on average.     

A probabilistic approach for video stabilisation in compressed domain

Machine vision systems, which are being extensively used for intelligent transportation applications, such as traffic monitoring and automatic navigation, suffer from image instability caused by environment unstable conditions. On the other hand, by increasing the use of home video cameras which sometimes need to remove unwanted camera movement, which is created by cameraman shaking hands, video stabilisation algorithms are being considered. The video stabilisation process consists of three essential phases: global motion estimation, intentional motion estimation and motion compensation. Motion estimation process is the main time consuming part of global motion estimation phase. Using motion vectors extracted directly from MPEG compressed video, instead of any other special feature, can increase the algorithm generality. In addition, it provides the facility for integrating video stabilisation and video compression subsystems and removing the block matching phase from video stabilisation procedure. Elimination of any iterative outlier removal preprocessing and adaptive selection of motion vectors has increased speed of the algorithm. Although deterministic approaches are faster than the related probabilistic methods, they have essential problems in escaping from local optima. For this purpose, particle filters, the ability of which is considerable when submitted to non-linear systems with non-Gaussian noises, are utilised. Setting the parameters of the particle filter using a fuzzy control system reduces the incorrect intentional camera motion removal. The proposed method is simulated and applied to video stabilisation problem and its high performance on various video sequences is demonstrated.