Efficient switching algorithm for designing increasing binary filters

Nina Sumiko Tomita Hirata; Edward R. Dougherty; Junior Barrera

doi:10.1117/12.341084

5 March 1999 Efficient switching algorithm for designing increasing binary filters

Nina Sumiko Tomita Hirata, Edward R. Dougherty, Junior Barrera

Proceedings Volume 3646, Nonlinear Image Processing X; (1999) https://doi.org/10.1117/12.341084
Event: Electronic Imaging '99, 1999, San Jose, CA, United States

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.

Citation Download Citation

Nina Sumiko Tomita Hirata, Edward R. Dougherty, and Junior Barrera "Efficient switching algorithm for designing increasing binary filters", Proc. SPIE 3646, Nonlinear Image Processing X, (5 March 1999); https://doi.org/10.1117/12.341084

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available