共查询到18条相似文献,搜索用时 46 毫秒
1.
H.264快速帧间编码模式选择算法 总被引:1,自引:0,他引:1
本文提出了一种用于H.264编码的快速帧间编码模式选择算法.这种算法有效地减少了原图像编码过程中待测编码模式的数量,从而提高了编码速度. 相似文献
2.
H.264快速帧间编码模式选择算法 总被引:2,自引:0,他引:2
本文提出了一种用于H.264编码的快速帧间编码模式选择算法。首先对低分辨率缩略图进行编码和R-D优化,选出该分辨率下帧间编码宏块中每个8x8块使用的最优帧间编码模式,然后将该模式映射为原始分辨率图像中对应16x16宏块的候选帧间编码模式子集,最后用通常的R-D优化方式从中选出原始分辨率下的最优模式。这种算法有效地减少了原图像编码过程中待测编码模式的数量,从而提高了编码速度。测试表明,此算法能够使编码速度提高将近一倍,同时码率增加不超过3%,PSNR下降不超过0.2dB。 相似文献
3.
4.
5.
快速帧内预测模式选择新方法 总被引:10,自引:4,他引:10
为了提高编码性能,H.264采用了RDO(率失真优化),但与此同时带来的是计算复杂度的增加.本文着重分析了H.264中快速帧内预测模式选择的问题.为了降低帧内预测模式选择的计算复杂度,提出了一种高效的快速帧内预测模式选择算法.首先,对Pan的基于边缘方向直方图的快速算法进行了改进,同时提出了基于参考象素特征的4×4快速帧内预测模式选择算法,并将两者进行了结合.实验结果表明,本文算法和H.264校验模型JM61相比,I帧编码时间降低61%~69%,而PSNR基本保持不变,输出码率仅略有增加;与Pan的基于边缘方向直方图快速算法相比,本文算法的I帧编码时间降低12%~33%,PSNR和输出码率均基本保持不变. 相似文献
6.
7.
8.
一种HEVC帧内预测编码CU结构快速选择算法 总被引:2,自引:2,他引:0
为了提升高效视频编码(HEVC) 帧内预测编码部分的编码效率,提出了一种HEVC帧内预测编码编码单元(CU)结构快速选择算 法。算法通过 对CTU(coding tree unit)四叉树结构的遍历过程进行优化,设计了两种不同的最优CU结 构快速决策算 法,分别从最大划分深度和最小划分深度开始遍历,并在每一步遍历之前,判断是否提前终 止遍历操作。 同时,在对每个CTU进行求解时,依据其纹理复杂度和当前编码状态,从两种算法中选择出 最优快速决策 算法对其进行求解。在HM 15.0的基础上实现了提出的快速选择算法 。实验结果表明,本文算法能够在 保证编码性能的同时,降低31.14%的编码时间,提高了HEVC的编码效 率。 相似文献
9.
高性能视频编码(HEVC)是刚确立的最新一代的视频编码标准。对于帧内编码,HEVC最大的特点是采用了从64×64至8×8的编码单元划分和35种帧内预测模式,HEVC通过遍历所有的分块和帧内预测模式,选取最优的预测方式,这种帧内预测方式在提高预测精度的同时也大大增加了编码的计算复杂度。为了降低帧内预测的计算复杂度,HM2.0版以上的HEVC测试软件采用一种基于两步预测的快速帧内模式选择算法。在此基础上本文首先提出了一种基于纹理方向的快速粗选方案,减少参与计算的粗选模式数,进而提出基于结构相关的决策方法,利用同质图像区域的纹理相似性,减少参与率失真代价函数计算的候选模式数量,进一步降低了帧内预测计算复杂度。实验结果表明,本文所提出的快速算法,在保持编码质量基本不变的条件下,可以使基于两步预测的快速帧内模式选择时间缩短25%。 相似文献
10.
11.
12.
为了降低高效视频编码(HEVC)的复杂度,提出了一种基于纹理方向和空域相关性的帧内快速编码算法。一方面,利用相邻编码单元(CU,coding unit)的最佳分割尺寸确定相关性的权重,并根据已编码CU的率失真代价值定义了CU分割尺寸的相关性因子,通过比较该因子提前终止CU分割;另一方面,利用Sobel算子求取预测单元(PU,prediction unit)子块的纹理方向,通过判定其纹理方向显著性确定相应的候选模式集,然后根据PU大小对所得的预测模式修正处理,最后遍历这些候选模式选取最优模式。实验结果表明:本文算法相对于原始HEVC编码方法,在全I帧模式下编码时间平均减少36.84%,BDBR(Bjntegaard delta bit rate)上升约0.81%,BDPSNR(Bjntegaard delta peak signal-to-noise rate)降低了0.047dB。 相似文献
13.
本文提出了一种结合内容特性与纹理类型的HEVC-SCC帧内预测快速算法。利用自然内容和屏幕内容视频DCT变换后系数能量分布不同的特点,结合当前预测单元(Prediction Unit, PU)梯度信息,将编码树单元(Coding Tree Unit, CTU)分成自然内容CTU,简单屏幕内容CTU和复杂屏幕内容CTU。对于自然内容CTU,选择35种传统帧内模式作为候选模式,跳过帧内块复制(Intra Block Copy, IBC)和调色板(Palette mode, PLT)模式;对于简单屏幕内容CTU,选择DC,PLANAR,水平和垂直模式作为候选模式,跳过IBC和PLT模式;对于复杂屏幕内容CTU,选择IBC和PLT模式,跳过其他候选模式。实验结果表明,在全I帧条件下,该算法相较于SCM-8.3可以节省38.55%的编码时间,大幅度降低了编码复杂度的同时只增加了1.82%的码率。 相似文献
14.
ADVANCES IN FRACTAL IMAGE AND VIDEO CODING 总被引:1,自引:0,他引:1
O.C.Au L.K.Ma M.LLiou 《电路与系统学报》1996,1(1):6-18
Fraotal coding is a very promising technique for image compression. However, it has not been widely used because of its high computational complexity, In this paper, techniques for reducing computational complexity of fractal coding are presented. Fractal coding is very effective for images containing sharp edges and smooth textures of large objects but not for small objects and fine details. In this paper, methods to improve overall image quality are presented. Also in this paper, approaches for applying fractal coding to very low bit-rate video as well as VLSI implementations for real-time applications are discussed. 相似文献
15.
针对屏幕内容视频具有大量文字、图形区域以及锐利边缘的特点,本文在HEVC-SCC编码标准上提出一种结合时空梯度感知特征的HEVC-SCC码率控制算法。考虑把有效的码率用在对于人眼视觉系统更加敏感的特性上,本算法主要从空域和时域两方面进行屏幕内容视频感知特性的提取。在空域方面,采用差分算子提取梯度幅值信息,得到空域特征的描述子;在时域方面,采用可以较好描述屏幕内容视频感知特征的梯度相似性度量信息,结合相邻帧间的相关性,得到时域特征的描述子。将时空梯度感知特性进行融合,用以控制屏幕内容视频编码的码率。实验结果表明,在随机接入模式下,本算法和原始HEVC-SCC算法相比,在略微降低误码率、节省码率开销的同时提高了视频的感知质量。 相似文献
16.
In this paper, a threshold bounded antenna selection scheduler (TBS) and a computational complexity bounded antenna selection scheduler (CCBS) are proposed to reduce computational complexity in multiple input multiple output (MIMO) uplink. In contrast to previous works, a spatially correlated MIMO channel model is considered and a transmitter correlation value (TCV) is newly introduced to assist the antenna selection in addition to the channel gain. For the TBS or CCBS, with predetermined threshold of TCV or ratio of successful antennas (RSAs), full searching (FS) and sub searching (SS) are applied more efficiently to user equipments (UEs) compared with previous schedulers. As a result, the number of candidate antennas in the scheduling set can be reduced, which translates into a lower computational complexity in terms of number of evaluated antenna combinations. Additionally, compared with the TBS, the peak computational complexity can be further reduced by the CCBS. Simulation results show that with proposed schedulers the computational complexity can be reduced by at least 50% with an acceptable compromise of capacity. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
17.
In High Efficiency Video Coding, the Residual Quad-Yree (RQT) coding is used to encode the prediction residual for both intra and inter Coding Units (CU) and provides improved coding gains. However, this results in much higher computational complexities. To address this problem, we develop two fast RQT algorithms for intra- and inter-prediction residual coding respectively. For intra coding, the proposed algorithm selects the best prediction mode in the rate distortion mode decision process using a Prediction Unit (PU) size-dependent fast RQT depth decision on a reduced prediction mode candidates set from the rough mode decision process. For inter coding, in addition to CU size-dependent fast RQT depth decisions, we propose a discriminant analy- sis-based fast depth decision algorithm to det- ermine the best transform unit size. Experimental results show that on average, we can real- ise a 21.29% encoding time saving and 0.03% bit-rate reduction for intra coding, while 15% of the encoding time can be saved with a negligible coding performance loss for inter coding. 相似文献
18.
Wang Jing Chi Kaikai Wang Xinmei School of Information Engineering Chang’an University Xi’an China College of Computer Science Technology Zhejiang University of Technology Hangzhou China State Key Lab. of Integrated Service Networks Xidian University Xi’an China 《中国通信》2010,7(2):71-77
Recently, network coding has been applied to the loss recovery of reliable broadcast transmission in wireless networks. Since it was proved that fi nding the optimal set of lost packets for XOR-ing is a complex NP-complete problem, the available time-based retransmission scheme and its enhanced retransmission scheme have exponential computational complexity and thus are not scalable to large networks. In this paper, we present an efficient heuristic scheme based on hypergraph coloring and also its enhanced ... 相似文献