Breakdown probabilities of recursive soft morphological filters

Authors:
Pertti Koivisto;Antti Niemistö
Affiliations:
Tampere University of Technology, Tampere, Finland;Tampere University of Technology, Tampere, Finland
Venue:
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Year:
2004

Citing 3
Cited 0

Soft morphological filtering

Journal of Mathematical Imaging and Vision
Breakdown probabilities of recursive stack filters

Signal Processing - Special section on Markov Chain Monte Carlo (MCMC) methods for signal processing
Recursive soft morphological filters

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for the calculation of the breakdown probabilities of recursive soft morphological filters is given, and the impulse removal capabilities of recursive and nonrecursive soft morphological filters are compared by utilizing the breakdown probabilities of the filters. Also, formulas for the breakdown probabilities of nonrecursive basic soft morphological operations are briefly reviewed and examples are given.