5 March 1999 Efficient switching algorithm for designing increasing binary filters
Author Affiliations +
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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nina Sumiko Tomita Hirata, Nina Sumiko Tomita Hirata, Edward R. Dougherty, Edward R. Dougherty, Junior Barrera, Junior Barrera, } "Efficient switching algorithm for designing increasing binary filters", Proc. SPIE 3646, Nonlinear Image Processing X, (5 March 1999); doi: 10.1117/12.341084; https://doi.org/10.1117/12.341084
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT


Back to Top