Abstract
Threshold Boolean filters (TBF's) 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 TBF's is found to be a quadratic 0-1 programming problem. Unfortunately, solving the problem needs a huge number of computations. In this paper, 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.
| Original language | English |
|---|---|
| Pages (from-to) | 663-670 |
| Number of pages | 8 |
| Journal | IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation |
| Publication status | Published - 1999 |
| Externally published | Yes |
| Event | 1999 IEEE Workshop on SiGNAL Processing Systems (SiPS 99): 'Design and Implementation' - Taipei, Taiwan Duration: 20 Oct 1999 → 22 Oct 1999 |
Fingerprint
Dive into the research topics of 'Design of Threshold Boolean filters under MSE criterion by iterative searching'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver