Graph-Regularized Laplace Approximation for Detecting Small Infrared Target Against Complex Backgrounds

Abstract

Against complex background containing the tiny target, high-performance infrared small target detection is always treated as a difficult task. Many low-rank recovery-based methods have shown great potential, but they may suffer from high false or missing alarm when encountering the background with intricate interferences. In this paper, a novel graph-regularized Laplace low-rank approximation detecting model (GRLA) is developed for infrared dim target scenes. Initially, a non-convex Laplace low-rank regularizer instead of the nuclear norm is employed to boost the accuracy of heterogeneous background estimation. Then, to maintain the intrinsic structure between background patch-image, the graph regularization is incorporated in the detecting model. Besides, aiming at reducing the nontarget outliers, a reweighted l1 norm with nonnegative constraint is used. Finally, the proposed model is extended to a generalized framework (G-GRLA) by replacing different non-convex rank functions. With the help of the alternating direction method of multiplier (ADMM), the solution of the proposed model is obtained by an iterative optimization scheme. The experimental results on extensive actual infrared images present the superior performance of our proposed method to compare with the state-of-the-art methods.

Keywords

• Small target detection
• nonconvex low-rank regularizer
• manifold information
• graph regularization
• l₁ norm with nonnegative constraint%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> reweighted <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">l</italic>₁ norm with nonnegative constraint