Intra prediction is a vital part of the image/video coding framework, which is designed to remove spatial redundancy within a picture. Based on a set of predefined linear combinations, traditional intra prediction cannot cope with coding blocks with irregular textures. To tackle this drawback, in this article, we propose a Generative Adversarial Network (GAN)-based intra prediction approach to enhance intra prediction accuracy. Specifically, with the superior non-linear fitting ability, the well-trained generator of GAN acts as a mapping from the adjacent reconstructed signals to the prediction unit, implemented into both encoder and decoder. Simulation results show that for All-Intra configuration, our proposed algorithm achieves, on average, a 1.6% BD-rate cutback for luminance components compared with video coding reference software HM-16.15 and outperforms previous similar works.
Intra Block Copy (IBC) cannot work well for blocks with symmetry or mirror characteristic, because it is based on the translational block matching technique. In order to solve this problem, in this paper, an adequately designed IBC-Mirror mode is proposed for Versatile Video Coding (VVC), which extends our previous work. The newly proposed IBC-Mirror mode consists of two sub-modes, including IBC-Mirror Advanced Motion Vector Prediction (AMVP) mode and IBC-Mirror Merge mode. In IBC-Mirror AMVP mode, various Motion Estimation (ME) methods are applied, including previously proposed spatial search, and newly designed methods, i.e., Hash-based, Cache-based, Predictor-based and History-based IBC-Mirror search. As for IBC-Mirror Merge mode, Motion Information, composed of Block Vector (BV) and mirror flipping information, is added to the merge list to improve coding efficiency. Compared to the traditional IBC mode in VTM-10.0, the latest test model, the proposed mode can achieve 1~2% BD-rate saving. Compared to our previous work, methods in this paper can further achieve 0.5% coding gains and reduce 4% coding time. Higher coding efficiency and lower complexity show the superiority of extensions and improvements in this paper.