Efficient switching algorithm for designing increasing binary filters uri icon

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.

published proceedings

  • Proceedings of SPIE

author list (cited authors)

  • Hirata, N., Dougherty, E. R., & Barrera.

citation count

  • 0

complete list of authors

  • Hirata, Nina ST||Dougherty, Edward R

editor list (cited editors)

  • Dougherty, E. R., & Astola, J. T.

publication date

  • March 1999