Yunzhong Hou

Yunzhong Hou

Auto-generated profile, based on publicly available information

Yunzhong Hou

Australian National University, Canberra, Australia

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
9 November 2020
Verified
Book Chapter
Closed access
PDF file
YHYunzhong Hou
Yunzhong Hou
LZLiang Zheng
Liang Zheng
SGStephen Gould
Stephen Gould

1 June 2020
Verified
Conference Paper
Open access
YHYunzhong Hou
Yunzhong Hou
LZLiang Zheng
Liang Zheng
SGStephen Gould
Stephen Gould
Color and structure are the two pillars that construct an image. Usually, the structure is well expressed through a rich spectrum of colors, allowing objects in an image to be recognized by neural networks. However, under extreme limitations of color space, the structure tends to vanish, and thus a neural network might fail to understand the image. Interested in exploring this interplay between color and structure, we study the scientific problem of identifying and preserving the most informative image structures while constraining the color space to just a few bits, such that the resulting image can be recognized with possibly high accuracy. To this end, we propose a color quantization network, ColorCNN, which learns to structure the images from the classification loss in an end-to-end manner. Given a color space size, ColorCNN quantizes colors in the original image by generating a color index map and an RGB color palette. Then, this color-quantized image is fed to a pre-trained task network to evaluate its performance. In our experiment, with only a 1-bit color space (i.e., two colors), the proposed network achieves 82.1% top-1 accuracy on the CIFAR10 dataset, outperforming traditional color quantization methods by a large margin. For applications, when encoded with PNG, the proposed color quantization shows superiority over other image compression methods in the extremely low bit-rate regime. The code is available at https://github.com/hou-yz/color_distillation.

8 November 2023 in Pattern Recognition
Verified
Journal Article
Open access
YHYunzhong Hou
Yunzhong Hou
SGStephen Gould
Stephen Gould
LZLiang Zheng
Liang Zheng

10 December 2021 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YHYunzhong Hou
Yunzhong Hou
ZWZhongdao Wang
Zhongdao Wang
SWShengjin Wang
Shengjin Wang
LZLiang Zheng
Liang Zheng
Data associations in multi-target multi-camera tracking (MTMCT) usually estimate affinity directly from re-identification (re-ID) feature distances. However, we argue that it might not be the best choice given the difference in matching scopes between re-ID and MTMCT problems. Re-ID systems focus on global matching , which retrieves targets from all cameras and all times. In contrast, data association in tracking is a local matching problem, since its candidates only come from neighboring locations and time frames. In this paper, we design experiments to verify such misfit between global re-ID feature distances and local matching in tracking, and propose a simple yet effective approach to adapt affinity estimations to corresponding matching scopes in MTMCT. Instead of trying to deal with all appearance changes, we tailor the affinity metric to specialize in ones that might emerge during data associations. To this end, we introduce a new data sampling scheme with temporal windows originally used for data associations in tracking. Minimizing the mismatch, the adaptive affinity module brings significant improvements over global re-ID distance, and produces competitive performance on CityFlow and DukeMTMC datasets.

11 July 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
YHYunzhong Hou
Yunzhong Hou
SGStephen Gould
Stephen Gould
LZLiang Zheng
Liang Zheng
Color quantization reduces the number of colors used in an image while preserving its content, which is essential in pixel art and knitting art creation. Traditional methods primarily focus on visual fidelity and treat it as a clustering problem in the RGB space. While effective in large (5-6 bits) color spaces, these approaches cannot guarantee semantics in small (1-2 bits) color spaces. On the other hand, deep color quantization methods use network viewers such as AlexNet and ResNet for supervision, effectively preserving semantics in small color spaces. However, in large color spaces, they lag behind traditional methods in terms of visual fidelity. In this work, we propose ColorCNN+, a novel approach that combines the strengths of both. It uses network viewer signals for supervision in small color spaces and learns to cluster the colors in large color spaces. Noteworthily, it is non-trivial for neural networks to do clustering, where existing deep clustering methods often need K-means to cluster the features. In this work, through a newly introduced cluster imitation loss, ColorCNN+ learns to directly output the cluster assignment without any additional steps. Furthermore, ColorCNN+ supports multiple color space sizes and network viewers, offering scalability and easy deployment. Experimental results demonstrate competitive performance of ColorCNN+ across various settings. Code is available at link.

9 November 2026
Verified
Conference Paper
Open access
YHYunzhong Hou
Yunzhong Hou
LZLiang Zheng
Liang Zheng
PTPhilip Torr
Philip Torr