Recursive soft morphological filters

Authors:
F. Y. Shih;Padmaja Puttagunta
Affiliations:
Comput. Vision Lab., New Jersey Inst. of Technol., Newark, NJ;-
Venue:
IEEE Transactions on Image Processing
Year:
1995

Citing 0
Cited 5

Breakdown probabilities of recursive soft morphological filters

WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Adaptive mathematical morphology for edge linking

Information Sciences—Informatics and Computer Science: An International Journal
Decomposition of binary morphological structuring elements based on genetic algorithms

Computer Vision and Image Understanding
A hierarchical refinement algorithm for fully automatic gridding in spotted DNA microarray image processing

Information Sciences: an International Journal
Note: Decomposition of binary morphological structuring elements based on genetic algorithms

Computer Vision and Image Understanding

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present properties of recursive soft morphological filters that use previously filtered outputs as their inputs, cascade combinations of these filters, and the idempotent recursive soft morphological filters. The development allows problems in the implementation of cascaded recursive soft morphological filters to be reduced to the equivalent problems of a single recursive standard morphological filter