Fast Low Rank and Sparse Decomposition Based on Greedy Bilateral Smoothing for Infrared Small Target Detection
The efficient and accurate detection of infrared small targets under various heterogeneous backgrounds has always been a key issue that needs to be addressed. To address this issue, this study presents a fast and robust low rank and sparse decomposition algorithm for infrared small target detection....
Saved in:
Main Authors: | Yan-Shan Zhang, Ze-Yin Li, Dong-Dong Pang, Lu-Yao Wang, Cheng-Jun Wu, Kang Duan, Jun-Ming Gao |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10806708/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Greedy algorithms: a review and open problems
by: Andrea García
Published: (2025-02-01) -
Greedy Algorithm for Deriving Decision Rules from Decision Tree Ensembles
by: Evans Teiko Tetteh, et al.
Published: (2025-01-01) -
A novel perturbation attack on SVM by greedy algorithm
by: Yaguan QIAN, et al.
Published: (2019-01-01) -
Research on weak greedy routing over graph embedding for wireless sensor networks
by: LI Zhi-gang1, et al.
Published: (2011-01-01) -
Compressive SAR Imaging Based on Modified Low-Rank and Sparse Decomposition
by: Jeong-Il Byeon, et al.
Published: (2025-01-01)