Chenxu Zhang

Chenxu Zhang

Auto-generated profile, based on publicly available information

Chenxu Zhang

Chongqing University

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
22 September 2025 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XLXiao Liu
Xiao Liu
CZChenxu Zhang
Chenxu Zhang
FHFuxiang Huang
Fuxiang Huang
SXShuyin Xia
Shuyin Xia
GWGuoyin Wang
Guoyin Wang
LZLei Zhang
Lei Zhang
State space model (SSM) is a mathematical model used to describe and analyze the behavior of dynamic systems. This model has witnessed numerous applications in several fields, including control theory, signal processing, economics, and machine learning. In the field of deep learning, SSMs are used to process sequence data, such as time series analysis, natural language processing (NLP), and video understanding. By mapping sequence data to state space, long-term dependencies in the data can be better captured. In particular, modern SSMs have shown strong representational capabilities in NLP, especially in long sequence modeling, while maintaining linear time complexity. In particular, based on the latest SSMs, Mamba merges time-varying parameters into SSMs toward efficient training and inference. Given its impressive efficiency and strong long-range dependency modeling capability, Mamba is expected to become a new AI architecture that may be capable of surpassing Transformer. Recently, a number of works attempt to study the potential of Mamba in various fields, such as general vision, multimodal learning, medical image analysis, and remote sensing image analysis, by extending Mamba from natural language domain to visual domain. To fully understand Mamba in the visual domain, we conduct a comprehensive survey and present a taxonomy study. This survey focuses on Mamba’s application to a variety of visual tasks and data types, and discusses its predecessors, recent advances, and far-reaching impact on a wide range of domains.

1 December 2022 in IEEE Transactions on Computational Imaging
Verified
Journal Article
Closed access
YZYuanHong Zhong
YuanHong Zhong
CZChenxu Zhang
Chenxu Zhang
FRFan Ren
Fan Ren
HKHonggang Kuang
Honggang Kuang
PTPanliang Tang
Panliang Tang
In the study of image compressed sensing (CS), various priors are explored for regularization to achieve better reconstruction and provide different additional information. However, it is a challenge to combine different priors for better performance. In this article, we propose a novel framework (dubbed SCS-GNet) that integrates the merits of multiple priors for image CS. The framework is composed of a measurement matrix generator network and a reconstruction generator network, in which the implicit image prior is explored in the process of measurement matrix generation, and deep image and sparsity priors are explored in the reconstruction process. The two generator networks are separate in SCS-GNet, and the partial consistency of loss functions is explored for connection to boost the performance of image CS. Different from existing end-to-end joint training deep network-based methods, our measurement matrix generation process is performed separately, while the reconstruction process is training-free. Moreover, a novel training strategy is applied in the process of measurement matrix generation to enable the framework to be available for different measurement rates. Extensive experiments demonstrate that the proposed SCS-GNet achieves adaptive and scalable measurement and reconstruction at different measurement rates and offers competitive performance compared with other state-of-the-art methods.

2 February 2023 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
YZYuanHong Zhong
YuanHong Zhong
CZChenxu Zhang
Chenxu Zhang
JLJin Li
Jin Li
Deep image prior has been successfully applied to image compressed sensing, allowing capture implicit prior using only the network architecture without training data. However, existing methods fail to take full advantage of the characteristics of the different components of the image signal, resulting in loss of details, and the network architecture is designed in a homogeneous way, which limits the performance. We propose a novel network architecture to capture distinct implicit priors for different image components under the guidance of a designed loss function. In addition, we design a novel module to extract and fuse the local and global features to facilitate the interaction between the two components and boost the performance. Sufficient experiments demonstrate the competitive performance and effectiveness of our method. Code is available at https://github.com/zhang-chenxu/STDIP

13 October 2023 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
YZYuanHong Zhong
YuanHong Zhong
CZChenxu Zhang
Chenxu Zhang
XYXun Yang
Xun Yang
SWShanshan Wang
Shanshan Wang
Deep image prior (DIP) is an emerging technology that indicates that the structure of an untrained network can serve as an excellent prior for image restoration. It bridges the gap between training-based and training-free methods and exhibits considerable potential in image compressed sensing (CS) reconstruction. In this paper, we extend DIP and propose a novel Low-Rank Regularization Video Compressed Sensing Network for CS video reconstruction (dubbed LRR-VCSNet). We explore the application of a low-rank latent tensor with an untrained network for global low-rank regularization on video reconstruction, and the interframe low-rank approximation for framewise nonlocal low-rank regularization in the data space is also exploited. In addition, we design the structure of the untrained network based on the encoder-decoder architecture to improve the performance. Extensive experiments on six standard CIF video sequences show that LLR-VCSNet significantly outperforms traditional video CS methods and achieves competitive results when compared with the state-of-the-art training-based video CS method

25 October 2024
Verified
Book Chapter
Closed access
PDF file
SSSuqi Song
Suqi Song
CZChenxu Zhang
Chenxu Zhang
PZPeng Zhang
Peng Zhang
PLPengkun Li
Pengkun Li
FSFenglong Song
Fenglong Song
LZLei Zhang
Lei Zhang

1 January 2026 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
XFXiaowei Fu
Xiaowei Fu
SYShiyu Ye
Shiyu Ye
CZChenxu Zhang
Chenxu Zhang
FHFuxiang Huang
Fuxiang Huang
XXXin Xu
Xin Xu
LZLei Zhang
Lei Zhang
Unsupervised Domain Adaptation (UDA) aims to transfer knowledge from a labeled source domain to an unlabeled target domain by learning domain-invariant representations. Motivated by the recent success of Vision Transformers (ViTs), several UDA approaches have adopted ViT architectures to exploit fine-grained patch-level representations, which are unified as Transformer-based Domain Adaptation (TransDA) independent of CNN-based. However, we have a key observation in TransDA: due to inherent domain shifts, patches (tokens) from different semantic categories across domains may exhibit abnormally high similarities, which can mislead the self-attention mechanism and degrade adaptation performance. To solve that, we propose a novel Patch-Adaptation Transformer (PATrans), which first identifies similarity-anomalous patches and then adaptively suppresses their negative impact to domain alignment, i.e. token calibration. Specifically, we introduce a Patch-Adaptation Attention (PAA) mechanism to replace the standard self-attention mechanism, which consists of a weight-shared triple-branch mixed attention mechanism and a patch-level domain discriminator. The mixed attention integrates self-attention and cross-attention to enhance intra-domain feature modeling and inter-domain similarity estimation. Meanwhile, the patch-level domain discriminator quantifies the anomaly probability of each patch, enabling dynamic reweighting to mitigate the impact of unreliable patch correspondences. Furthermore, we introduce a contrastive attention regularization strategy, which leverages category-level information in a contrastive learning framework to promote class-consistent attention distributions. Extensive experiments on four benchmark datasets demonstrate that PATrans attains significant improvements over existing state-of-the-art UDA methods (e.g., 89.2% on the VisDA-2017). Code is available at: https://github.com/YSY145/PATrans.