Hui Zeng

Hui Zeng

Auto-generated profile, based on publicly available information

Hui Zeng

Computing, Hong Kong Polytechnic University, 26680 Hong Kong, Hong Kong Hong Kong

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 October 2019
Verified
Conference Paper
Closed access
JCJianrui Cai
Jianrui Cai
HZHui Zeng
Hui Zeng
HYHongwei Yong
Hongwei Yong
ZCZisheng Cao
Zisheng Cao
LZLei Zhang
Lei Zhang

25 September 2020 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
HZHui Zeng
Hui Zeng
JCJianrui Cai
Jianrui Cai
LLLida Li
Lida Li
ZCZisheng Cao
Zisheng Cao
LZLei Zhang
Lei Zhang
Recent years have witnessed the increasing popularity of learning-based photo enhancement methods. However, existing methods either deliver unsatisfactory results or consume too much computational and memory resources, hindering their application to high-resolution images in practice. In this paper, we learn image-adaptive 3-dimensional lookup tables (3D LUTs) to achieve fast and robust photo enhancement. 3D LUTs are widely used for manipulating color and tone of photos, but they are usually manually tuned and fixed in camera imaging pipeline or photo editing tools. We, for the first time to our best knowledge, propose to learn 3D LUTs from annotated data. More importantly, our learned 3D LUT is image-adaptive. We learn multiple basis 3D LUTs and a small convolutional neural network (CNN) simultaneously in an end-to-end manner. The small CNN predicts content-dependent weights to fuse the multiple basis 3D LUTs into an image-adaptive one, which is employed to transform the source images efficiently. Our model contains less than 0.6 million parameters and runs at a speed of 602 FPS at 4K resolution using one Titan RTX GPU. While being highly efficient, our model also significantly outperforms the state-of-the-art photo enhancement methods in terms of PSNR, SSIM and color difference on two benchmark datasets.

9 November 2017 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
JKJongyoo Kim
Jongyoo Kim
HZHui Zeng
Hui Zeng
DGDeepti Ghadiyaram
Deepti Ghadiyaram
SLSanghoon Lee
Sanghoon Lee
LZLei Zhang
Lei Zhang
ABAlan C. Bovik
Alan C. Bovik
Convolutional neural networks (CNNs) have been shown to deliver standout performance on a wide variety of visual information processing applications. However, this rapidly developing technology has only recently been applied with systematic energy to the problem of picture-quality prediction, primarily because of limitations imposed by a lack of adequate ground-truth human subjective data. This situation has begun to change with the development of promising data-gathering methods that are driving new approaches to deep-learning-based perceptual picture-quality prediction. Here, we assay progress in this rapidly evolving field, focusing, in particular, on new ways to collect large quantities of ground-truth data and on recent CNN-based picture-quality prediction models that deliver excellent results in a large, real-world, picture-quality database.

29 April 2016 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
PLPeihua Li
Peihua Li
QWQilong Wang
Qilong Wang
HZHui Zeng
Hui Zeng
LZLei Zhang
Lei Zhang
This paper presents a novel image descriptor to effectively characterize the local, high-order image statistics. Our work is inspired by the Diffusion Tensor Imaging and the structure tensor method (or covariance descriptor), and motivated by popular distribution-based descriptors such as SIFT and HoG. Our idea is to associate one pixel with a multivariate Gaussian distribution estimated in the neighborhood. The challenge lies in that the space of Gaussians is not a linear space but a Riemannian manifold. We show, for the first time to our knowledge, that the space of Gaussians can be equipped with a Lie group structure by defining a multiplication operation on this manifold, and that it is isomorphic to a subgroup of the upper triangular matrix group. Furthermore, we propose methods to embed this matrix group in the linear space, which enables us to handle Gaussians with Euclidean operations rather than complicated Riemannian operations. The resulting descriptor, called Local Log-Euclidean Multivariate Gaussian (L 2 EMG) descriptor, works well with low-dimensional and high-dimensional raw features. Moreover, our descriptor is a continuous function of features without quantization, which can model the first- and second-order statistics. Extensive experiments were conducted to evaluate thoroughly L 2 EMG, and the results showed that L 2 EMG is very competitive with state-of-the-art descriptors in image classification.

1 October 2018
Verified
Conference Paper
Closed access
HZHui Zeng
Hui Zeng
LZLei Zhang
Lei Zhang
ABAlan C. Bovik
Alan C. Bovik
Most existing blind image quality assessment (BIQA) methods learn a regression model to predict scalar quality scores. Such a scheme ignores the fact that an image will receive divergent subjective scores from different subjects, which cannot be adequately represented by a single scalar number. This is particularly true on complex, real-world distorted images. However, the more informative score distributions are unavailable in existing image quality assessment (IQA) databases and can be potentially noisy when limited number of opinions are collected on each image. This paper proposes a probabilistic quality representation (PQR) and employs a more robust loss function to train deep BIQA models. Using a very straightforward implementation, the proposed method is shown to not only speed up the convergence of deep model training, but also greatly improve the quality prediction accuracy relative to scalar quality score regression methods under the same setting. The source code is available at https://github.com/HuiZeng/BIQA_Toolbox.

15 September 2020 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
HZHui Zeng
Hui Zeng
LLLida Li
Lida Li
ZCZisheng Cao
Zisheng Cao
LZLei Zhang
Lei Zhang
Image cropping aims to improve the composition and aesthetic quality of an image by removing extraneous content from it. Most of the existing image cropping databases provide only one or several human-annotated bounding boxes as the groundtruths, which can hardly reflect the non-uniqueness and flexibility of image cropping in practice. The employed evaluation metrics such as intersection-over-union cannot reliably reflect the real performance of a cropping model, either. This work revisits the problem of image cropping, and presents a grid anchor based formulation by considering the special properties and requirements (e.g., local redundancy, content preservation, aspect ratio) of image cropping. Our formulation reduces the searching space of candidate crops from millions to no more than ninety. Consequently, a grid anchor based cropping benchmark is constructed, where all crops of each image are annotated and more reliable evaluation metrics are defined. To meet the practical demands of robust performance and high efficiency, we also design an effective and lightweight cropping model. By simultaneously considering the region of interest and region of discard, and leveraging multi-scale information, our model can robustly output visually pleasing crops for images of different scenes. With less than 2.5M parameters, our model runs at a speed of 200 FPS on one single GTX 1080Ti GPU.