Share Email Print

Proceedings Paper

Efficient switching algorithm for designing increasing binary filters
Author(s): Nina Sumiko Tomita Hirata; Edward R. Dougherty; Junior Barrera
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

In this paper, a new efficient algorithm to design increasing, binary image window operators (or filters), based on a method called switching, is proposed. Switching in this context refers to a method that sequentially exchanges (switches) the value of a given operator at some points in order to generate another operator satisfying some algebraic properties. Here we study switchings on the optimal operator to generate an optimal increasing operator. The proposed method reformulates the original switching problem as a partition problem and gives a greedy algorithm to solve it.

Paper Details

Date Published: 5 March 1999
PDF: 12 pages
Proc. SPIE 3646, Nonlinear Image Processing X, (5 March 1999); doi: 10.1117/12.341084
Show Author Affiliations
Nina Sumiko Tomita Hirata, Univ. de Sao Paulo (Brazil)
Edward R. Dougherty, Texas Ctr. for Applied Technology and Texas A&M Univ. (United States)
Junior Barrera, Univ. de Sao Paulo (Brazil)

Published in SPIE Proceedings Vol. 3646:
Nonlinear Image Processing X
Edward R. Dougherty; Jaakko T. Astola, Editor(s)

© SPIE. Terms of Use
Back to Top