视频分析技术的研究和应用

通过对视频分析关键技术的探讨及国内外研究小组科研成果的分析.揭示了视频编码技术、视频对象分割技术、基于内容检索技术、流媒体传输技术之间的内在联系以及各自的技术要点、难点.通过介绍视频分析技术在视频监控中的应用,展望了该技术在多个领域的广阔的应用前景.     

哈夫曼树的实现及其在文件压缩中的应用

在信息快速传输和存储的过程中,数据压缩有着非常重要的作用.介绍了基于哈夫曼树的文本压缩和解压缩的原理与方法,并给出了Huiffman压缩与解压程序核心算法的实现过程.     

Weight distribution and dual distance

Several results in coding theory (e.g. the Carlitz-Uchiyama bound) show that the weight distributions of certain algebraic codes of lengthn are concentrated aroundn/2 within a range of width n. It is proved in this article that the extreme weights of a linear binary code of sufficiently high dual distance cannot be too close ton/2, the gap being of order n. The tools used involve the Pless identities and the orthogonality properties of Krawtchouk polynomials, as well as estimates on their zeroes. As a by-product upper bounds on the minimum distance of self-dual binary codes are derived.     

Proofs of retrievability with tag outsourcing based on Goppa codes

In cloud storage, because the data owner loses the physical control of the data, the data may be tampered with or deleted. Although, it has been proposed to adopt provable data possession (PDP) or proofs of retrievability (POR) mechanism to ensure the integrity of cloud storage data. However, at present, most PDP/POR schemes are based on traditional cryptographic mechanisms and cannot resist quantum computer attacks. For this reason, the first POR scheme based on coding mechanism (BC-POR) is proposed in this paper. The scheme is constructed based on the difficulty assumptions of 2-regular word syndrome decoding (2-RWSD) problem and Goppa code distinguishing problem. Moreover, considering the low computing power of lightweight users, this paper adopts an audit scheme that supports the outsourcing of data tag calculation on the client side, that is, the calculation of data tag generation is outsourced to a third-party institution for execution. First of all, this scheme can prevent third-party institution from obtaining the real content of the data in the process of calculation tags and realize the privacy protection of user data. Secondly, the scheme uses a FSB hash function to generate a decodable syndrome, and this algorithm does not require iterative operations during the tagging process, thereby reducing the computational overhead of the tag. Finally, the provable security method is used to prove the security of the proposed scheme, and the performance of the proposed audit scheme is evaluated to prove the effectiveness of the scheme.     

Low complexity inter coding scheme for Versatile Video Coding (VVC)

The latest coding standard Versatile Video Coding (VVC) developed by the Joint Video Experts Team (JVET) and Video Coding Experts Group (VCEG) was finalized in 2020. By introducing several new coding techniques, VVC improves the compression efficiency by 50% compared with H.265/HEVC. However, the coding complexity increases dramatically, which obstructs it from real-time application. To tackle this issue, a fast inter coding algorithm utilizing coding information is proposed to speed up the coding process. First, by analyzing the coding areas of the neighboring CUs, we predict the coding area of the current CU to terminate unnecessary splitting modes. Then, the temporally optimal coding mode generated during the prediction process is further utilized to shrink the candidate modes to speed up the coding process. Finally, the distribution of neighboring prediction modes are exploited to measure the motion complexity of the current CU, based on which the unnecessary prediction modes can be skipped earlier. Experimental results demonstrate that the proposed method can reduce the coding complexity by 40.08% on average with 0.07 dB BDPSNR decrease and 1.56% BDBR increase, which outperforms the state-of-the-art approach.     

Improved inter-view correlations for low complexity MV-HEVC

The more advanced multi-view extension, MV-HEVC, effectively exploits visual similarities between multi-view videos and enables high compression efficiency. Each view in the multi-view sequence depends on the captured scene, the distance between cameras and recording angles. Increasing the distance between dependent viewpoints generates an inter-view disparity. This impacts the inter-view similarities, affects the disparity estimation and further increases the computational complexity of the MV-HEVC encoder. In this paper, an efficient earlier disparity estimation is proposed for low complexity MV-HEVC. This algorithm is based on reducing the complexity of disparity estimation by eliminating the inter-view offset. Moreover, the inter-view similarities are controlled by considering the reliability of each coding unit size in the search range. This reliability is estimated by reducing the number of searching points within a new limited window. For reliable motion estimation, we further proposed an earlier decision of coding units splitting in the dependent views according to those in the reference views. Experimental results show that the proposed algorithm can achieve an average encoding time saving of 20.37%–40,61% with marginal performance degradation.     

联合信源信道算术码研究

介绍联合信源信道算术码添加禁用符号的编码方法,以实例方式引入联合信源信道算术码的检错原理。综述联合信源信道算术码的检错时延分布、几何分布,分析各种解码方法、序列解码方法及其各种改进,研究基于有限状态机的解码方法与其他信道码构成的迭代式联合解码方法,并展望目前联合信源信道算术码研究存在的问题及其前景。     

基于BTC与秘密共享的图像水印算法

结合块截短编码与秘密共享,提出一种新的鲁棒图像水印算法。该算法利用BTC编码由原图像构建特征共享,利用水印图像与特征共享一起生成私有共享。由待验证图像构建的特征共享与私有共享一起恢复水印图像。私有共享的生成与特征共享有关,可实现对同一图像的多水印注册。特征共享的稳健性确保了算法的水印鲁棒性,水印嵌入没有引起图像质量的改变。实验结果表明该算法对一般信号处理攻击有较高的鲁棒性。     

感兴趣区域的非线性变换多描述编码

介绍一种基于感兴趣区域的非线性变换的多描述图像编码,能够与目前的标准图像压缩算法兼容,对图像的感兴趣区域进行更好的保护。由感兴趣区域的非线性几何变换产生冗余,对图像进行采样形成多描述编码。通过仿真实验,证实当图像在差错信道下传输而丢失描述时,该算法能够使图像感兴趣区域得到更好的恢复。     

Compressed Multiresolution Hierarchies for High‐Quality Precomputed Shadows

The quality of shadow mapping is traditionally limited by texture resolution. We present a novel lossless compression scheme for high‐resolution shadow maps based on precomputed multiresolution hierarchies. Traditional multiresolution trees can compactly represent homogeneous regions of shadow maps at coarser levels, but require many nodes for fine details. By conservatively adapting the depth map, we can significantly reduce the tree complexity. Our proposed method offers high compression rates, avoids quantization errors, exploits coherency along all data dimensions, and is well‐suited for GPU architectures. Our approach can be applied for coherent shadow maps as well, enabling several applications, including high‐quality soft shadows and dynamic lights moving on fixed‐trajectories.