Open AccessLocal contrast measure with iterative error for infrared small target detection
Author(s) -
Yan Zujing,
Xin Yunhong,
Zhang Yixuan
Publication year - 2020
Publication title -
iet image processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.401
H-Index - 45
eISSN - 1751-9667
pISSN - 1751-9659
DOI - 10.1049/iet-ipr.2020.1157
Subject(s) - measure (data warehouse) , false alarm , contrast (vision) , pixel , computer science , block (permutation group theory) , algorithm , brightness , filter (signal processing) , constant false alarm rate , artificial intelligence , block size , mathematics , pattern recognition (psychology) , computer vision , optics , physics , geometry , database , computer security , key (lock)
Local contrast measure (LCM) has been proved to be an effective method for infrared small target detection. However, the detection performance of LCM decreases dramatically when the background contains strong edges and pixel‐sized noises with high brightness (PNHB). Based on the analysis of the inherent causes of the poor performance of LCM in extremely complex backgrounds, this study presents an effective LCM with an iterative error. The contribution is as follows: first, the two‐dimensional least mean square (TDLMS) filter with an adaptive parameter is applied to suppress the background clutters roughly in each multiscale window. Then, the partial maximum pixel mean is applied to the LCM to optimise the sub‐block statistical parameters, which achieves excellent strong edges suppression performance. Finally, the iteration error generated by TDLMS and the sub‐block weight matrix is updated alternately to further optimise the statistical parameters of the contrast measure to make it more effective in suppressing PNHB. Experimental results demonstrate that the proposed approach is not only superior to the contrast methods in terms of high detection efficiency and low false alarm rate but also has satisfactory adaptability under extremely complex backgrounds.