The dropping off of data during information transmission and the storage device’s damage etc.often leads the sampled data to be non-uniform.The paper, based on the stability theory of irregular wavelet frame and the ...The dropping off of data during information transmission and the storage device’s damage etc.often leads the sampled data to be non-uniform.The paper, based on the stability theory of irregular wavelet frame and the irregular weighted wavelet frame operator,proposed an irregular weighted wavelet fame conjugate gradient iterative algorithm for the reconstruction of non-uniformly sampling signal. Compared the experiment results with the iterative algorithm of the Ref.[5],the new algorithm has remarkable advantages in approximation error,running time and so on.展开更多
Aiming at the problem of video key frame extraction, a density peak clustering algorithm is proposed, which uses the HSV histogram to transform high-dimensional abstract video image data into quantifiable low-dimensio...Aiming at the problem of video key frame extraction, a density peak clustering algorithm is proposed, which uses the HSV histogram to transform high-dimensional abstract video image data into quantifiable low-dimensional data, and reduces the computational complexity while capturing image features. On this basis, the density peak clustering algorithm is used to cluster these low-dimensional data and find the cluster centers. Combining the clustering results, the final key frames are obtained. A large number of key frame extraction experiments for different types of videos show that the algorithm can extract different number of key frames by combining video content, overcome the shortcoming of traditional key frame extraction algorithm which can only extract a fixed number of key frames, and the extracted key frames can represent the main content of video accurately.展开更多
In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary...In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary codingatthebeginning of the coding;we use multi-point crossoverto replace the originalsingle-point crossoveroperation.Finally, theexperimentshows that the improved genetic algorithmnot only has a strong search capability, but also thestability has been effectively improved.展开更多
为了提升高效视频编码(High Efficiency Video Coding,HEVC)帧内编码的实时性能,本文提出的方法利用了引入偶数边长与步长的卷积核以及自注意力机制的轻量级卷积网络来预测编码树单元(Coding Tree Unit,CTU)的帧内划分结构,从而减少了...为了提升高效视频编码(High Efficiency Video Coding,HEVC)帧内编码的实时性能,本文提出的方法利用了引入偶数边长与步长的卷积核以及自注意力机制的轻量级卷积网络来预测编码树单元(Coding Tree Unit,CTU)的帧内划分结构,从而减少了编码器对CTU进行四叉树递归遍历划分的编码时间。原始编码策略中粗模式决策通过基于残差经哈德曼变换的预测残差绝对值总和(Sum of Absolute Transformed Difference,SATD)的损失值来估计率失真优化过程中的率失真损失值来进行加速,但仍会耗费一定的编码时间。提出一种方法通过采样搜索的方式减少粗模式决策过程中计算的模式数,从35种模式降低到了18种模式,降低了粗模式决策过程中计算估计损失值的时间。由粗模式决策过程得到的较优的多个候选帧内模式来进行率失真优化,为了缩减粗模式决策需要计算的候选模式数,在候选模式列表中根据前后帧内预测角度模式的估计损失值的差距来筛选掉部分可能性较低的候选模式实现早停止决策,从而减少需要进行率失真优化的候选模式数量,进而减少率失真优化过程的计算时间。本文提出的算法在测试序列上平均实现78.15%的编码时间缩减,BD-PSNR为-0.168 d B,BD-RATE为3.49%。展开更多
为了面向低延时的浅压缩场景提供更加适配的编码方案,并降低硬件实现成本,提出一种基于数字音视频编解码技术标准(Audio Video coding Standard,AVS)浅压缩算法的帧内预测模式优化以及快速率失真优化算法。该算法通过减少原有算法帧内...为了面向低延时的浅压缩场景提供更加适配的编码方案,并降低硬件实现成本,提出一种基于数字音视频编解码技术标准(Audio Video coding Standard,AVS)浅压缩算法的帧内预测模式优化以及快速率失真优化算法。该算法通过减少原有算法帧内预测所需的预测循环次数,以及打破各块之间的数据依赖关系等措施,克服了原始方案不适合硬件流水并行处理的限制,提高了编码的效率和稳定性,从而既保障了算法的视频质量,又使新的硬件实现方案更符合实际应用需求。实验结果表明,该算法优化方案能够有效改善实际面向低延时浅压缩场景下的编码效果。展开更多
基金supported by Hunan Education Office Foundation under Grant 06C260
文摘The dropping off of data during information transmission and the storage device’s damage etc.often leads the sampled data to be non-uniform.The paper, based on the stability theory of irregular wavelet frame and the irregular weighted wavelet frame operator,proposed an irregular weighted wavelet fame conjugate gradient iterative algorithm for the reconstruction of non-uniformly sampling signal. Compared the experiment results with the iterative algorithm of the Ref.[5],the new algorithm has remarkable advantages in approximation error,running time and so on.
文摘Aiming at the problem of video key frame extraction, a density peak clustering algorithm is proposed, which uses the HSV histogram to transform high-dimensional abstract video image data into quantifiable low-dimensional data, and reduces the computational complexity while capturing image features. On this basis, the density peak clustering algorithm is used to cluster these low-dimensional data and find the cluster centers. Combining the clustering results, the final key frames are obtained. A large number of key frame extraction experiments for different types of videos show that the algorithm can extract different number of key frames by combining video content, overcome the shortcoming of traditional key frame extraction algorithm which can only extract a fixed number of key frames, and the extracted key frames can represent the main content of video accurately.
文摘In order toovercomethe poor local search ability of genetic algorithm, resulting in the basic genetic algorithm is time-consuming, and low search abilityin the late evolutionary, we use thegray coding instead ofbinary codingatthebeginning of the coding;we use multi-point crossoverto replace the originalsingle-point crossoveroperation.Finally, theexperimentshows that the improved genetic algorithmnot only has a strong search capability, but also thestability has been effectively improved.
文摘为了提升高效视频编码(High Efficiency Video Coding,HEVC)帧内编码的实时性能,本文提出的方法利用了引入偶数边长与步长的卷积核以及自注意力机制的轻量级卷积网络来预测编码树单元(Coding Tree Unit,CTU)的帧内划分结构,从而减少了编码器对CTU进行四叉树递归遍历划分的编码时间。原始编码策略中粗模式决策通过基于残差经哈德曼变换的预测残差绝对值总和(Sum of Absolute Transformed Difference,SATD)的损失值来估计率失真优化过程中的率失真损失值来进行加速,但仍会耗费一定的编码时间。提出一种方法通过采样搜索的方式减少粗模式决策过程中计算的模式数,从35种模式降低到了18种模式,降低了粗模式决策过程中计算估计损失值的时间。由粗模式决策过程得到的较优的多个候选帧内模式来进行率失真优化,为了缩减粗模式决策需要计算的候选模式数,在候选模式列表中根据前后帧内预测角度模式的估计损失值的差距来筛选掉部分可能性较低的候选模式实现早停止决策,从而减少需要进行率失真优化的候选模式数量,进而减少率失真优化过程的计算时间。本文提出的算法在测试序列上平均实现78.15%的编码时间缩减,BD-PSNR为-0.168 d B,BD-RATE为3.49%。
文摘为了面向低延时的浅压缩场景提供更加适配的编码方案,并降低硬件实现成本,提出一种基于数字音视频编解码技术标准(Audio Video coding Standard,AVS)浅压缩算法的帧内预测模式优化以及快速率失真优化算法。该算法通过减少原有算法帧内预测所需的预测循环次数,以及打破各块之间的数据依赖关系等措施,克服了原始方案不适合硬件流水并行处理的限制,提高了编码的效率和稳定性,从而既保障了算法的视频质量,又使新的硬件实现方案更符合实际应用需求。实验结果表明,该算法优化方案能够有效改善实际面向低延时浅压缩场景下的编码效果。
