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

Slides:



Advertisements
Similar presentations
Tests of Static Asset Pricing Models
Advertisements

ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The Linear Prediction Model The Autocorrelation Method Levinson and Durbin.
Object Specific Compressed Sensing by minimizing a weighted L2-norm A. Mahalanobis.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
2 – In previous chapters: – We could design an optimal classifier if we knew the prior probabilities P(wi) and the class- conditional probabilities P(x|wi)
NASSP Masters 5003F - Computational Astronomy Lecture 5: source detection. Test the null hypothesis (NH). –The NH says: let’s suppose there is no.
AGC DSP AGC DSP Professor A G Constantinides©1 Modern Spectral Estimation Modern Spectral Estimation is based on a priori assumptions on the manner, the.
Budapest May 27, 2008 Unifying mixed linear models and the MASH algorithm for breakpoint detection and correction Anders Grimvall, Sackmone Sirisack, Agne.
Fast Bayesian Matching Pursuit Presenter: Changchun Zhang ECE / CMR Tennessee Technological University November 12, 2010 Reading Group (Authors: Philip.
Integration of sensory modalities
The General Linear Model. The Simple Linear Model Linear Regression.
La Parguera Hyperspectral Image size (250x239x118) using Hyperion sensor. INTEREST POINTS FOR HYPERSPECTRAL IMAGES Amit Mukherjee 1, Badrinath Roysam 1,
Linear Algebraic Equations
Visual Recognition Tutorial
Development of Empirical Models From Process Data
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
Class 25: Question 1 Which of the following vectors is orthogonal to the row space of A?
Lecture II-2: Probability Review
Separate multivariate observations
Adaptive Signal Processing
Today Wrap up of probability Vectors, Matrices. Calculus
Chapter 12 Spatial Sharpening of Spectral Image Data.
Linear Algebra and Image Processing
Data Selection In Ad-Hoc Wireless Sensor Networks Olawoye Oyeyele 11/24/2003.
EE513 Audio Signals and Systems Statistical Pattern Classification Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Example Clustered Transformations MAP Adaptation Resources: ECE 7000:
Presentation by: H. Sarper
Principles of Pattern Recognition
Statistics and Linear Algebra (the real thing). Vector A vector is a rectangular arrangement of number in several rows and one column. A vector is denoted.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Remote Sensing Supervised Image Classification. Supervised Image Classification ► An image classification procedure that requires interaction with the.
CHAPTER 4 Adaptive Tapped-delay-line Filters Using the Least Squares Adaptive Filtering.
Baseband Demodulation/Detection
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Conjugate Priors Multinomial Gaussian MAP Variance Estimation Example.
SUPA Advanced Data Analysis Course, Jan 6th – 7th 2009 Advanced Data Analysis for the Physical Sciences Dr Martin Hendry Dept of Physics and Astronomy.
Detection and estimation of abrupt changes in Gaussian random processes with unknown parameters By Sai Si Thu Min Oleg V. Chernoyarov National Research.
USE OF KERNELS FOR HYPERSPECTRAL TRAGET DETECTION Nasser M. Nasrabadi Senior Research Scientist U.S. Army Research Laboratory, Attn: AMSRL-SE-SE 2800 Powder.
1 Chapter 9 Detection of Spread-Spectrum Signals.
Chapter 12 Object Recognition Chapter 12 Object Recognition 12.1 Patterns and pattern classes Definition of a pattern class:a family of patterns that share.
Chapter 28 Cononical Correction Regression Analysis used for Temperature Retrieval.
Class 26: Question 1 1.An orthogonal basis for A 2.An orthogonal basis for the column space of A 3.An orthogonal basis for the row space of A 4.An orthogonal.
1 CLUSTER VALIDITY  Clustering tendency Facts  Most clustering algorithms impose a clustering structure to the data set X at hand.  However, X may not.
Principal Component Analysis (PCA)
Spectrum Sensing In Cognitive Radio Networks
Baseband Receiver Receiver Design: Demodulation Matched Filter Correlator Receiver Detection Max. Likelihood Detector Probability of Error.
Point Distribution Models Active Appearance Models Compilation based on: Dhruv Batra ECE CMU Tim Cootes Machester.
Visual Tracking by Cluster Analysis Arthur Pece Department of Computer Science University of Copenhagen
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Kalman Filter with Process Noise Gauss- Markov.
Performance of Digital Communications System
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
Notes Over 4.2 Finding the Product of Two Matrices Find the product. If it is not defined, state the reason. To multiply matrices, the number of columns.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
Date of download: 7/2/2016 Copyright © 2016 SPIE. All rights reserved. Illustration of quantities in Eq. : Ath is the ratio of the striped area under the.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Statistical Interpretation of Least Squares ASEN.
Labwork 3.
STATISTICAL ORBIT DETERMINATION Kalman (sequential) filter
(5) Notes on the Least Squares Estimate
Orthogonal Subspace Projection - Matched Filter
Hourglass Processing Approach (AIG)
Chapter 10: Solving Linear Systems of Equations
Fitting Curve Models to Edges
Unfolding Problem: A Machine Learning Approach
Modern Spectral Estimation
EE513 Audio Signals and Systems
5.4 General Linear Least-Squares
J. Ellis, F. Jenet, & M. McLaughlin
Parametric Methods Berlin Chen, 2005 References:
Unfolding with system identification
16. Mean Square Estimation
Fundamentals of Spatial Filtering
Presentation transcript:

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

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

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

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

The Statistical Model suggests that the optimum filter is based on the joint probability distribution of the signal x under the hypothesis H 0 no target and H 1 target present

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

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

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 Graphical Interpretation and (11) (12) (13) (14)

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

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

Stocker figure 1

Stocker figure 3

Stocker figure 4

Post multiplication of the target projection term b T P 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.

a constant false alarm rate CFAR detector can be obtained by normalizing the optimized matched filter using a detector of the form (17) Implementation 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.

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 2. Compute the local covariance according to (18) (19)

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

Stocker figure 7

The locally adaptive CFAR detector can then be implemented using the following steps illustrated in Figure 7 from Stocker et al 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.

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).

Stocker Figure 10

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: Substituting into 10 and including scene-derived estimates for all parameters yields the overall signal to clutter ratio expressed as: (22) (23) (24)

Stocker figure 8

Stocker figure 11

Stocker figures 12,13

Figure A From page

Stocker figure 14