The configuration of stack filters by probabilistic search

An efficient search method for the configuration of stack filters is presented. Nonlinear digital filters such as these are known to be flexible and effective in applications where it is difficult to characterize the noise type. An open problem associated with designing stack filters is finding the...

Full description

Saved in:
Bibliographic Details
Published in1990 IEEE International Symposium on Circuits and Systems (ISCAS) pp. 172 - 176 vol.1
Main Authors Efe, K., Chu, C.H., Rao, K.B.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1990
Subjects
Digital filters
Filtering
Noise reduction
Nonlinear filters
Probability distribution
Search methods
Search problems
Signal design
Signal processing
Signal processing algorithms
Online AccessGet full text

Cover

More Information
Summary:An efficient search method for the configuration of stack filters is presented. Nonlinear digital filters such as these are known to be flexible and effective in applications where it is difficult to characterize the noise type. An open problem associated with designing stack filters is finding the right configuration for a given noise type and the signal characteristics which need to be preserved. The problem of finding the right configuration is modeled as a combinatorial search problem. An efficient search method is developed which considers the probability distribution of the objective function values. Based on this, the number of steps needed to come up with a good configuration is established. The required number of steps can be carried out in parallel in any type of parallel computer. The method is empirically verified, and the performance of the stack filters found by the search method is compared to the performance of the median filter.< >
DOI:10.1109/ISCAS.1990.111954