1 January 1999 Optimal trade-off filter for the correlation of fingerprints
Author Affiliations +
Optical Engineering, 38(1), (1999). doi:10.1117/1.602075
We present the derivation of an optimal trade-off filter developed for the correlation of fingerprints. The filter is comprised of multiple versions of the system user's fingerprint (i.e., it is a composite filter). Also, the characteristics of the filter can be adjusted so that its performance in a correlator is similar to that of a matched filter, an inverse filter, or some compromise between the two. These attributes make this filter structure attractive for the task of fingerprint verification. The composite nature of the filter offers distortion tolerance by encompassing several different versions of the fingerprint image, while the tailored characteristics of the filter enables us to produce a filter that is a trade-off between this distortion tolerance and its discrimination capability. The filter was developed using a "standard" database, with the objective of separating the two classes of input to the system: "legitimate users'' and "attackers." Specifically, the filter is optimized to minimize the probability of error (i.e., misclassification of user). Both the design and the implementation of the optimal fingerprint filter are covered.
Danny Roberge, Colin Soutar, Bhagavatula Vijaya Kumar, "Optimal trade-off filter for the correlation of fingerprints," Optical Engineering 38(1), (1 January 1999). http://dx.doi.org/10.1117/1.602075

Image filtering

Optimal filtering


Computer programming


Optical filters

Spatial light modulators


CdZnTe detector as an x-ray spectrometer
Proceedings of SPIE (June 28 2001)
Digital Optical Computing: Possibilities And Pitfalls
Proceedings of SPIE (January 04 1986)
The design of scanning fiber optical system
Proceedings of SPIE (November 25 2009)
Ultra fine measurement of the effect of a vacuum exposure...
Proceedings of SPIE (November 21 2017)
e-Seminar lecture recording and distribution system
Proceedings of SPIE (December 22 2000)

Back to Top