A fast thresholded linear convolution representation of morphological operations

  • Authors:
  • B. Kisacanin;D. Schonfeld

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

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

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this correspondence, we present a fast thresholded linear convolution representation of morphological operations. The thresholded linear convolution representation of dilation and erosion is first proposed. A comparison of the efficiency of the direct implementation of morphological operations and the thresholded linear convolution representation of morphological operations is subsequently conducted. Mathematical morphology has emerged as a powerful new tool for image processing