The optimal-morphological-=basis switching algorithm Conference Paper

abstract

• 1991 IEEE. Designing optimal morpholgical filters, even in the binary case, involves a time-consuming search procedure that, in practice, can be intractable. The present paper provides an algorithm for filter design that is based upon the relationship between the optimal morphological filter and the conditional expectation. A morphological filter may not exist for a given conditional probability distribuition. If one exists, the algorithm determines the filter, optimal among morphological and other filters, almost instantaneously. If not, it changes the probability ensuring minimum increase in mean square error and determines the optimal morphological filter.

name of conference

• TENCON '91. Region 10 International Conference on EC3-Energy, Computer, Communication and Control Systems

authors

• Dougherty, Edward

published proceedings

• TENCON '91. Region 10 International Conference on EC3-Energy, Computer, Communication and Control Systems

author list (cited authors)

• Mathew, A. V., Dougherty, E., & Swarnakar, V.

citation count

• 1

complete list of authors

• Mathew, AV||Dougherty, E||Swarnakar, V

publication date

• January 1991

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Region 10 Annual International Conference, Proceedings/TENCON  Journal

Digital Object Identifier (DOI)

• 10.1109/tencon.1991.753904

International Standard Book Number (ISBN) 10

• 0780305388

start page

• 373

end page

• 378

volume

• 3

URL

• http://dx.doi.org/10.1109/tencon.1991.753904