Share Email Print

Proceedings Paper

Composite filter trees and image recognition via binary search
Author(s): Gary W. Carhart; Thomas R. Walsh; Michael K. Giles
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Construction rules for building composite binary phase-only filters (CBPOFs) designed for use at the nodes of a binary tree have been developed using upweighted superposition algorithms. This paper describes the use of this method to build a four-target, rotation-invariant CBPOF bank on which binary tree searches can be performed. Each of the four trees in this filter bank consists of 256 simple filters (BPOFs) and 254 composites. Sequential search of the 256 simple filters is replaced by a binary search which uses at most 26 composites and 4 simple BPOFs. An image recognition system utilizing the filter bank has been developed, assembled, and evaluated by simulation and experiment. The empirical results obtained using a hybrid optical correlator with computer-controlled magneto-optic spatial light modulators (MOSLMs) at the input and filter planes are presented.

Paper Details

Date Published: 1 September 1990
PDF: 14 pages
Proc. SPIE 1295, Real-Time Image Processing II, (1 September 1990); doi: 10.1117/12.21226
Show Author Affiliations
Gary W. Carhart, New Mexico State Univ. (United States)
Thomas R. Walsh, New Mexico State Univ. (United States)
Michael K. Giles, New Mexico State Univ. (United States)

Published in SPIE Proceedings Vol. 1295:
Real-Time Image Processing II
Richard D. Juday, Editor(s)

© SPIE. Terms of Use
Back to Top