一种基于预测模式的H.264/AVC视频信息隐藏改进算法

提出了一种基于帧内预测模式调制的H.264/AVC视频信息改进隐藏算法.选择参考像素亮度值接近的帧内4×4块,通过对预测模式值进行调制以实现隐秘信息的嵌入,而预测模式调制过程是将最优预测模式变为满足嵌入条件的具有率失真开销最小的预测模式,以尽量减小预测模式的改变对视频客观质量的影响.信息的提取过程不需要原始载体视频,也...     

一种多视点视频编码的宏块模式快速选择新算法

分析了多视点视频编码中宏块模式的选择情况,提出了顺序可选宏块模式集的概念.比较分析了率失真代价最优宏块模式和最省时间可选宏块模式的搜索过程,讨论了编码宏块模式为最省时间可选宏块模式对率失真性能的影响,并在此基础上提出了基于顺序可选宏块模式集的快速宏块模式选择算法.实验结果表明,所提出算法在基本保持率失真性能的情况下,能明显降低宏块模式选择的复杂度,编码速度比多视点视频编码校验模型提高3.2倍到5.8倍.     

基于视频数字水印的信息隐藏技术研究

本文提出一种基于视频数字水印的信息隐藏技术.原始信息经过扩频调制之后,生成水印信息;同时,每个视频帧经分块DCT变换之后,嵌入水印位;考虑到含水印视频帧再水印提取过程中的同步问题,在嵌入水印信息的过程中也嵌入了同步模板以抵抗可能的视频帧的几何失真,实验结果表明,本文提出的算法是可行的.     

H.264编码模式选择的研究

研究H.264的编码模式选择方案,根据视频序列的时域相关性和空域相关性的关系,模式选择包括帧内预测和帧间预测,帧间预测基于率失真函数,在一帧图像的编码中则可以采用提前终止预测方向的方法降低编码器端的复杂度.     

基于Cauchy分布的H.264优化比特分配及码率控制算法

为了提高图像质量和码率控制精度,提出了一种H.264优化比特分配及码率控制算法.该算法首先基于Cauchy分布得出简化的宏块层码率模型,并引入复杂度系数MAD和头信息比特率,使码率模型可随视频内容复杂伸缩;同时采用线性模型对失真度进行预测,通过Lagrange率失真优化来选择每个宏块的量化参数,最小化整帧的失真度以实现宏块层的优化比特分配.实验结果表明,该算法能在降低比特数估计偏差、更好地跟踪目标码率的情况下,获得更好的PSNR性能.     

H.264帧内预测与帧间块模式选择快速算法

针对H.264帧间预测时的多子块模式选择和帧内预测的多模式选择问题,提出了一种实用的基于统计门限的模式快速选择算法,通过门限设定有效限定了编码模式的选择范围.多组视频序列的实验结果表明,基于统计门限的帧内预测模式选择算法在Ⅰ帧的PSNR值有微小变化的情况下,大大降低了编码时间,Ⅰ帧的编码时间降低17%～23%,PSNR下降不到0.4%.基于统计门限的帧间块模式选择算法使得平均PSNR值下降了0.047dB(PSNR最大下降不到1%),但是相对全模式预测时,编码器速度提高了20%～30%.     

一种降低外存访问带宽占有率的无损压缩算法

高清、超高清视频编解码芯片结构设计中,原始图像帧和解码图像参考帧都存在外部存储器,外存访问带宽是系统设计的一大难题.通过图像压缩编码技术来降低图像冗余度,从而减小图像的存储容量和传输带宽.针对这一问题,提出了一种改进型无损图像压缩算法.与已有无损压缩算法相比,改进后算法以宏块为预测编码的基本单元,支持宏块随机访问;首先在预测部分加入块级预测与分层预测的自适应选择;然后在编码部分融入两种预测模式的半定长变长编码.实验结果表明,可降低带宽约50%.     

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

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

基于二项式R-D模型的多视点视频码率控制算法

针对目前尚未深入研究多视点视频编码(MVC)码率控制的状况,在分析现有视频码率控制中率失真模型的不足和多视点视频编码的特点的基础上,提出了一种基于二次率失真(R-D)模型的多视点视频编码码率控制算法。该算法的核心是先根据视差预测和运动预测的结构关系,将所有图像分成6种类型的编码帧,并改进二项式率失真模型,然后根据已编码信息进行视点间、帧层、基本单元层比特分配与码率控制。实验仿真结果表明,与目前采用固定量化参数的JVT的MVC相比,该算法能够有效地控制多视点视频编码的码率,同时保持高效的编码效率。     

回归分析建模的自适应SKIP模式预选算法

SKIP模式在最佳编码模式中占相当大的比例.SKIP模式预选可以有效减少模式选择的计算复杂度.在现有的SKIP模式预选算法中,该阈值往往不能和视频内容自适应.用回归分析建模的思路,提出了一种内容自适应的SKIP模式预选算法(CASMED),通过一个能够反映当前编码宏块特性的变量来自适应地对阈值模型进行调整.结果证明,该算法在编码性能损耗几乎为零的情况下,大大降低了模式选择算法的复杂度.     

Reversible Data Hiding Based on Run-Level Coding in H.264/AVC Video Streams

This paper presents a reversible data hiding (RDH) method, which is designed by combining histogram modification (HM) with run-level coding in H.264/advanced video coding (AVC). In this scheme, the run-level is changed for embedding data into H.264/AVC video sequences. In order to guarantee the reversibility of the proposed scheme, the last nonzero quantized discrete cosine transform (DCT) coefficients in embeddable 4×4 blocks are shifted by the technology of histogram modification. The proposed scheme is realized after quantization and before entropy coding of H.264/AVC compression standard. Therefore, the embedded information can be correctly extracted at the decoding side. Peak-signal-noise-to-ratio (PSNR) and Structure similarity index (SSIM), embedding payload and bit-rate variation are exploited to measure the performance of the proposed scheme. Experimental results have shown that the proposed scheme leads to less SSIM variation and bit-rate increase.     

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.     

Fast mode decision based on systematic deployment of predictive resources for H.264/AVC

Abstract

This paper presents a well organised fast mode decision scheme for H.264/AVC that systematically integrates and deploys applicable predictive resources using constructive compromise. This scheme is constructed by primary SKIP mode checking, spatial prior temporal hard decision (STHD), and succinct mode decision (SMD). The STHD is connected with the predictive macroblocks searched. In STHD, only when spatial hard decision fails, temporal hard decision is performed using the potential partition characteristic vector (PPCV) addressed. If it fails, too, then SMD takes care of mode checking also using PPCV. The SMD consists of succinct P16?×?16 mode decision and succinct geometric/statistical extension examination, which are formed as an effective two-stage judgment. Extensive experimental results demonstrate that the proposed method by systematically deploying the predictive resources can achieve 58–74% runtime savings in encoding QCIF, CIF and high definition videos with low performance losses. In addition, most processes of the proposed scheme could be implemented on logical operations, only.     

A fast distance-based mode decision algorithm for 4×4 blocks in H.264/AVC intra prediction

H.264/AVC employs rate-distortion optimisation technique to achieve high coding efficiency, but it is computing-intensive. This letter presents a fast distance-based mode decision algorithm for 4×4 blocks in H.264/AVC intra prediction. Firstly, the distance between neighbouring blocks of the current block is defined. Then, the modes around up and left modes are selected as the candidate modes if the distance is small, otherwise early termination technique is used to further reduce the complexity, and either four or more modes are chosen based on the difference of rate-distortion optimisation cost. Experimental results show that our proposed algorithm can predict a 4×4 intra block by only about 3·52 modes and reduce the total encoding time by about 31·37% with negligible peak signal-to-noise ratio decrement and bit rate increment.     

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.     

Intra mode selection in downsizing video transcoder based on H.264

An intra mode selection scheme is proposed in this work, which supports both downsizing transcoding and re‐quantization transcoding simultaneously. In the proposal, a total number of nonzero coefficients in precoded frame is used as criterion and a thresholding method is applied to select intra macroblock mode in re‐encoder. To calculate this threshold, which is related to re‐quantization parameter (denoted as Q_r), we propose a Th_I‐Q_r model which includes direct method and percentage I16MB method. In the former, an exponent model is proposed to describe relationship between the threshold and the Q_r; while in the latter, the threshold Th_I is converted into percentage of macroblocks with I16MB mode in the downsized frame (denoted as per_16), and relationship between the per_16 and the Q_r is also modeled as an exponent function. Then the two exponent models are all converted into linear regression model, and least square estimation is used to estimate the parameters of the models. Furthermore, if I4MB mode is selected for one macroblock, the intra prediction modes in precoded frame are utilized to select prediction mode for every 4 × 4 block of the macroblock in downsized frame to reduce computational complexity. We compared rate distortion performance and computational complexity of the proposed method with rate‐distortion optimization method. Simulation results demonstrate that on the precondition of compression performance of the proposal being close to the results of the rate‐distortion optimization method, the proposed method can save up to 30 and 80% in total encoding time and mode decision time, respectively. © 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 340–349, 2009     

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     

Optimal Mode Decision Method for Interframe Prediction in H.264/AVC

Studies show that encoding technologies in H.264/AVC, including prediction and conversion, are essential technologies. However, these technologies are more complicated than the MPEG-4, which is a standard method and widely adopted worldwide. Therefore, the amount of calculation in H.264/AVC is significantly up-regulated compared to that of the MPEG-4. In the present study, it is intended to simplify the computational expenses in the international standard compression coding system H.264/AVC for moving images. Inter prediction refers to the most feasible compression technology, taking up to 60% of the entire encoding. In this regard, prediction error and motion vector information are proposed to simplify the computation of inter predictive coding technology. In the initial frame, motion compensation is performed in all target modes and then basic information is collected and analyzed. After the initial frame, motion compensation is performed only in the middle 8×8 modes, and the basic information amount shifts. In order to evaluate the effectiveness of the proposed method and assess the motion image compression coding, four types of motion images, defined by the international telecommunication union (ITU), are employed. Based on the obtained results, it is concluded that the developed method is capable of simplifying the calculation, while it is slightly affected by the inferior image quality and the amount of information.     

Reversible Data Hiding in Encrypted Image Based on Block Classification Permutation

Recently, reversible data hiding in encrypted image (RDHEI) has attracted extensive attention, which can be used in secure cloud computing and privacy protection effectively. In this paper, a novel RDHEI scheme based on block classification and permutation is proposed. Content owner first divides original image into non-overlapping blocks and then set a threshold to classify these blocks into smooth and non-smooth blocks respectively. After block classification, content owner utilizes a specific encryption method, including stream cipher encryption and block permutation to protect image content securely. For the encrypted image, data hider embeds additional secret information in the most significant bits (MSB) of the encrypted pixels in smooth blocks and the final marked image can be obtained. At the receiver side, secret data will be extracted correctly with data-hiding key. When receiver only has encryption key, after stream cipher decryption, block scrambling decryption and MSB error prediction with threshold, decrypted image will be achieved. When data hiding key and encryption key are both obtained, receiver can find the smooth and non-smooth blocks correctly and MSB in smooth blocks will be predicted correctly, hence, receiver can recover marked image losslessly. Experimental results demonstrate that our scheme can achieve better rate-distortion performance than some of state-of-the-art schemes.     

Secret image transmission based on VQ and data embedding

A new secret image transmission scheme suitable for narrow communication channel is proposed in this article. A set of secret images can be simultaneously and efficiently delivered to the receiver via a small and meaningless data stream by the proposed scheme. To reduce the volume of secret images, a codebook is first generated and these secret images are encoded into binary indexes based on the vector quantization (VQ) technique. The compressed message is then embedded into the VQ codebook utilized in the encoding procedure by an adaptive least‐significant‐bits (LSB) modification technique. For the purpose of security, the slightly modified codebook is further encrypted into a meaningless data stream by the AES cryptosystem. Simulation results show that the proposed scheme provides an impressive improvement both in the visual quality of the extracted secret images at the receiver and in the hiding capacity of the cover medium. Experimental data also reveal the feasibility of the proposed secret image transmission scheme for limited‐bandwidth environment. © 2007 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 17, 1–9, 2007