1 September 1990 Composite filter trees and image recognition via binary search
Author Affiliations +
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gary W. Carhart, Thomas R. Walsh, Michael K. Giles, "Composite filter trees and image recognition via binary search", Proc. SPIE 1295, Real-Time Image Processing II, (1 September 1990); doi: 10.1117/12.21226; https://doi.org/10.1117/12.21226
PROCEEDINGS
14 PAGES


SHARE
Back to Top