Fast CU Partition for VVC Using Texture Complexity Classification Convolutional Neural Network

Versatile video coding(H.266/VVC),which was newly released by the Joint Video Exploration Team(JVET),introduces quad-tree plus multitype tree(QTMT)partition structure on the basis of quad-tree(QT)partition structure in High Efficiency Video Coding(H.265/HEVC).More complicated coding unit(CU)partitioning processes in H.266/VVC significantly improve video compression efficiency,but greatly increase the computational complexity compared.The ultra-high encoding complexity has obstructed its real-time applications.In order to solve this problem,a CU partition algorithm using convolutional neural network(CNN)is proposed in this paper to speed up the H.266/VVC CU partition process.Firstly,64×64 CU is divided into smooth texture CU,mildly complex texture CU and complex texture CU according to the CU texture characteristics.Second,CU texture complexity classification convolutional neural network(CUTCC-CNN)is proposed to classify CUs.Finally,according to the classification results,the encoder is guided to skip different RDO search process.And optimal CU partition results will be determined.Experimental results show that the proposed method reduces the average coding time by 32.2%with only 0.55%BD-BR loss compared with VTM 10.2.

Formal Photograph Compression Algorithm Based on Object Segmentation

Small storage space for photographs in formal documents is increasingly necessary in today＇s needs for huge amounts of data communication and storage. Traditional compression algorithms do not sufficiently utilize the distinctness of formal photographs. That is, the object is an image of the human head, and the background is in unicolor. Therefore, the compression is of low efficiency and the image after compression is still space-consuming. This paper presents an image compression algorithm based on object segmentation for practical high-efficiency applications. To achieve high coding efficiency, shape-adaptive discrete wavelet transforms are used to transformation arbitrarily shaped objects. The areas of the human head and its background are compressed separately to reduce the coding redundancy of the background. Two methods, lossless image contour coding based on differential chain, and modified set partitioning in hierarchical trees （SPIHT） algorithm of arbitrary shape, are discussed in detail. The results of experiments show that when bit per pixel （bpp）is equal to 0.078, peak signal-to-noise ratio （PSNR） of reconstructed photograph will exceed the standard of SPIHT by nearly 4dB.

Novel Video Steganography Algorithm Based on Secret Sharing and Error-Correcting Code for H.264/AVC

In this paper, we analyze the video steganography technique, which is used to ensure national security and the confidentiality of the information of governmental agencies and enterprises. Videos may be used to transmit secrets and conduct covert communication. As such, we present an algorithm based on a secret sharing scheme and an Error-Correcting Code（ECC）, which combines Grey Relational Analysis（GRA） with a partition mode in video compression standard H.264/AVC. First, we process secret information by secret sharing, and then use an ECC to process the obtained information. Moreover, we choose the Discrete Cosine Transform（DCT） blocks using GRA, and then use rules to hide the pretreated information in DCT coefficients of the video frames. Experimental results indicate that our algorithm has good invisibility, better robustness, good anti-steganalysis ability, and little influence on the bit rate of the video carrier. In addition, the bit error rate is low after attacks such as noise, filtering,or frame loss in the simulation environment.