Ruihuang Li

Ruihuang Li

Auto-generated profile, based on publicly available information

Ruihuang Li

Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Hong Kong

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
3 November 2024
Verified
Book Chapter
Closed access
PDF file
CHChenhang He
Chenhang He
RLRuihuang Li
Ruihuang Li
GZGuowen Zhang
Guowen Zhang
LZLei Zhang
Lei Zhang

9 September 2024 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
ZZZhengqiang Zhang
Zhengqiang Zhang
RLRuihuang Li
Ruihuang Li
SGShi Guo
Shi Guo
YCYang Cao
Yang Cao
LZLei Zhang
Lei Zhang
Online video super-resolution (online-VSR) highly relies on an effective alignment module to aggregate temporal information, while the strict latency requirement makes accurate and efficient alignment very challenging. Though much progress has been achieved, most of the existing online-VSR methods estimate the motion fields of each frame separately to perform alignment, which is computationally redundant and ignores the fact that the motion fields of adjacent frames are correlated. In this work, we propose an efficient Temporal Motion Propagation (TMP) method, which leverages the continuity of motion field to achieve fast pixel-level alignment among consecutive frames. Specifically, we first propagate the offsets from previous frames to the current frame, and then refine them in the neighborhood, significantly reducing the matching space and speeding up the offset estimation process. Furthermore, to enhance the robustness of alignment, we perform spatial-wise weighting on the warped features, where the positions with more precise offsets are assigned higher importance. Experiments on benchmark datasets demonstrate that the proposed TMP method achieves leading online-VSR accuracy as well as inference speed. The source code of TMP can be found at https://github.com/xtudbxk/TMP.

25 April 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
YZYabin Zhang
Yabin Zhang
JLJiehong Lin
Jiehong Lin
RLRuihuang Li
Ruihuang Li
KJKui Jia
Kui Jia
LZLei Zhang
Lei Zhang
Masked autoencoder (MAE) has demonstrated its effectiveness in self-supervised point cloud learning. Considering that masking is a kind of corruption, in this work we explore a more general denoising autoencoder for point cloud learning (Point-DAE) by investigating more types of corruptions beyond masking. Specifically, we degrade the point cloud with certain corruptions as input, and learn an encoder-decoder model to reconstruct the original point cloud from its corrupted version. Three corruption families (i.e., density/masking, noise, and affine transformation) and a total of 14 corruption types are investigated with traditional non-Transformer encoders. Besides the popular masking corruption, we identify another effective corruption family, i.e., affine transformation. The affine transformation disturbs all points globally, which is complementary to the masking corruption where some local regions are dropped. We also validate the effectiveness of affine transformation corruption with the Transformer backbones, where we decompose the reconstruction of the complete point cloud into the reconstructions of detailed local patches and rough global shape, alleviating the position leakage problem in the reconstruction. Extensive experiments on tasks of object classification, few-shot learning, robustness testing, part segmentation, and 3-D object detection validate the effectiveness of the proposed method. The codes are available at https://github.com/YBZh/Point-DAE

3 November 2024
Verified
Book Chapter
Closed access
PDF file
RLRuihuang Li
Ruihuang Li
ZZZhengqiang Zhang
Zhengqiang Zhang
CHChenhang He
Chenhang He
ZMZhiyuan Ma
Zhiyuan Ma
VPVishal M. Patel
Vishal M. Patel
LZLei Zhang
Lei Zhang

19 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
CHChenhang He
Chenhang He
RLRuihuang Li
Ruihuang Li
SLShuai Li
Shuai Li
LZLei Zhang
Lei Zhang
Transformer has demonstrated promising performance in many 2D vision tasks. However, it is cumbersome to compute the self-attention on large-scale point cloud data because point cloud is a long sequence and unevenly distributed in 3D space. To solve this issue, existing methods usually compute self-attention locally by grouping the points into clusters of the same size, or perform convolutional self-attention on a discretized representation. However, the former results in stochastic point dropout, while the latter typically has narrow attention fields. In this paper, we propose a novel voxel-based architecture, namely Voxel Set Transformer (VoxSeT), to detect 3D objects from point clouds by means of set-to-set translation. VoxSeT is built upon a voxel-based set attention (VSA) module, which reduces the self-attention in each voxel by two cross-attentions and models features in a hidden space induced by a group of latent codes. With the VSA module, VoxSeT can manage voxelized point clusters with arbitrary size in a wide range, and process them in parallel with linear complexity. The proposed VoxSeT integrates the high performance of transformer with the efficiency of voxel-based model, which can be used as a good alternative to the convolutional and point-based backbones. VoxSeT reports competitive results on the KITTI and Waymo detection benchmarks. The source codes can be found at \url{https://github.com/skyhehe123/VoxSeT}.

25 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
YZYabin Zhang
Yabin Zhang
MLMinghan Li
Minghan Li
RLRuihuang Li
Ruihuang Li
KJKui Jia
Kui Jia
LZLei Zhang
Lei Zhang
Arbitrary style transfer (AST) and domain generalization (DG) are important yet challenging visual learning tasks, which can be cast as a feature distribution matching problem. With the assumption of Gaussian feature distribution, conventional feature distribution matching methods usually match the mean and standard deviation of features. However, the feature distributions of real-world data are usually much more complicated than Gaussian, which cannot be accurately matched by using only the first-order and second-order statistics, while it is computationally prohibitive to use high-order statistics for distribution matching. In this work, we, for the first time to our best knowledge, propose to perform Exact Feature Distribution Matching (EFDM) by exactly matching the empirical Cumulative Distribution Functions (eCDFs) of image features, which could be implemented by applying the Exact Histogram Matching (EHM) in the image feature space. Particularly, a fast EHM algorithm, named Sort-Matching, is employed to perform EFDM in a plug-and-play manner with minimal cost. The effectiveness of our proposed EFDM method is verified on a variety of AST and DG tasks, demonstrating new state-of-the-art results. Codes are available at https://github.com/YBZh/EFDM.