Compare the complexity of printed character recognition algorithms based on (a) template matching, (b) Fourier descriptors, and (c) moment matching.
(Matched filtering) Write the matched filter output SNR as
where G and U are Fourier transforms of g(m, n), u (m, n), respectively. Apply the Schwartz inequality to show that SNR is maximized only when (9.132) is satisfied within a scaling constant that can be set to unity. What is the maximum value of SNR?