Morphological representation of order-statistics filters

  • Authors:
  • M. Charif-Chefchaouni;D. Schonfeld

  • Affiliations:
  • Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

We propose a comprehensive theory for the morphological bounds on order-statistics filters (and their repeated iterations). Conditions are derived for morphological openings and closings to serve as bounds (lower and upper, respectively) on order-statistics filters (and their repeated iterations). Under various assumptions, morphological open-closings and close-openings are also shown to serve as (tighter) bounds (lower and upper, respectively) on iterations of order-statistics filters. Simulations of the application of the results presented to image restoration are finally provided