DCSP-17: Matched Filter Jianfeng Feng Department of Computer Science Warwick Univ., UK

Slides:



Advertisements
Similar presentations
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advertisements

§ 1.10 Properties of the Real Number System. Angel, Elementary Algebra, 7ed 2 Commutative Property Commutative Property of Addition If a and b represent.
Slide 1 Insert your own content. Slide 2 Insert your own content.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 75.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
Chapters 1 & 2 Theorem & Postulate Review Answers
E status report Alexandre Camsonne Hall A Jefferson Laboratory Hall A collaboration meeting December 13 th 2007.
How many hours have passed from 6:00 P.M. to 9:00 P.M.? C. 3 hours B. 6 hoursA. 9 hours.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
CS4026 Formal Models of Computation Running Haskell Programs – power.
DCSP-3: Fourier Transform (continuous time) Jianfeng Feng
DCSP-10 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-17 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-2: Fourier Transform I Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-12 Jianfeng Feng
DCSP-13 Jianfeng Feng
DCSP-5: Noise Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-14 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-8: Minimal length coding I Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-21 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-4: Modem Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-20 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-7: Information Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-1: Introduction Jianfeng Feng. DCSP-1: Introduction Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-22 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-3: Fourier Transform Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-11 Jianfeng Feng
DSPRevision I
DCSP-12 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-16 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Digital Filter Banks The digital filter bank is set of bandpass filters with either a common input or a summed output An M-band analysis filter bank is.
O X Click on Number next to person for a question.
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
5.9 + = 10 a)3.6 b)4.1 c)5.3 Question 1: Good Answer!! Well Done!! = 10 Question 1:
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
5 Locus Contents 5.1 Introduction to Locus
Linear Time Methods for Propagating Beliefs Min Convolution, Distance Transforms and Box Sums Daniel Huttenlocher Computer Science Department December,
EE-M /7, EF L17 1/12, v1.0 Lecture 17: ARMAX and other Linear Model Structures Dr Martin Brown Room: E1k, Control Systems Centre
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
This, that, these, those Number your paper from 1-10.
10-6 Solving Quadratic Equations by Factoring
Properties of Exponents
Addition 1’s to 20.
Double Side Band Suppressed Carrier
Probabilistic Tracking and Recognition of Non-rigid Hand Motion
25 seconds left…...
Test B, 100 Subtraction Facts
Click your mouse to move the card ahead! Work with a buddy using two Abacuses. First click and follow along using your abacus. After each click talk about.
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
1 MA 1128: Lecture 05 – 9/12/14 Inequalities And Absolute Values.
O X Click on Number next to person for a question.
Idan Zaguri Ran Tayeb 2014 Parallel Random Number Generator.
DCSP-15 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-4: Modem Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-8: Minimal length coding I Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-15: Matched Filter Jianfeng Feng Department of Computer Science Warwick Univ., UK
Presentation transcript:

DCSP-17: Matched Filter Jianfeng Feng Department of Computer Science Warwick Univ., UK

Filters Stop or allow to pass for certain signals as we have talked before Detect certain signals such as radar etc

Matched filters 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 At time 1

Matched filters 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 At time 2

Matched filters 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 At time 3

Matched filters X=( 0,0,0.0,0,0, 0,0,0,1,1,-1,1,-1, 0,0,0,0,0, 0,0,0,0,0, 0 …) To develop a filter to detect the arriving of the signal (1,1,-1,1,-1).

y(n)= a(0) x(n)+ a(1) x(n-1)+…+ a(N) x(n-N) find a = ( a(0),a(1),a(2),a(3),a(4) ) ???? X=( 0,0,0.0, 0, 0, 0, 0, 0, 1, 1, -1, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0,0,0, 0 …) at time zero, a tank or a flight is appeared and detected by a radar.

y(-9) = a(0) x(-9)+ a(1) x(-10)+ a(2) x(-11) + a(3) x(-12) +a(4) x(-13) = 0 y(-8) = a(0) x(-8)+ a(1) x(-9) + a(2) x(-10) +a(3) x(-11) +a(4) x(-12) = 0 … y(-4) = a(0) x(-4)+ a(1) x(-5) + a(2) x(-6) +a(3) x(-7) +a(4) x(-8) = a(0) y(-3) = a(0) x(-3)+ a(1) x(-4) + a(2) x(-5) +a(3) x(- 6) +a(4) x(-7) = a(0)+a(1) y(-2) = a(0) x(-2)+ a(1) x(-3) + a(2) x(-4) +a(3) x(-5) +a(4) x(-6) = -a(0)+a(1)+a(2) y(-1) = a(0) x(-1)+ a(1) x(-2) + a(2) x(-3) +a(3) x(-4) +a(4) x(-5) = a(0)-a(1)+a(2)+a(3) y(0) = a(0) x(0)+ a(1) x(-1) + a(2) x(-2) +a(3) x(-3) +a(4) x(-4) = -a(0)+a(1)-a(2)+a(3)+a(4) y(1 ) = a(0) x(1)+ a(1) x(0) + a(2) x(-1) +a(3) x(-2) +a(4) x(-3) = -a(1)+a(2)-a(3)+a(4) …..

We have The equality is true if and only if a (i) = x (-i)

Matched Filter A filter is called a matched filter for sequence s if Advantage: easy to implement and efficient Disadvantage: we know the exact signal we want to detect before hand. Also known as Linear correlation detector

time

Question: Could you develop a matched filter to detect it? y (0) = a(0) x(0) + a(1) x(-1) + a(2) x(-2) + a(3) x(-3) +a(4) x(-4) + a(5)x(-5) = a(0) a(0) + a(1) a(1) +a(2)a(2) +a(3)a(3) + a(4)a(4)+a(5)a(5) 2ab <= a^2 + b^2 and the equality holds iff a=b

Correlation

r xx (0) r xx (1) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2)

Correlation between two sequences

r xy (0) r xy (1) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) y(1)y(8)y(9)y(10)y(11)y(12)y(3)y(4)y(5)y(6)y(7)y(2) X(1)X(8)X(9)X(10)X(11)X(12)X(3)X(4)X(5)X(6)X(7)X(2) y(1)y(8)y(9)y(10)y(11)y(12)y(3)y(4)y(5)y(6)y(7)y(2)

Correlation measures the difference between two objects

D(X,Y)= 2 – 2 r XY (0) if we assume that ||X|| = || Y || =1.

Image Enhancement Contrast enhancement

Ideas: Look at the following two images, generated from the following Matlab code x1=abs(1*randn(205,232)); figure, imshow(x1); X2=(rand(205,232)); figure,imshow(x2);

grey level

grey level

Property For a random variable X, let F be its distribution function i.e. F(x) = P(X<= x) Then the distribution of F(X) is uniform P(F(X) <=x)=x

Histogram Equalization Note how the image is extremely grey; it lacks detail since the