<< Chapter < Page Chapter >> Page >

For example, consider the target signal given in [link] and the set of two signals given in [link] . By inspection, it is clear that the signal g 2 is most like the target signal f . However, to make that conclusion mathematically, we use the matched filter detector with the L 2 inner product. If we were to actually make the necessary computations, we would first normalize each signal and then compute the necessary inner products in order to compare the signals in X with the target signal f . We would notice that the absolute value of the inner product for g 2 with f when normalized is greater than the absolute value of the inner product of g 1 with f when normalized, mathematically stated as

g 2 = argmax x { g 1 , g 2 } x | | x | | , f | | f | | .

Template signal

We wish to find a match for this target signal in the set of signals below.

Candidate signals

We wish to find a match for the above target signal in this set of signals.

Pattern detection

A somewhat more involved matched filter detector scheme would involve attempting to match a target time limited signal y = f to a set of of time shifted and windowed versions of a single signal X = { w S t g | t R } indexed by R . The windowing funtion is given by w ( t ) = u ( t - t 1 ) - u ( t - t 2 ) where [ t 1 , t 2 ] is the interval to which f is time limited. This scheme could be used to find portions of g that have the same shape as f . If the absolute value of the inner product of the normalized versions of f and w S t g is large, which is the absolute value of the normalized correlation for standard inner products, then g has a high degree of “likeness” to f on the interval to which f is time limited but left shifted by t . Of course, if f is not time limited, it means that the entire signal has a high degree of “likeness” to f left shifted by t .

Thus, in order to determine the most likely locations of a signal with the same shape as the target signal f in a signal g we wish to compute

t m = argmax t R f | | f | | , w S t g | | w S t g | |

to provide the desired shift. Assuming the inner product space examined is L 2 ( R (similar results hold for L 2 ( R [ a , b ) ) , l 2 ( Z ) , and l 2 ( Z [ a , b ) ) ), this produces

t m = argmax t R 1 | | f | | | | w S t g | | - f ( τ ) w ( τ ) g ( τ - t ) ¯ d τ .

Since f and w are time limited to the same interval

t m = argmax t R 1 | | f | | | | w S t g | | t 1 t 2 f ( τ ) g ( τ - t ) ¯ d τ .

Making the subsitution h ( t ) = g ( - t ) ¯ ,

t m = argmax t R 1 | | f | | | | w S t g | | t 1 t 2 f ( τ ) h ( t - τ ) d τ .

Noting that this expression contains a convolution operation

t m = argmax t R ( f * h ) ( t ) | | f | | | | w S t g | | .

where h is the conjugate of the time reversed version of g defined by h ( t ) = g ( - t ) ¯ .

In the special case in which the target signal f is not time limited, w has unit value on the entire real line. Thus, the norm can be evaluated as | | w S t g | | = | | S t g | | = | | g | | = | | h | | . Therefore, the function reduces to t m = argmax t R ( f * h ) ( t ) | | f | | | | h | | where h ( t ) = g ( - t ) ¯ . The function f g = ( f * h ) ( t ) | | f | | | | h | | is known as the normalized cross-correlation of f and g .

Hence, this matched filter scheme can be implemented as a convolution. Therefore, it may be expedient to implement it in the frequency domain. Similar results hold for the L 2 ( R [ a , b ) ) , l 2 ( Z ) , and l 2 ( Z [ a , b ] ) spaces. It is especially useful to implement the l 2 ( Z [ a , b ] ) cases in the frequency domain as the power of the Fast Fourier Transform algorithm can be leveraged to quickly perform the computations in a computer program. In the L 2 ( R [ a , b ) ) and l 2 ( Z [ a , b ] ) cases, care must be taken to zero pad the signal if wrap-around effects are not desired. Similar results also hold for spaces on higher dimensional intervals with the same inner products.

Of course, there is not necessarily exactly one instance of a target signal in a given signal. There could be one instance, more than one instance, or no instance of a target signal. Therefore, it is often more practical to identify all shifts corresponding to local maxima that are above a certain threshold.

The signal in [link] contains an instance of the template signal seen in [link] beginning at time t = s 1 as shown by the plot in [link] . Therefore,

s 1 = argmax t R f | | f | | , w S t g | | w S t g | | .

Pattern signal

This function shows tha pattern we are looking for in the signal below, which occurs at time t = s 1 .

Longer signal

This signal contains an instance of the above signal starting at time t = s 1 .

Absolute value of output

This signal shows a sketch of the absolute value of the matched filter output for the interval shown. Note that this was just an "eyeball approximation" sketch. Observe the pronounced peak at time t = s 1 .

Cauchy-schwarz inequality video lecture

Proof of the cauchy-schwarz inequality

Video lecture on the proof of the Cauchy-Schwarz inequality from Khan Academy. Only part of the theorem is proven.

Cauchy-schwarz inequality summary

As can be seen, the Cauchy-Schwarz inequality is a property of inner product spaces over real or complex fields that is of particular importance to the study of signals. Specifically, the implication that the absolute value of an inner product is maximized over normal vectors when the two arguments are linearly dependent is key to the justification of the matched filter detector. Thus, it enables the use of matched filters for such pattern matching applications as image detection, communications demodulation, and radar signal analysis.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Signal and information processing for sonar. OpenStax CNX. Dec 04, 2007 Download for free at http://cnx.org/content/col10422/1.5
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Signal and information processing for sonar' conversation and receive update notifications?

Ask