2022
DOI: 10.1016/j.infrared.2022.104222
|View full text |Cite
|
Sign up to set email alerts
|

Infrared small target detection using kernel low-rank approximation and regularization terms for constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 49 publications
0
4
0
Order By: Relevance
“…The data structure-based methods, for instance infrared patch-image (IPI) model [18], total variation weighted lowrank constraint method [19], and kernel robust principal component analysis model [20], distinguish infrared targets from background according to their different structural features, such as the sparsity of the target and low-rank of the background. Zhang et al [21] designed a model based on nonconvex rank approximation minimization joint norm (NRAM) to improve the detection ability of infrared small targets in complex background.…”
Section: Atraditional Methodsmentioning
confidence: 99%
“…The data structure-based methods, for instance infrared patch-image (IPI) model [18], total variation weighted lowrank constraint method [19], and kernel robust principal component analysis model [20], distinguish infrared targets from background according to their different structural features, such as the sparsity of the target and low-rank of the background. Zhang et al [21] designed a model based on nonconvex rank approximation minimization joint norm (NRAM) to improve the detection ability of infrared small targets in complex background.…”
Section: Atraditional Methodsmentioning
confidence: 99%
“…On one hand, some methods have used prior constraints, including Column-Weighted IPI (WIPI) [18], Non-negative IPI with Partial Sum (NIPPS) [20], and Re-Weighted IPI (ReWIPI) [21]. On the other hand, some studies have identified limitations in the nuclear norm and L1 norm and, so, alternative norms to achieve improved target representation and background suppression have been proposed; for example, Non-convex Rank Approximation Minimization (NRAM) [22] and Non-convex Optimization with Lp norm Constraint (NOLC) [23] introduce non-convex matrix rank approximation coupled with L2,1 norm and Lp norm regularization, while Total Variation Weighted Low-Rank (TVWLR) [24], Kernel Robust Principal Component Analysis (KRPCA) [25] introduce total variation regularization, High Local Variance (HLV) [26] method present LV* norm to constrain the background's local variance. Patch-based methods mainly consider the low-rank nature of the background, affecting their performance in the presence of strong edges.…”
Section: Patch-based Methodsmentioning
confidence: 99%
“…The most popular method is Infrared Patch-Image (IPI) [17], which uses a sliding window technique to generate a corresponding patch image from the original image. Due to its outstanding performance, many studies [18][19][20][21][22][23][24][25][26] have been conducted on IPI, which typically yields superior results. However, patch-based methods still have two problems: (1) The misclassification of strong edges as sparse target components, and (2) the time-consuming nature of the method.…”
Section: Introductionmentioning
confidence: 99%
“…However, in the presence of strong bright noise in the backgrounds, they may result in higher false alarm rates. LRM-based methods [16]- [20] treat the infrared image as a low-rank sparse matrix, and introduce the low-rank matrix reconstruction to filter the targets with the backgrounds. Since the intensity of the target is not significant with respect to the intensity of the backgrounds, these methods do not detect targets under various shapes well.…”
Section: Introductionmentioning
confidence: 99%