Design of threshold Boolean filters under MSE criterion by iterative searching

Author

Cheung La, Pak ; Zeng, Bing

Author_Institution

Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Kowloon, Hong Kong

fYear

1999

fDate

6/21/1905 12:00:00 AM

Firstpage

663

Lastpage

670

Abstract

Threshold Boolean filters (TBFs) constitute a large class of nonlinear filters which are effective in removing impulsive noise and preserving image details. The minimum mean square error (MMSE) design of TBFs is found to be a quadratic 0-1 programming problem. Unfortunately, solving the problem needs a huge number of computations. We propose an iterative search algorithm of very low complexity to solve the design problem sub-optimally. In each iteration, only one variable is considered and updated. Simulation shows that the proposed algorithm converges quickly and often converges to the optimal solution

Keywords

computational complexity; filtering theory; impulse noise; least mean squares methods; nonlinear filters; quadratic programming; search problems; MSE criterion; convergence; image detail preservation; impulsive noise; iterative searching; minimum mean square error design; nonlinear filters; quadratic programming; simulation; threshold Boolean filter design; very low complexity; Algorithm design and analysis; Boolean functions; Image converters; Iterative algorithms; Mean square error methods; Nonlinear filters; Quadratic programming; Signal design; Signal processing; Working environment noise;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Systems, 1999. SiPS 99. 1999 IEEE Workshop on

Conference_Location

Taipei

ISSN

1520-6130

Print_ISBN

0-7803-5650-0

Type

conf

DOI

10.1109/SIPS.1999.822373

Filename

822373