Rongling Lang

Prof. Rongling Lang


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
14 September 2022 in Remote Sensing
Verified
Journal Article
Open access
PDF file
Fei GaoFei Gao
Fei Gao
JXJingming Xu
Jingming Xu
RLRongling Lang
Rongling Lang
JWJun Wang
Jun Wang
AHAmir Hussain
Amir Hussain
HZHuiyu Zhou
Huiyu Zhou
Convolutional Neural Network (CNN) has been widely applied in the field of synthetic aperture radar (SAR) image recognition. Nevertheless, CNN-based recognition methods usually encounter the problem of poor feature representation ability due to insufficient labeled SAR images. In addition, the large inner-class variety and high cross-class similarity of SAR images pose a challenge for classification. To alleviate the problems mentioned above, we propose a novel few-shot learning (FSL) method for SAR image recognition, which is composed of the multi-feature fusion network (MFFN) and the weighted distance classifier (WDC). The MFFN is utilized to extract input images’ features, and the WDC outputs the classification results based on these features. The MFFN is constructed by adding a multi-scale feature fusion module (MsFFM) and a hand-crafted feature insertion module (HcFIM) to a standard CNN. The feature extraction and representation capability can be enhanced by inserting the traditional hand-crafted features as auxiliary features. With the aid of information from different scales of features, targets of the same class can be more easily aggregated. The weight generation module in WDC is designed to generate category-specific weights for query images. The WDC distributes these weights along the corresponding Euclidean distance to tackle the high cross-class similarity problem. In addition, weight generation loss is proposed to improve recognition performance by guiding the weight generation module. Experimental results on the Moving and Stationary Target Acquisition and Recognition (MSTAR) dataset and the Vehicle and Aircraft (VA) dataset demonstrate that our proposed method surpasses several typical FSL methods.

9 June 2010 in Nonlinear Dynamics
Verified
Journal Article
Closed access
PDF file
RLRongling Lang
Rongling Lang

3 September 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
Fei GaoFei Gao
Fei Gao
XLXin Luo
Xin Luo
RLRongling Lang
Rongling Lang
JWJun Wang
Jun Wang
JSJinping Sun
Jinping Sun
AHAmir Hussain
Amir Hussain
Current synthetic aperture radar (SAR) automatic target recognition (ATR) algorithms primarily operate under the closed-set assumption, implying that all target classes have been previously learned during the training phase. However, in open scenarios, they may encounter target classes absent from the training set, thereby necessitating an open set recognition (OSR) challenge for SAR-ATR. The crux of OSR lies in establishing distinct decision boundaries between known and unknown classes to mitigate confusion among different classes. To address this issue, we introduce a novel framework termed reinforced class separability for SAR target open set recognition (RCS-OSR), which focuses on optimizing prototype distribution and enhancing the discriminability of features. First, to capture discriminative features, a cross-modal causal features enhancement module (CMCFE) is proposed to strengthen the expression of causal regions. Subsequently, regularized intra-class compactness loss (RIC-Loss) and intra-class relationship aware consistency loss (IRC-Loss) are devised to optimize the embedding space. In conjunction with joint supervised training using cross-entropy loss, RCS-OSR can effectively reduce empirical classification risk and open space risk simultaneously. Moreover, a class-aware OSR classifier with adaptive thresholding is designed to leverage the differences between different classes. Consequently, our method can construct distinct decision boundaries between known and unknown classes to simultaneously classify known classes and identify unknown classes in open scenarios. Extensive experiments conducted on the MSTAR dataset demonstrate the effectiveness and superiority of our method in various OSR tasks.

13 April 2023 in Sensors
Verified
Journal Article
Open access
PDF file
RLRongling Lang
Rongling Lang
FYFan Ya
Fan Ya
QCQing Chang
Qing Chang
Simultaneous localization and mapping (SLAM) plays a fundamental role in downstream tasks including navigation and planning. However, monocular visual SLAM faces challenges in robust pose estimation and map construction. This study proposes a monocular SLAM system based on a sparse voxelized recurrent network, SVR-Net. It extracts voxel features from a pair of frames for correlation and recursively matches them to estimate pose and dense map. The sparse voxelized structure is designed to reduce memory occupation of voxel features. Meanwhile, gated recurrent units are incorporated to iteratively search for optimal matches on correlation maps, thereby enhancing the robustness of the system. Additionally, Gauss–Newton updates are embedded in iterations to impose geometrical constraints, which ensure accurate pose estimation. After end-to-end training on ScanNet, SVR-Net is evaluated on TUM-RGBD and successfully estimates poses on all nine scenes, while traditional ORB-SLAM fails on most of them. Furthermore, absolute trajectory error (ATE) results demonstrate that the tracking accuracy is comparable to that of DeepV2D. Unlike most previous monocular SLAM systems, SVR-Net directly estimates dense TSDF maps suitable for downstream tasks with high efficiency of data exploitation. This study contributes to the development of robust monocular visual SLAM systems and direct TSDF mapping.

19 September 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
RLRongling Lang
Rongling Lang
HXHao Xu
Hao Xu
Fei GaoFei Gao
Fei Gao
DOA (Direction of Arrival), as an important observation parameter for accurately locating the Signals of Opportunity (SOP), is vital for navigation in GNSS-challenged environments and can be effectively obtained through sparse arrays. In practical application, array perturbations affect the estimation accuracy and stability of DOA, thereby adversely affecting the positioning performance of SOP. Against this backdrop, we propose an approach to reconstruct non-uniform arrays under perturbation conditions, aiming to improve the robustness of DOA estimation in sparse arrays. Firstly, we theoretically derive the mathematical expressions of the Cramér–Rao Bound (CRB) and Spatial Correlation Coefficient (SCC) for the uniform linear array (ULA) with perturbation. Then, we minimize CRB as the objective function to mitigate the adverse effects of array perturbations on DOA estimation, and use SCC as a constraint to suppress sidelobes. By doing this, the non-uniform array reconstruction model is formulated as a high-order 0–1 optimization problem. To effectively solve this nonconvex model, we propose a polynomial-time algorithm, which can converge to the optimal approximate solution of the original model. Finally, through a series of simulation experiments utilizing frequency modulation (FM) signal as an example, the exceptional performance of this method in array reconstruction has been thoroughly validated. Experimental data show that the reconstructed non-uniform array excels in DOA estimation accuracy compared to other sparse arrays, making it particularly suitable for estimating the direction of terrestrial SOP in perturbed environments.

1 January 2023 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
JTJianhua Tu
Jianhua Tu
JXJunyi Xiao
Junyi Xiao
RLRongling Lang
Rongling Lang
Let $ G $ be a graph. A dissociation set of $ G $ is a subset of vertices that induces a subgraph with vertex degree at most 1. The dissociation polynomial of $ G $ is $ D_{G}(\lambda) = \sum_{D \in \mathcal{D}(G)} \lambda^{|D|} $, where $ \mathcal{D}(G) $ is the set of all dissociation sets of $ G $. In this paper, we prove that for any cubic graph $ G $ and any $ \lambda \in(0, 1] $, $ \frac{1}{|V(G)|} \ln D_{G}(\lambda) \leq \frac{1}{4} \ln D_{K_4}(\lambda) $ with equality if and only if $ G $ is a disjoint union of copies of the complete graph $ K_{4} $. When $ \lambda = 1 $, the value of $ D_G(\lambda) $ is exactly the number of dissociation sets of $ G $. Hence, for any cubic graph $ G $ on $ n $ vertices, $ |\mathcal{D}(G)|\leq|\mathcal{D}(K_4)|^{n/4} = 11^{n/4}. $