Longfei Ren

Dr. Longfei Ren

orcid

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
14 February 2025 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
Degang WangDegang Wang
Degang Wang
LRLongfei Ren
Longfei Ren
XSXu Sun
Xu Sun
LGLianru Gao
Lianru Gao
Jocelyn  ChanussotJocelyn Chanussot
Jocelyn Chanussot
Hyperspectral anomaly detection (HAD) aims to locate targets deviating from the background distribution in hyperspectral images (HSIs) without requiring prior knowledge. Most current deep learning-based HAD methods struggle to effectively distinguish anomalies due to limited utilization of supervision information and intrinsic nonlocal self-similarity in HSIs. To this end, this article proposes a novel nonlocal and local feature-coupled self-supervised network (NL2Net) tailored for HAD. NL2Net employs a dual-branch architecture that integrates both local and nonlocal feature extraction. The local feature extraction branch (LFEB) leverages centrally masked and dilated convolutions to extract local spatial-spectral features, while the non-LFEB incorporates a simplified self-attention module to capture long-range dependencies. Furthermore, an improved center block masked convolution strengthens NL2Net ’s focus on surrounding background features, enhancing the background modeling effect. By reconstructing pure backgrounds and suppressing anomalous features, NL2Net achieves precise anomaly separation and superior HAD performance. Experimental results demonstrate its ability to effectively integrate multidimensional features and enhance HAD accuracy, surpassing state-of-the-art methods.

12 January 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
LRLongfei Ren
Longfei Ren
Danfeng HongDanfeng Hong
Danfeng Hong
LGLianru Gao
Lianru Gao
XSXu Sun
Xu Sun
MHMin Huang
Min Huang
Jocelyn  ChanussotJocelyn Chanussot
Jocelyn Chanussot
Hyperspectral unmixing aims at estimating pure spectral signatures and their proportions in each pixel. In practice, the atmospheric effects, intrinsic variation of the spectral signatures of the materials, illumination and topographic changes cause what is known as spectral variability resulting in significant estimation errors being propagated throughout the unmixing task. To this end, we developed a new method, called the orthogonal subspace unmixing (OSU), to address spectral variability by utilizing the orthogonal subspace projection. The proposed OSU method jointly performs orthogonal subspace learning and the unmixing process to find a more suitable subspace for unmixing. The orthogonal subspace projection encourages the representation held in the subspace to be more distinct from each other to remove the complex spectral variability in the subspace. Furthermore, an alternating minimization (AM) was designed to solve the resulting optimization problem. An efficient and convergent symmetric Gauss-Seidel alternating direction method of multipliers (sGS-ADMM), essentially a special case of the semi-proximal ADMM (SPADMM), was developed to solve the subproblem. Experiments conducted on one synthetic data and two real data demonstrate the effectiveness and superiority of the proposed framework in mitigating the effects of spectral variability with respect to classical linear unmixing methods or variability accounting approaches.

2 August 2024 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
MWMinghua Wang
Minghua Wang
LGLianru Gao
Lianru Gao
LRLongfei Ren
Longfei Ren
XSXian Sun
Xian Sun
Jocelyn  ChanussotJocelyn Chanussot
Jocelyn Chanussot
In data acquisition and transmission, hyperspectral (HS) images are inevitably corrupted by additive noises, making it challenging to accurately observe and recognize the materials on the surface of the Earth. However, scholars have been addicted to developing numerous complex methods for separable two-stage denoising and anomaly detection (AD) tasks over the past years, rarely paying attention to the real effect of noises for subsequent intelligent interpretation. To this date, we propose a hierarchical integration framework for hyperspectral simultaneous AD and denoising (HyADD). Joint AD and denoising are mutually integrated and their outputs in each iteration stimulate each other, breaking through the respective performance bottlenecks of the separable two-stage scheme. Inspired by spatial-spectral gradient domain-based constraint, HyADD removes additive noises and preserves advantageous image smoothness information to improve intermediate detection performances in the iteration loop. Conversely, with the assistance of the anti-noise dictionary conduction and the subspace domain-based low-rankness, the identification of anomalies with different features from the background can provide effective feedback to the denoising process. The proposed algorithm is efficiently solved by the well-designed linearized alternating direction method of multipliers with an adaptive penalty (LADMAP). A comparison with the existing well-known AD algorithms via simulated and real-world experiments establishes the competitiveness of the proposed HyADD with state-of-the-art methods. The codes and real dataset will be available at https://github.com/MinghuaWang123/HyADD.

2 January 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
LRLongfei Ren
Longfei Ren
LGLianru Gao
Lianru Gao
MWMinghua Wang
Minghua Wang
XSXu Sun
Xu Sun
Jocelyn  ChanussotJocelyn Chanussot
Jocelyn Chanussot
Hyperspectral anomaly detection aims at distinguishing targets of interest from the background without prior knowledge. Although low-rank representation (LRR)-based methods have been broadly applied in anomaly detection tasks, how to approximate the penalties in LRR-based methods more precisely is still a problem that needs to be further investigated. To this end, this article designs a unified nonconvex framework called hyperspectral anomaly detection via generalized shrinkage mappings (HADGSMs) to better approximate the LRR-based methods. The core of the proposed framework is to design new nonconvex penalties to approximate the group sparsity, $l_{0}$ gradient, and low-rankness penalties in the LRR-based anomaly detection models, which can be efficiently minimized by means of generalized shrinkage mappings (GSMs). Then, an efficient alternating direction method of multipliers (ADMM) is developed to handle the proposed model. Experiments conducted on several real hyperspectral datasets demonstrate the superiority and effectiveness of the proposed framework in enhancing detection performance with respect to state-of-the-art methods.

28 May 2021 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
LRLongfei Ren
Longfei Ren
ZMZheng Ma
Zheng Ma
Francesca BovoloFrancesca Bovolo
Francesca Bovolo
LBLorenzo Bruzzone
Lorenzo Bruzzone
Sparse unmixing (SU) has been widely investigated for hyperspectral analysis with the aim to find the optimal subset of spectral signatures in a spectral library (known in advance) that can optimally model each pixel of the given hyperspectral image. Usually, the available spectral library organizes spectral signatures in groups. However, most existing strategies do not take full advantage of the inherent properties in the library. In this article, we design a convex framework for SU that incorporates the group structure of the spectral library. The convex framework includes two kinds of algorithms derived from either the primal or the dual form of the alternating direction method of multipliers (ADMM). Then, the convergence properties of the convex framework are established. Based on the convex framework, a novel nonconvex framework is developed for unmixing, which provides a new manner to enhance the sparsity of solution. The core of the nonconvex framework is to design a nonconvex penalty function for efficient minimization utilizing the generalized shrinkage mapping. The penalty function can be regarded as a closer approximation of the $l_{0}$ norm. Experiments conducted on simulated and real hyperspectral data demonstrate the superiority and effectiveness of the proposed nonconvex framework in improving the unmixing performance and enhancing the sparsity of solution with respect to state-of-the-art techniques.

27 March 2023 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
MWMinghua Wang
Minghua Wang
Danfeng HongDanfeng Hong
Danfeng Hong
Bing ZhangBing Zhang
Bing Zhang
LRLongfei Ren
Longfei Ren
Jing YaoJing Yao
Jing Yao
Jocelyn  ChanussotJocelyn Chanussot
Jocelyn Chanussot
Efforts to enhance the detection accuracy of hyperspectral (HS) anomaly detection (AD) have been significant, but the impact of noise resulting from HS data acquisition and transmission has not been well studied. Furthermore, the separation of denoising and subsequent interpretation makes it challenging to evaluate and control the influence of noise on the detection results. To this end, we proposed a joint anomaly detection and noise removal (ADNR) paradigm called DSR-ADNR, which develops a double subspace representation method to obtain both denoised and detection results simultaneously. DSR-ADNR uses a low-dimensional orthogonal basis to represent HS images and extract distinctive features for AD. The feature matrix is represented by a dictionary-based low-rank subspace that captures the complex nature of the low-dimensional features. In each iteration, DSR-ADNR utilizes the nonlocal self-similarity of the feature matrix to remove noise and improve intermediate detection performance. Meanwhile, the progressive LR representation of the background and anomalies for the feature matrix upgrades the explicit LR expression of nonlocal self-similar patches for better denoising. The well-designed linearized alternating direction method of multipliers with an adaptive penalty (LADMAP) is utilized to solve the proposed DSR-ADNR. Extensive experiments on simulated and real-world data sets demonstrate the effectiveness of DSR-ADNR in the HS AD task under different noise cases.