1 November 2007 Point target detection of infrared images with eigentargets
Author Affiliations +
Optical Engineering, 46(11), 110502 (2007). doi:10.1117/1.2802301
Abstract
A novel detection method for infrared (IR) point targets based on eigentargets is presented. The conception of eigentargets is proposed by making reference to eigenfaces in the field of face recognition. After creating the target training images using the Gaussian intensity function, we refine our method and obtain eigentargets that are a group of eigenvectors of the training set. These eigenvectors are then used to calculate the target map, defined by a target map function, at every location in the image to be detected. The large values in the target map image indicate the presence of targets. In comparison with other commonly used detection methods, our method has better performance with better receiver operating characteristics, and larger signal-to-noise ratio (SNR) and background suppression factor.
Liu, Liu, Yang, Zhang, and Cao: Point target detection of infrared images with eigentargets

1.

Introduction

For infrared (IR) point targets, the background is usually contaminated by unknown noise, and the target-to-background contrast is very low, so it is very difficult to detect them. The issue of detecting targets can be viewed as a two-class pattern recognition problem.1 An image to be detected consists of a target class and a background class. We can use the pattern recognition algorithms to detect targets. In Ref. 1, the authors detected targets with the Fukunaga Koontz transform (FKT), which is a two-pattern recognition algorithm based on principal component analysis (PCA). Moreover, Chan 2 use neural networks to detect targets. Turk and Pentland applied PCA to face recognition and detection.3 In this letter, we make reference to this method to detect IR point targets.

2.

Eigentargets for Detection

Consider a set of N training target images {x1,x2,,xN} that are m×m in size. We convert them to column vectors {Γ1,Γ2,,ΓN} . The average target is defined by ψ=(1N)n=1NΓn . Then the covariance matrix can be calculated by

1

C=1Nn=1N(Γnψ)(Γnψ)T.
C is factorized into the form

2

C=ΦΔΦT,
where Φ is a matrix with the eigenvectors of C , and Δ is a diagonal matrix with the corresponding eigenvalues as elements of its main diagonal. We assume that the eigenvectors in Φ have been sorted into Φ={ϕ1,ϕ2,,ϕN} by descending order of corresponding eigenvalues Δ={Δ1,Δ2,,ΔN} . Then the first M eigenvectors

3

Φt={ϕ1,ϕ2,,ϕM},
in Φ are used to construct a subspace (the target space). We call Φt eigentargets. Eigentargets Φt represent the main feature of targets.

Given an image to be detected, at every pixel location (x,y) , an image vector Γ(x,y) is constructed whose size is equal to the size of the training images. This vector is projected into the target space by the following operations:

4

ωk=ϕkT(Γψ).
Ω=[ω1,ω2,,ωM] describes the contribution of each eigentarget in representing the input target image Γ(x,y) . Then we can obtain the reconstructed target image by

5

Φrt=k=1Mωkϕk.
Ordinarily, the Euclidian distance ϵ(x,y) between the unknown image vector Γ(x,y) and the reconstructed target image is used to detect faces in Ref. 3. It is formulated by

6

ϵ(x,y)=ΓψΦrt<θ,
where θ is a chosen threshold. The value of ϵ(x,y) is a face map in Ref. 3. The small values indicate the presence of faces. In this letter, we design a new map function to complete our detection task. It is defined by

7

ς(x,y)=exp[ϵ(x,y)22σ2].
The preceding map, the target map, can let all component values of ς(x,y) be elements of [0,1] for allowing meaningful comparisons across widely varying conditions. Moreover, Eq. 7 makes the large values indicate the presence of targets. This is more consistent with our intuition than Eq. 6, whose small values indicate the presence.

Apparently, eigenfaces and our eigentargets methods are supervised learning methods. For all supervised learning methods, the selection of the training set is very important for their performance. There are two approaches to generate the target training images. One is cropping from the real IR images to be detected. The other is using the synthetic images generated by the Gaussian intensity function.4 Two reasons support our using synthetic target images to construct the training set. The first reason is that cropping the real target images is difficult and troublesome because we do not know the location of targets before detection. The second reason is that the real images generally are contaminated by noise. Thus, they cannot precisely and correctly represent the feature of targets. The form of the Gaussian intensity function is

8

I(x,y)=Imaxexp{(12[(xx0)2σx2+(yy0)2σy2])}.
The pixel spread characteristics of simulated point targets are defined by the maximum intensity Imax , horizontal spread parameter σx , and vertical spread parameter σy . (x0,y0) is the center location of the target, and its intensity value is Imax . (x,y) is the location of other pixels. In Ref. 4 (Fig. 3), some simulated point targets are shown.

3.

Experiment and Results

We first compare the detection performance of the Fukunaga Koontz transform (FKT)1, 5 with that of eigentargets proposed by us under the same experimental conditions. Figure 1 shows the two experimental images to be used in this letter. The targets in Fig. 1 are very dim, so it is difficult to detect them from the background.

Fig. 1

The two experimental IR images and the comparison of the target map. (a1) and (b1) are the IR images to be detected. (a2) and (b2) are the target maps of eigentargets. (a3) and (b3) are their plots, respectively. (a4) and (b4) are the target maps of FKT. (a5) and (b5) are their plots, respectively.

110502_1_1.jpg

Generally speaking, the size of IR point targets is less than 100 pixels, so the size of training images is set as 11×11 in our experiments. For detecting potential targets from Fig. 1 (a1) and Fig. 1 (b1) , 100 target training images are created randomly by the Gaussian intensity function [Eq. 8]. The number of eigentargets in Eq. 3 is M=10 . The parameter in Eq. 7 is experientially set as σ=0.25 . FKT detection is executed according to the contents of Refs. 1, 5.

From Figs. 1 (a4) , 1 (a5) , 1 (b4) , and 1 (b5) , we can see that FKT has some large response points in the background because of the existence of the clutter. That means that its capability of suppressing the background is not strong. Moreover, the peaks at target locations are not distinct. The main cause of these disadvantages is that FKT cannot precisely capture the features of targets and backgrounds so that the shift-version targets and backgrounds also have strong responses, while we expect detection methods have a large response only at the pixel located at the center of the target. Figures 1 (a2) , 1 (a3) , 1 (b2) , and 1 (b3) show the results of eigentargets proposed by us. We can see that the outputs corresponding to the background pixels are small. That means that eigentargets have a better capability of suppressing the background. Furthermore, eigentargets make distinct peaks at the center location of every target. Thus, we can easily and precisely find the correct locations of targets.

The receiver operating characteristic (ROC)1 curve is a good tool for evaluating the performance of a detection method. Figure 2 shows ROC curves of eigentargets and FKT for detecting targets from two images of Fig. 1. The ROC curves are constructed by varying the detection threshold (ROC operating point). In Figs. 2a and 2b, when the false alarm is close to 0%, the lowest detection rate of eigentargets is 80%, while that of FKT is 0%. Moreover, the false alarm rate of eigentargets is much smaller than that of FKT, when the detection rate approached 100%, so the ROC curves indicate that eigentargets have a better performance than FKT.

Fig. 2

The ROC curves of eigentargets and FKT. (a) The ROC curve of detecting Fig. 1 (a1) . (b) The ROC curve of detecting Fig. 1 (b1) .

110502_1_2.jpg

To present further validation of the performance of eigentargets, we compare eigentargets with other detection methods such as FKT, max-median (MMed), max-mean (MMean),6 and two-dimensional LMS (TDLMS)7 by numerical values. Three metrics for small target detection, signal-to-noise ratio (SNR), signal-to-noise gain (SNRG) , and background suppression factor (BSF) , are used to evaluate the detection performance. They are defined by: SNR=SN , SNRG=SNRoutSNRin , and BSF=CinCout . S is the maximum amplitude of target signal (intensity), and N is the maximum amplitude of background signal. Cin is the standard deviation of the original background, and Cout is that of the target map background. Obviously, the larger the three metrics, the better the performance of the detection method is. Table 1 lists the values of three metrics for detecting the targets of Figs. 1 (a1) and 1 (b1) . From Table 1, we can see that the eigentargets (ET) proposed in this letter have larger SNR and BSF than other methods for every target, which means thateigentargets has the best detection performance.

Table 1

The performance comparison of the different detection methods for detecting targets from the two images of Fig. 1.

110502_1_t1.jpg

In conclusion, the experiments executed in this section validate that the eigentargets method can be used successfully to detect IR point targets.

4.

Conclusions

Referring to the concept of eigenfaces, we propose a novel detection method for IR point targets based on eigentargets. The Gaussian intensity function is used to generate the training images. Moreover, we design a target map function that can normalize the Euclidian distance but not directly use the Euclidian distance. In comparison with other detection methods, the eigentargets method outperforms other detection methods with larger SNR and BSF .

References

1.  A. Mahalanobis, R. Muise, S. Stanfill, and A. Nevel, “Design and application of quadratic correlation filters for target detection,” IEEE Trans. Aerosp. Electron. Syst.0018-9251 10.1109/TAES.2004.1337458 40(3), 837–850 (2004). Google Scholar

2.  L. A. Chan, S. Z. Der, and N. M. Nasrabadi, “Neural based target detectors for multi-band infrared imagery,” in Image Recognition and Classification, Algorithms, Systems, and Applications, B. Javidi Ed., pp. 1–36, Marcel Dekker, New York (2002). Google Scholar

3.  M. Turk and A. Pentland, “Eigenfaces for recognition,” J. Cogn Neurosci.0898-929X 3(1), 71–86 (1991). Google Scholar

4.  Zh. Liu, Ch. Chen, X. Sh, and X. Zou, “Detection of small objects in image data based on the nonlinear principal component analysis neural network,” Opt. Eng.0091-3286 10.1117/1.2050387 44(9), 093604 (2005). Google Scholar

5.  S. Sims and A. Mahalanobis, “Performance evaluation of quadratic correlation filters for target detection and discrimination in infrared imagery,” Opt. Eng.0091-3286 10.1117/1.1767195 43(8), 1705–1711 (2004). Google Scholar

6.  S. D. Deshpande, M H. Er, R. Venkateswarlu, and P. Chan, “Max-mean and max-median filters for detection of small targets,” Proc. SPIE0277-786X 10.1117/12.364049 3809, 74 (1999). Google Scholar

7.  T. Soni, J. R. Zeidler, and W. H. Ku, “Performance evaluation of 2-D adaptive prediction filters for detection of small objects in image data,” IEEE Trans. Image Process.1057-7149 10.1109/83.236534 2(3), 327–340 (1993). Google Scholar

Ruiming Liu, Erqi Liu, Jie Yang, Tianhao Zhang, Yuan Cao, "Point target detection of infrared images with eigentargets," Optical Engineering 46(11), 110502 (1 November 2007). http://dx.doi.org/10.1117/1.2802301
JOURNAL ARTICLE
3 PAGES


SHARE
KEYWORDS
Target detection

Infrared imaging

Infrared detectors

Signal to noise ratio

Infrared radiation

Target recognition

Principal component analysis

Back to Top