Infrared Small Target Detection via Non-Convex Rank Approximation Minimization Joint l2,1 Norm

To improve the detection ability of infrared small targets in complex backgrounds, a novel method based on non-convex rank approximation minimization joint l2,1 norm (NRAM) was proposed. Due to the defects of the nuclear norm and l1 norm, the state-of-the-art infrared image-patch (IPI) model usually...

Full description

Saved in:
Bibliographic Details
Published in:Remote sensing (Basel, Switzerland) Switzerland), 2018-11, Vol.10 (11), p.1821
Main Authors: Zhang, Landan, Peng, Lingbing, Zhang, Tianfang, Cao, Siying, Peng, Zhenming
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Complexity
Computer applications
Convex analysis
infrared image
Infrared imagery
International conferences
Mathematical analysis
Methods
Noise
non-convex rank approximation minimization
Optimization
Remote sensing
small target detection
Sparsity
structured norm
Target detection
Target recognition
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:To improve the detection ability of infrared small targets in complex backgrounds, a novel method based on non-convex rank approximation minimization joint l2,1 norm (NRAM) was proposed. Due to the defects of the nuclear norm and l1 norm, the state-of-the-art infrared image-patch (IPI) model usually leaves background residuals in the target image. To fix this problem, a non-convex, tighter rank surrogate and weighted l1 norm are instead utilized, which can suppress the background better while preserving the target efficiently. Considering that many state-of-the-art methods are still unable to fully suppress sparse strong edges, the structured l2,1 norm was introduced to wipe out the strong residuals. Furthermore, with the help of exploiting the structured norm and tighter rank surrogate, the proposed model was more robust when facing various complex or blurry scenes. To solve this non-convex model, an efficient optimization algorithm based on alternating direction method of multipliers (ADMM) plus difference of convex (DC) programming was designed. Extensive experimental results illustrate that the proposed method not only shows superiority in background suppression and target enhancement, but also reduces the computational complexity compared with other baselines.
ISSN:2072-4292
2072-4292
DOI:10.3390/rs10111821