Binary images appear in various pattern recognition applications. It is thus important to design pattern recognition algorithms that are optimal for such images. We address the problem of target location in binary images perturbed with nonhomogeneous background noise. The proposed algorithm optimizes the likelihood ratio between the hypotheses that the target is present within a small subwindow of the image and that it is not present in this subwindow. The algorithm is shown to consist of two correlation operations and a few pointwise nonlinear transformations. With numerical simulations, we illustrate the efficiency of this technique, especially in the presence of strongly nonhomogeneous background noise.
© 1998 Optical Society of America
Original Manuscript: April 13, 1998
Revised Manuscript: July 27, 1998
Manuscript Accepted: August 19, 1998
Published: December 1, 1998
Henrik Sjöberg, François Goudail, and Philippe Réfrégier, "Optimal algorithms for target location in nonhomogeneous binary images," J. Opt. Soc. Am. A 15, 2976-2985 (1998)