Paper
23 June 1993 Morphological bounds on order-statistics filters
Mohammed A. Charif-Chefchaouni, Dan Schonfeld
Author Affiliations +
Abstract
In this paper, we investigate the morphological bounds on order- statistics (median) filters (and their repeated iterations). Conditions are derived for morphological openings and closing to serve as bounds (lower and upper, respectively) on order- statistics (median) filters (and their repeated iterations). Under various assumptions, morphological open-closings (open- close-openings) and close-openings (close-open-closings) are also shown to serve as (tighter) bounds (lower and upper, respectively) on iterations of order-statistics (median) filters. Conditions for the convergence of iterations of order-statistics (median) filters are proposed. Criteria for the morphological characterization of roots of order-statistics (median) filters are also proposed.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mohammed A. Charif-Chefchaouni and Dan Schonfeld "Morphological bounds on order-statistics filters", Proc. SPIE 2030, Image Algebra and Morphological Image Processing IV, (23 June 1993); https://doi.org/10.1117/12.146671
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Digital filtering

Image filtering

Electronic filtering

Image processing

Nonlinear filtering

Radon

Signal processing

RELATED CONTENT

Soft morphological filters
Proceedings of SPIE (July 01 1991)
Multilayer Boolean and stack filter design
Proceedings of SPIE (May 01 1994)
Domain-variant gray-scale morphology
Proceedings of SPIE (April 01 1991)
Mixed median filters and their properties
Proceedings of SPIE (April 04 1997)
Rank order filtering on bit-serial mesh-connected computers
Proceedings of SPIE (October 08 1996)

Back to Top