Yuhang Ming

Dr. Yuhang Ming

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
29 November 2024 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
YMYuhang Ming
Yuhang Ming
XYXingrui Yang
Xingrui Yang
WWWeihan Wang
Weihan Wang
ZCZheng Chen
Zheng Chen
JFJinglun Feng
Jinglun Feng
GZGuofeng Zhang
Guofeng Zhang

20 March 2025 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YMYuhang Ming
Yuhang Ming
DMDi Ma
Di Ma
WDWeichen Dai
Weichen Dai
HYHan Yang
Han Yang
RFRui Fan
Rui Fan
Wanzeng KongWanzeng Kong
Wanzeng Kong
Targeting the notorious cumulative drift errors in NeRF SLAM, we propose a Semantic-guided Loop Closure using Shared Latent Code, dubbed SLC$^{2}$-SLAM. We argue that latent codes stored in many NeRF SLAM systems are not fully exploited, as they are only used for better reconstruction. In this paper, we propose a simple yet effective way to detect potential loops using the same latent codes as local features. To further improve the loop detection performance, we use the semantic information, which are also decoded from the same latent codes to guide the aggregation of local features. Finally, with the potential loops detected, we close them with a graph optimization followed by bundle adjustment to refine both the estimated poses and the reconstructed scene. To evaluate the performance of our SLC$^{2}$-SLAM, we conduct extensive experiments on Replica and ScanNet datasets. Our proposed semantic-guided loop closure significantly outperforms the pre-trained NetVLAD and ORB combined with Bag-of-Words, which are used in all the other NeRF SLAM with loop closure. As a result, our SLC$^{2}$-SLAM also demonstrated better tracking and reconstruction performance, especially in larger scenes with more loops, like ScanNet.

5 February 2025 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YMYuhang Ming
Yuhang Ming
MXMinyang Xu
Minyang Xu
XYXingrui Yang
Xingrui Yang
WYWeicai Ye
Weicai Ye
WWWeihan Wang
Weihan Wang
Wanzeng KongWanzeng Kong
Wanzeng Kong
Visual place recognition (VPR) is essential to many autonomous systems. Existing VPR methods demonstrate attractive performance at the cost of limited generalizability. When deployed in unseen environments, these methods exhibit significant performance drops. Targeting this issue, we present VIPeR, a novel approach for visual incremental place recognition with the ability to adapt to new environments while retaining the performance of previous ones. We first introduce an adaptive mining strategy that balances the performance within a single environment and the generalizability across multiple environments. Then, to prevent catastrophic forgetting in continual learning, we design a novel multi-stage memory bank for explicit rehearsal. Additionally, we propose a probabilistic knowledge distillation to explicitly safeguard the previously learned knowledge. We evaluate our proposed VIPeR on three large-scale datasets—Oxford Robotcar, Nordland, and TartanAir. For comparison, we first set a baseline performance with naive finetuning. Then, several more recent continual learning methods are compared. Our VIPeR achieves better performance in almost all aspects with the biggest improvement of 13.85% in average performance.

11 February 2026 in Neurocomputing
Verified
Journal Article
Closed access
XYXingyuan Yu
Xingyuan Yu
WYWeicai Ye
Weicai Ye
XGXiyue Guo
Xiyue Guo
YMYuhang Ming
Yuhang Ming
JLJinyu Li
Jinyu Li
GZGuofeng Zhang
Guofeng Zhang

18 November 2024 in IEEE Signal Processing Letters
Verified
Journal Article
Closed access
HYHangjie Yi
Hangjie Yi
JQJingsheng Qian
Jingsheng Qian
YMYuhang Ming
Yuhang Ming
Wanzeng KongWanzeng Kong
Wanzeng Kong
The Steady State Visual Evoked Potential (SSVEP) paradigm has been widely employed in various Brain-Computer Interface (BCI) systems. However, recent studies indicate that SSVEP is vulnerable to adversarial attacks, resulting in manipulated results and drastic degradation in recognition performance, which pose inconveniences and even risks to users. Noticing the fact that the adversarial attack on SSVEP is done by adding subtle waveform perturbations into random EEG channels, we propose Independent Components Time-Frequency Purification with Channel Consensus (ICTFP-CC) as a defensive strategy. In particular, we first detect and remove suspicious perturbations with independent component analysis from the time and frequency domain, and then reconstruct the purified EEG signals. Additionally, we introduce a voting mechanism to achieve channel consensus and enhance overall robustness. We conducted experiments on two public datasets and three SSVEP recognition algorithms. The results demonstrate that our method can significantly improve the classification accuracy and information transfer rate of attacked SSVEP signals by a maximum of 46.79 (%) and 62.87 (bits/min).

7 October 2023
Verified
Book Chapter
Closed access
PDF file
YLYanan Liu
Yanan Liu
HNHepeng Ni
Hepeng Ni
CYChao Yuwen
Chao Yuwen
XYXinyu Yang
Xinyu Yang
YMYuhang Ming
Yuhang Ming
LRLiang Ran
Liang Ran