Fan Liang

Fan Liang

Auto-generated profile, based on publicly available information

Fan Liang

School of Electronics and Information Technology, Sun Yat-sen University, Guangzhou, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 December 2019
Verified
Book Chapter
Closed access
PDF file
JCJian Cao
Jian Cao
NTNa Tang
Na Tang
JWJun Wang
Jun Wang
FLFan Liang
Fan Liang

30 April 2025 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
PYPengpeng Yu
Pengpeng Yu
YZYe Zhang
Ye Zhang
FLFan Liang
Fan Liang
HLHaoran Li
Haoran Li
YGYulan Guo
Yulan Guo
The growth of 3D point cloud applications requires efficient compression techniques for high-quality and low-latency services. Recently, learning-based point cloud compression models have made significant progress. However, geometric distortion resulting from downsampling limits the feature depth within large-scale point clouds, thereby constraining the receptive field and suppressing the redundant removal. Moreover, the issues of computational efficiency and reconstruction quality still persist in the compression of large-scale point clouds. To address these challenges, we propose a hierarchical distortion learning framework for end-to-end lossy compression of point clouds. First, we design a feature residual compression module to efficiently transmit shallow semantics between the encoder and the decoder, which enables a lightweight design of our framework. Second, we introduce a geometry residual compression module to progressively complement the reconstruction distortion, avoiding the accumulation of geometric distortion. By integrating these two modules and employing sufficient downsampling processes, we develop a high-performance framework with a significantly enlarged receptive field and low computational cost. Extensive experiments demonstrate that our method achieves state-ofthe- art performance in geometry lossy compression, while delivering competitive performance in joint geometry and color lossy compression with fast running speed. Code is available at https://github.com/pengpeng-yu/FastPCC.

9 January 2021 in Electronics
Verified
Journal Article
Open access
PDF file
GZGuangyu Zhong
Guangyu Zhong
JWJun Wang
Jun Wang
JHJiyuan Hu
Jiyuan Hu
FLFan Liang
Fan Liang
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.

1 January 2006
Verified
Conference Paper
Closed access
LFLiang Fan
Liang Fan
FYFang Yanmei
Fang Yanmei
In this paper, we propose a DWT-based video watermarking algorithm applying DS-CDMA (direct sequence code division multiple access). We use improved Gold sequences to encode the watermark. The CDMA encoded watermark is embedded into the lowest frequency coefficients of DWT transformed video frames. Blind recovery of the embedded watermark is achieved by analyzing the DWT coefficients of the watermarked video frames and the auto-correlation of orthogonal codes. The experimental results demonstrate that the proposed algorithm can produce watermarked contents in good visual quality and is robust to typical video operations such as MPEG-2 compression, Gaussian noise, cropping and frame dropping

19 February 2021 in IEEE Access
Verified
Journal Article
Open access
JCJian Cao
Jian Cao
FLFan Liang
Fan Liang
JWJun Wang
Jun Wang
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.

6 October 2021
Verified
Conference Paper
Closed access
JCJian Cao
Jian Cao
YJYifan Jia
Yifan Jia
FLFan Liang
Fan Liang
JWJun Wang
Jun Wang
Due to the newly adopted Quad Tree with Nested Multi-Type Tree (QTMT) partitioning scheme in Versatile Video Coding (VVC), multiple partitioning combinations can lead to the same Coding Unit (CU) structure. In other words, a CU may be encoded more than once. Based on this feature, a history-based complexity reduction strategy is proposed to accelerate VVC intra-frame coding with extremely low coding losses.Firstly, analyses of the relationship between the 1 st round CUs (encoded at the first time) and the following rounds CUs (encountered again and already analyzed in previous partitioning attempts) are provided. Correspondingly, some unnecessary partitioning types are identified and early terminated. Secondly, a hierarchical pruning algorithm is designed, where thresholds are adjusted adaptively in the 1 st round and used for pruning in the following rounds. To our knowledge, it is the first attempt to apply this history-based feature to accelerate partitioning for VVC intra-frame coding.Results show that these strategies can achieve 20% encoding time saving (TS) with only 0.18% BDBR increase. In addition, there is a huge potential for High-Resolution videos (21% TS with only 0.1% BDBR increase for 4K sequences). Compared to other works, our method achieves a considerably high TS/BDBR ratio, which indicates a better tradeoff between coding efficiency and complexity.