1 / 29

Chapter 21

Chapter 21. R(x) Algorithm. a) Anomaly Detection b) Matched Filter. Definition of terms: A pixel can be represented by. (1). sub image containing N pixels designated by. (2). The target can be specified as an additive signal with a spatial shape characterized by:. (3).

ulf
Télécharger la présentation

Chapter 21

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 21 R(x) Algorithm • a) Anomaly Detection • b) Matched Filter

  2. Definition of terms: A pixel can be represented by (1) sub image containing N pixels designated by (2)

  3. The target can be specified as an additive signal with a spatial shape characterized by: (3) where we have normalized the pixel intensities in the spatial descriptor such that (4)

  4. The spectral signature of the target (in an additive sense) is characterized by: (5)

  5. The Statistical Model suggests that the optimum filter is based on the joint probability distribution of the signal x under the hypothesis H0 no target and H1 target present

  6. the demeaned data in a local window with spectral covariance M would have a joint probability distribution described by Gaussian statistics as (6) When a target is present the mean will be shifted by the additive signal and the joint distribution can be expressed as: (7)

  7. A constant false alarm rate (CFAR) detector that will optimize detection (given our assumptions are valid) is the log likelihood ratio test (i.e. the log of the probabilities) expressed as (8)

  8. simplifying and moving non-data driven terms into a modified threshold we obtain the detector (9) or more compactly the output of this linear matched filter can be expressed as (10)

  9. Graphical Interpretation First recall that the covariance matrix can be represented in terms of the Eigen vectors and eigen values as: where P is the matrix of ordered Eigen vectors Λ is the diagonal matrix of ordered Eigen values . Finally, recall that Equation 10 expressed in terms of the output for each pixel (n) produced by the spectral operator yields (11) (12) and (13) (14)

  10. Returning to Matrix algebra recall that Λ-1 must satisfy the equation (15)

  11. this means that Λ-1 must be made up of the reciprocal of the Eigen values i.e. (16)

  12. Stocker figure 1

  13. Stocker figure 3

  14. Stocker figure 4

  15. Post multiplication of the target projection term bTP by Λ-1 in Equation 14 thus yield a J element row vector whose elements are the projection of the additive target spectrum onto the eigen values and optimally weighed by the inverse of the eigen values (i.e. the reciprocal). Finally, the dot product of the row and column vectors yields a matched filter gain weighed by the eigen values (inversely weighed) to accentuate the difference of target from clutter.

  16. Implementation a constant false alarm rate CFAR detector can be obtained by normalizing the optimized matched filter using a detector of the form (17) where the numerator is the squared matched filter from Equation 10 and the denominator normalizes for variation in the local clutter covariance and the correlation of the target with the local clutter.

  17. The locally adaptive CFAR detector can then be implemented using the following steps 1. Compute the local mean vector on a window of N pixels about a pixel center of interest and demean the data locally according to (18) 2. Compute the local covariance according to (19)

  18. recall that X is the J X N matrix made up of the N demeaned J band pixel vectors comprising the local window (20)

  19. Stocker figure 7

  20. The locally adaptive CFAR detector can then be implemented using the following steps illustrated in Figure 7 from Stocker et al. 1990. Con’t 3. Compute the local additive target vector 4. Compute the spectral filter and apply it to the image . 5. Using the normalized target shape vector s, apply the spatial matched filter to the spectrally filtered product and square the result 6. Compute the local normalization value of and multiply the output of Step 5 to obtain the r(x) value. 7. Apply the desired CFAR threshold to locate detections.

  21. Unknown target spectrum In many cases, the target spectrum may not be well known or known at all. Stocker et al.1990 suggest one way to deal with this situation is to generate a filter bank of possable filters designed to span the spectral space (either all space for the unknown target or a possable target range for the poorly known target). However, they point out that there will clearly be a performance loss due to the difference between the postulated target spectrum used in the filter production and the true target spectrum. Further, they show that to maintain this loss at reasonable levels, the size of the filter bank grows extremely large as the number of bands increase (c.f. Figure 10 from Stocker et al. 1990).

  22. Stocker Figure 10

  23. anomaly detector designed to find "target" spectra differing from the clutter but without a specific target spectral signature. In this case, the best estimate of the target signature can be expressed in terms of the normalized target shape as: (22) Substituting into 10 and including scene-derived estimates for all parameters yields (23) the overall signal to clutter ratio expressed as: (24)

  24. Stocker figure 8

  25. Stocker figure 11

  26. Stocker figures 12,13

  27. . . . . . Figure A From page 9

  28. Stocker figure 14

More Related