A new no-reference blocking artifact metric for B-DCT compression video is presented in this paper. We first present a new definition of blocking artifact and a new method for measuring perceptive blocking artifact ba...A new no-reference blocking artifact metric for B-DCT compression video is presented in this paper. We first present a new definition of blocking artifact and a new method for measuring perceptive blocking artifact based on HVS taking into account the luminance masking and activity masking characteristic. Then, we propose a new concept of blocking artifact cluster and the algorithm for clustering blocking artifacts. Considering eye movement and fixation, we select several clusters with most serious blocking artifacts and utilize the average of their blocking artifacts to assess the total blocking artifact of B-DCT reconstructed video. Experimental results illustrating the performance of the proposed method are presented and evaluated.展开更多
This paper proposed a back propagation neural network model for predictive block-matching. Predictive block-matching is a way to significantly decrease the computational complexity of motion estimation, but the tradit...This paper proposed a back propagation neural network model for predictive block-matching. Predictive block-matching is a way to significantly decrease the computational complexity of motion estimation, but the traditional prediction model was proposed 26 years ago. It is straight forward but not accurate enough. The proposed back propagation neural network has 5 inputs, 5 neutrons and 1 output. Because of its simplicity, it requires very little calculation power which is negligible compared with existing computation complexity. The test results show 10% - 30% higher prediction accuracy and PSNR improvement up to 0.3 dB. The above advantages make it a feasible replacement of the current model.展开更多
A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to...A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.展开更多
The new features of H. 264 video coding standard make the motion estimation module much more time consuming than before. Especially, the motion search is required for each of the 4 modes for inter prediction. In order...The new features of H. 264 video coding standard make the motion estimation module much more time consuming than before. Especially, the motion search is required for each of the 4 modes for inter prediction. In order to reduce the computational complexity, we analyze the statistics of results of motion estimation, such as the continuity of best modes of blocks in successive frames and the chance to give up a sub-partition mode （smaller than 16 × 16） after integer-pixel motion estimation, from which we suggest to make mode prediction based on the motion information of the previous frame and skip sub-pixel motion estimation in subpartition mode selectively. According to the experimental result, the proposed algorithm can save 75 % of the computational time with a slight degradation （0.03 dB） on PSNR compared with the pseudocode of fast search motion estimation in JM12.2.展开更多
针对等矩柱状投影(equirectangular projection,ERP)全景视频多功能视频编码(versatile video coding,VVC)帧内编码复杂度过高的问题,提出一种编码单元(coding unit,CU)快速划分算法。根据ERP采样特性,将编码帧分为不同纬度区域。基于...针对等矩柱状投影(equirectangular projection,ERP)全景视频多功能视频编码(versatile video coding,VVC)帧内编码复杂度过高的问题,提出一种编码单元(coding unit,CU)快速划分算法。根据ERP采样特性,将编码帧分为不同纬度区域。基于不同纬度区域CU四叉树深度的分布特性和相邻CU的相关性,对当前CU的划分模式进行提前终止决策;利用梯度差异评估当前CU纹理特性,跳过冗余的水平或垂直划分模式。针对纹理模糊CU,通过纬度采样权重加权的二次比较,判断是否跳过垂直划分模式;利用二维哈尔小波变换系数评估当前CU子块间的差异,判断是否跳过三叉树划分模式。实验结果表明,在全帧内模式下,与VVC官方测试平台相比,所提算法能节省43.85%的编码时间,码率仅增加0.85%,视频质量没有明显下降。展开更多
基金Project (No. YJCB2003017MU) supported by Huawei Technology Fund, China
文摘A new no-reference blocking artifact metric for B-DCT compression video is presented in this paper. We first present a new definition of blocking artifact and a new method for measuring perceptive blocking artifact based on HVS taking into account the luminance masking and activity masking characteristic. Then, we propose a new concept of blocking artifact cluster and the algorithm for clustering blocking artifacts. Considering eye movement and fixation, we select several clusters with most serious blocking artifacts and utilize the average of their blocking artifacts to assess the total blocking artifact of B-DCT reconstructed video. Experimental results illustrating the performance of the proposed method are presented and evaluated.
文摘This paper proposed a back propagation neural network model for predictive block-matching. Predictive block-matching is a way to significantly decrease the computational complexity of motion estimation, but the traditional prediction model was proposed 26 years ago. It is straight forward but not accurate enough. The proposed back propagation neural network has 5 inputs, 5 neutrons and 1 output. Because of its simplicity, it requires very little calculation power which is negligible compared with existing computation complexity. The test results show 10% - 30% higher prediction accuracy and PSNR improvement up to 0.3 dB. The above advantages make it a feasible replacement of the current model.
基金This project was supported by the National Natural Science Foundation of China (60272099) .
文摘A new faster block-matching algorithm （BMA） by using both search candidate and pixd sulzsamplings is proposed. Firstly a pixd-subsampling approach used in adjustable partial distortion search （APDS） is adjusted to visit about half points of all search candidates by subsampling them, using a spiral-scanning path with one skip. Two sdected candidates that have minimal and second minimal block distortion measures are obtained. Then a fine-tune step is taken around them to find the best one. Some analyses are given to approve the rationality of the approach of this paper. Experimental results show that, as compared to APDS, the proposed algorithm can enhance the block-matching speed by about 30% while maintaining its MSE performance very close to that of it. And it performs much better than many other BMAs such as TSS, NTSS, UCDBS and NPDS.
基金Sponsored by the National Natural Science Foundation of China(60772066)
文摘The new features of H. 264 video coding standard make the motion estimation module much more time consuming than before. Especially, the motion search is required for each of the 4 modes for inter prediction. In order to reduce the computational complexity, we analyze the statistics of results of motion estimation, such as the continuity of best modes of blocks in successive frames and the chance to give up a sub-partition mode （smaller than 16 × 16） after integer-pixel motion estimation, from which we suggest to make mode prediction based on the motion information of the previous frame and skip sub-pixel motion estimation in subpartition mode selectively. According to the experimental result, the proposed algorithm can save 75 % of the computational time with a slight degradation （0.03 dB） on PSNR compared with the pseudocode of fast search motion estimation in JM12.2.
文摘针对等矩柱状投影(equirectangular projection,ERP)全景视频多功能视频编码(versatile video coding,VVC)帧内编码复杂度过高的问题,提出一种编码单元(coding unit,CU)快速划分算法。根据ERP采样特性,将编码帧分为不同纬度区域。基于不同纬度区域CU四叉树深度的分布特性和相邻CU的相关性,对当前CU的划分模式进行提前终止决策;利用梯度差异评估当前CU纹理特性,跳过冗余的水平或垂直划分模式。针对纹理模糊CU,通过纬度采样权重加权的二次比较,判断是否跳过垂直划分模式;利用二维哈尔小波变换系数评估当前CU子块间的差异,判断是否跳过三叉树划分模式。实验结果表明,在全帧内模式下,与VVC官方测试平台相比,所提算法能节省43.85%的编码时间,码率仅增加0.85%,视频质量没有明显下降。
