Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ruixun Zhang

dblp:219/9614 · DBLP profile ↗
← Back
17ranked-venue papers
1as first author
9since 2021 · last 2025
0000-0002-7670-8393ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 12 · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 since 2021Software engineering, systems software and programming languages · 3 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
2 papers
Image and video processing · 60% Computational photography and imaging · 26% Visual content generation and editing · 13%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%
Artificial intelligence
1 paper
Optimization for machine learning · 100%

Topics — the 16 heaviest of 16, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
convergence analysis
0.912025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Mathematical optimization › stochastic optimization
stochastic approximation
0.912025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Mathematical optimization › stochastic optimization › stochastic approximation
two-time-scale stochastic approximation
0.912025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Image and video processing › image restoration
image denoising
0.712023
Lighting Every Darkness in Two Pairs : A Calibration-Free Pipeline for RAW Denoising · ICCV 2023
Image and video processing
image restoration
0.712023
Lighting Every Darkness in Two Pairs : A Calibration-Free Pipeline for RAW Denoising · ICCV 2023
Image and video processing › image restoration › image denoising › real image denoising
low-light image denoising
0.712023
Lighting Every Darkness in Two Pairs : A Calibration-Free Pipeline for RAW Denoising · ICCV 2023
Image and video processing › image restoration › image denoising
raw image denoising
0.712023
Lighting Every Darkness in Two Pairs : A Calibration-Free Pipeline for RAW Denoising · ICCV 2023
Computational photography and imaging
image relighting
0.612022
Designing an Illumination-Aware Network for Deep Image Relighting · IEEE Trans. Image Process. 2022
Visual content generation and editing
image-to-image translation
0.612022
Designing an Illumination-Aware Network for Deep Image Relighting · IEEE Trans. Image Process. 2022
Computational photography and imaging › image relighting
single-image relighting
0.612022
Designing an Illumination-Aware Network for Deep Image Relighting · IEEE Trans. Image Process. 2022
Recommender systems
collaborative filtering
0.312018
Recurrent Collaborative Filtering for Unifying General and Sequential Recommender · IJCAI 2018
Recommender systems › collaborative filtering
matrix factorization
0.312018
Recurrent Collaborative Filtering for Unifying General and Sequential Recommender · IJCAI 2018
Recommender systems › sequential recommendation
recurrent neural network recommendation
0.312018
Recurrent Collaborative Filtering for Unifying General and Sequential Recommender · IJCAI 2018
Recommender systems
sequential recommendation
0.312018
Recurrent Collaborative Filtering for Unifying General and Sequential Recommender · IJCAI 2018
Machine learning › Optimization for machine learning › iterate averaging
polyak-ruppert averaging
0.312025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025
Machine learning › Optimization for machine learning
stochastic gradient descent
0.312025
Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence · AAAI 2025

Methods — techniques the papers use, named apart from their topics

lyapunov function analysis · 1.7structural modification · 0.7few-shot fine-tuning · 0.7calibration-free pipeline · 0.7illumination-aware residual block · 0.6hierarchical sampling · 0.6depth-guided geometry encoder · 0.6recurrent neural network · 0.3multi-task learning · 0.3matrix factorization · 0.3
YearPublicationVenuePosition
2025 Convergence Rate in a Nonlinear Two-Time-Scale Stochastic Approximation with State (Time)-Dependence
abstract
The nonlinear two-time-scale stochastic approximation is widely studied under conditions of bounded variances in noise. Motivated by recent advances that allow for variability linked to the current state or time, we consider state- and time-dependent noises. We show that the Lyapunov function exhibits polynomial convergence rates in both cases, with the rate of polynomial delay depending on the parameters of state- or time-dependent noises. Notably, if the state noise parameters fully approach their limiting value, the Lyapunov function achieves an exponential convergence rate. We provide two numerical examples to illustrate our theoretical findings in the context of stochastic gradient descent with Polyak-Ruppert averaging and stochastic bilevel optimization.
Zixi Chen 0001, Yumin Xu, Ruixun Zhang
AAAI3
2023 Lighting Every Darkness in Two Pairs : A Calibration-Free Pipeline for RAW Denoising
abstract
Calibration-based methods have dominated RAW image denoising under extremely low-light environments. However, these methods suffer from several main deficiencies: 1) the calibration procedure is laborious and time-consuming, 2) denoisers for different cameras are difficult to transfer, and 3) the discrepancy between synthetic noise and real noise is enlarged by high digital gain. To overcome the above shortcomings, we propose a calibration-free pipeline for Lighting Every Drakness (LED), regardless of the digital gain or camera sensor. Instead of calibrating the noise parameters and training repeatedly, our method could adapt to a target camera only with few-shot paired data and fine-tuning. In addition, well-designed structural modification during both stages alleviates the domain gap between synthetic and real noise without any extra computational cost. With 2 pairs for each additional digital gain (in total 6 pairs) and 0.5% iterations, our method achieves superior performance over other calibration-based methods.
Xin Jin 0005, Jia-Wen Xiao, Linghao Han, Chunle Guo, Ruixun Zhang, Xialei Liu, Chongyi Li
ICCV5
2022 GSDNet: An Anti-interference Cochlea Segmentation Model Based on GAN
abstract
Medical segmentation of cochlear images aims to identify the area of the cochlea in a set of CT slices. The shape of cochlea will vary a quite in different CT slicing levels, and the relevant dataset has a higher labeling cost. This will lead to segmentation results with edge discontinuity when we implement supervised algorithm under few samples. In order to solve the problem of a small number of labeled images, this paper proposes a semi-supervised model called GSDNet which is based on GAN, which captures the features of the cochlear image without labels, so as to achieve high performance for processing fewer sampled data. To further improve the generalization of the model, we adopt a training method that allows the model to gradually distinguish between real images and fake images. In addition, in order to solve the problem of local noise interference and discontinuous segmentation results, we introduce a label discrimination network to force the distribution of generated results from segmentation network to align with the true label distribution, so that the edges of the segmentation results are continuous and the shape is more accurate. Finally, we conduct a segmentation experiment of the cochlear region containing 30 slices about cochlea data, and compare different cutting-edge methods. The method proposed in this paper achieves higher performance on the dice index.
Sikai Tao, Ruixun Zhang, Hongpeng Wang 0001
COMPSAC3
2022 Designing an Illumination-Aware Network for Deep Image Relighting
abstract
Lighting is a determining factor in photography that affects the style, expression of emotion, and even quality of images. Creating or finding satisfying lighting conditions, in reality, is laborious and time-consuming, so it is of great value to develop a technology to manipulate illumination in an image as post-processing. Although previous works have explored techniques based on the physical viewpoint for relighting images, extensive supervisions and prior knowledge are necessary to generate reasonable images, restricting the generalization ability of these works. In contrast, we take the viewpoint of image-to-image translation and implicitly merge ideas of the conventional physical viewpoint. In this paper, we present an Illumination-Aware Network (IAN) which follows the guidance from hierarchical sampling to progressively relight a scene from a single image with high efficiency. In addition, an Illumination-Aware Residual Block (IARB) is designed to approximate the physical rendering process and to extract precise descriptors of light sources for further manipulations. We also introduce a depth-guided geometry encoder for acquiring valuable geometry- and structure-related representations once the depth information is available. Experimental results show that our proposed method produces better quantitative and qualitative relighting results than previous state-of-the-art methods. The code and models are publicly available on https://github.com/NK-CS-ZZL/IAN.
Zuo-Liang Zhu, Zhen Li 0031, Ruixun Zhang, Chunle Guo, Ming-Ming Cheng
IEEE Trans. Image Process.3
2021 A Plug and Play Fast Intersection Over Union Loss for Boundary Box Regression
abstract
Bounding box regression is a very effective method to improve the localization accuracy of object detection. Recently, the IoU-based regression losses have been widely used in object detection algorithms. However, we observe that they degenerate seriously in the late training period, leading to slow convergence and inaccurate localization. In this paper, we design a Fast Intersection over Union (FIoU) loss, which can not only keep the advantages but also solve the weakness of IoU-based losses. Furthermore, FIoU can be directly applied to Non-Maximum Suppression (NMS) as a criterion to improve the localization performance. Numerous experiments on two popular benchmark datasets show that our method is superior to other the-state-of-art methods.
Zengsheng Kuang, Xian Fang, Ruixun Zhang, Xiuli Shao
ICASSP3
2021 Detection of Defect Proportion for Workpiece Surface Based on a Fusion Prediction Model
abstract
Due to the time-consuming nature and low accuracy of traditional point cloud-based defect detection methods, as well as the scarcity of reconstructed surface workpieces, the excessive amount of surface point cloud data, and the small proportion of defects, it is difficult to effectively segment the defects. To solve these problems, we propose a fusion prediction model named FPP-PreNet (Fusion of Projection and Point Network) to quantitatively estimate the proportion of defects. Based on the PointNet classification model, it treats defect proportion detection as a regression task. Considering the difference between classification and regression, it adjusts the activation and loss functions, replaces the maximum pooling operation, and integrates the orientation information for multi-feature learning and fusion. The global feature descriptors obtained by a projection network will be aggregated, and then the defect proportion prediction value of the point cloud slice is obtained through the fully connected layer and the activation function. We also propose a dataset construction strategy based on point cloud slices and merged orientation information to reduce the amount of calculation and expand the dataset when there is non-zero curvature. Finally, the effectiveness of the dataset and prediction model is verified through experiments.
Sikai Tao, Ruixun Zhang
ICTAI2
2021 IBNet: Interactive Branch Network for salient object detection
Xian Fang, Jinchao Zhu, Ruixun Zhang, Xiuli Shao, Hongpeng Wang 0001
Neurocomputing3
2021 Subspace Clustering with Block Diagonal Sparse Representation
Xian Fang, Ruixun Zhang, Xiuli Shao
Neural Process. Lett.2
2021 Collaborative learning in bounding box regression for object detection
Xian Fang, Zengsheng Kuang, Ruixun Zhang, Xiuli Shao, Hongpeng Wang 0001
Pattern Recognit. Lett.3
2020 Scale-Recursive Network with point supervision for crowd scene analysis
Ruixun Zhang, Xiuli Shao
Neurocomputing2
2020 Learning sparse features with lightweight ScatterNet for small sample training
Ruixun Zhang, Xiuli Shao, Zengsheng Kuang
Knowl. Based Syst.2
2019 Multi-scale Discriminative Location-Aware Network for Few-Shot Semantic Segmentation
abstract
Few-shot semantic segmentation methods aim for predicting the regions of different object categories with only a few labeled samples. It is difficult to produce segmentation results with high accuracy when a new category appears. In this paper, we propose a Multi-scale Discriminative Location-aware (MDL) network to tackle the few-shot semantic segmentation problem. In order to use information from different levels, we first keep the last three convolutional layers of FCN, and then use the VGG-16 network to extract features from the support image-label pair, which adjusts the weight of the query image segmentation branch. Discriminative location-aware architecture can improve the efficiency of few-shot segmentation, and therefore the global average pooling layer is added to produce location feature information. Finally, we evaluate our MDL model on the Pascal VOC 2012 challenge, and show that it achieves competitive mIoU score compared to methods in recent years.
Ruixun Zhang, Xiuli Shao
COMPSAC (2)2
2019 Learning Deep Structured Multi-scale Features for Crisp and Object Occlusion Edge Detection
Ruixun Zhang, Xiuli Shao
ICANN (3)2
2019 A CNN-RNN Hybrid Model with 2D Wavelet Transform Layer for Image Classification
abstract
Convolutional neural networks (CNNs) have recently achieved impressive performances in image processing tasks such as image classification and object recognition. However, CNNs only process images in the spatial domain whereas spectral analysis operates in the frequency domain. In this paper, we propose the 2D wavelet transform layer. The learned features from images are viewed as two-directional sequential data, and we use two LSTM layers that sweep both horizontally and vertically across the image to compress feature matrices. Based on this, the 2D wavelet transform decomposes the above feature matrices as a learned mixing of different harmonic functions, and therefore integrating the spectral analysis into CNNs. We also select 3 × 3 convolutional mixing style with Gaussian+LSM filter to mix the output of the 2D wavelet transform to generate new output features. Finally, we combine the sequential and spectral features to build our CNN-RNN architecture with skip layers and apply it to image classification. Our proposed network is evaluated on three widely-used benchmark datasets: CIFAR-10, CIFAR-100 and Tiny ImageNet. Experiments show that our CNN-RNN hybrid model achieves better accuracy in image classification tasks.
Ruixun Zhang, Xiuli Shao
ICTAI2
2018 A New Combined CNN-RNN Model for Sector Stock Price Analysis
abstract
The combination of Convolutional Neural Networks (CNNs) and Recurrent Neural Networks (RNNs) have played important roles in deep learning in recent years to improve the prediction performance, especially in the context of temporal data analysis. Previous research has shown that certain time series could have common time-dependent characteristics. Therefore, in order to make good prediction, it is necessary to take into account the correlation between different temporal data in modeling. However, general RNN models have serious limitation to achieve this goal. In this paper, a new architecture, Deep and Wide Neural Networks (DWNN), is proposed, where CNN's convolution layer is added to the RNN's hidden state transfer process. CNN is combined with RNN to extract the correlation characteristics of different RNN models while RNNs running along the time steps. This new architecture not only has the depth of RNN in the time dimension, but also has the width of the number of temporal data. The intuition behind the DWNN model, as well as different kinds of DWNN model structures are discussed in this paper. We use stock data from the sandstorm sector of Shanghai Stock Exchange for our experiment. As shown in the result, our proposed DWNN model can reduce the prediction mean squared error by 30% compared with the general RNN model.
Ruixun Zhang, Zhaozheng Yuan, Xiuli Shao
COMPSAC (2)1
2018 Multi-scale Feature Decode and Fuse Model with CRF Layer for Boundary Detection
Ruixun Zhang, Xiuli Shao, Huichao Li
ICONIP (2)2
2018 Recurrent Collaborative Filtering for Unifying General and Sequential Recommender
abstract
General recommender and sequential recommender are two commonly applied modeling paradigms for recommendation tasks. General recommender focuses on modeling the general user preferences, ignoring the sequential patterns in user behaviors; whereas sequential recommender focuses on exploring the item-to-item sequential relations, failing to model the global user preferences. In addition, better recommendation performance has recently been achieved by adopting an approach to combine them. However, previous approaches are unable to solve both tasks in a unified way and cannot capture the whole historical sequential information. In this paper, we propose a recommendation model named Recurrent Collaborative Filtering (RCF), which unifies both paradigms within a single model.Specifically, we combine recurrent neural network (the sequential recommender part) and matrix factorization model (the general recommender part) in a multi-task learning framework, where we perform joint optimization with shared model parameters enforcing the two parts to regularize each other. Furthermore, we empirically demonstrate on MovieLens and Netflix datasets that our model outperforms the state-of-the-art methods across the tasks of both sequential and general recommender.
Disheng Dong, Ruixun Zhang, Yan Wang 0002
IJCAI3