Abstract

A common pattern recognition problem is finding a library object which most closely matches a received image. For additive white Gaussian input noise, optimal detection performance is obtained using a matched filter for each of the N possible library objects. The use of composite matched filters (CMFs) (also called synthetic discriminant functions or linear combination filters) is one technique of reducing the number of filters required for the recognition problem. For two-level composite matched filter outputs, the reduction is from N to Q = log₂ (N) filters. The CMF's performance, however, can be suboptimum. Using CMFs with bipolar (+1,−1) outputs, this paper examines the detection performance improvement obtained by using error correcting codes. Use of varying levels of error correction is shown to allow trade-off between detection probability and the number of bank filters. Also, we show that in the case of inexact processing, the CMF can perform better than the conventional matched filter.

© 1987 Optical Society of America

Composite matched filter output partitioning

Robert J. Marks, James A. Ritcey, Les E. Atlas, and Kwan F. Cheung
Appl. Opt. 26(11) 2274-2278 (1987)

Composite matched filtering with error correction

Robert J. Marks and Les E. Atlas
Opt. Lett. 12(2) 135-137 (1987)

Error-correction coding in an associative processor

Suzanne Liebowitz and David Casasent
Appl. Opt. 26(6) 999-1006 (1987)

Performance analysis of associative memories with nonlinearities in the correlation domain

R. J. Marks, L. E. Atlas, J. J. Choi, S. Oh, K. F. Cheung, and D. C. Park
Appl. Opt. 27(14) 2900-2904 (1988)

Nearest matched filter classification of spatiotemporal patterns

Robert Hecht-Nielsen
Appl. Opt. 26(10) 1892-1899 (1987)