{"title":"Design of threshold Boolean filters under MSE criterion by iterative searching","authors":"Pak-Cheung Lai, B. Zeng","doi":"10.1109/SIPS.1999.822373","DOIUrl":null,"url":null,"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.","PeriodicalId":275030,"journal":{"name":"1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIPS.1999.822373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.