• DocumentCode
    777924
  • Title

    The digital morphological sampling theorem

  • Author

    Haralick, Robert M. ; Zhuang, Xinhua ; Lin, Charlotte ; Lee, James S J

  • Author_Institution
    Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA
  • Volume
    37
  • Issue
    12
  • fYear
    1989
  • fDate
    12/1/1989 12:00:00 AM
  • Firstpage
    2067
  • Lastpage
    2090
  • Abstract
    Morphological sampling reduces processing time and cost and yet produces results sufficiently close to the result of full processing. A morphological sampling theorem is described which states: (1) how a digital image must be morphologically filtered before sampling in order to preserve the relevant information after sampling; (2) to what precision an appropriate morphologically filtered image can be reconstructed after sampling; and (3) the relationship between morphologically operating before sampling and the more computationally efficient scheme of morphologically operating on the sampled image with a sampled structuring element. The digital sampling theorem is developed first for the case of binary morphology, and then it is extended to gray-scale morphology through the use of the umbra homomorphism theorems
  • Keywords
    computerised picture processing; filtering and prediction theory; binary morphology; computationally efficient; digital morphological sampling theorem; filtered; gray-scale morphology; image processing; sampled structuring element; umbra homomorphism theorems; Costs; Digital filters; Digital images; Gray-scale; Image reconstruction; Image sampling; Information filtering; Information filters; Morphology; Sampling methods;
  • fLanguage
    English
  • Journal_Title
    Acoustics, Speech and Signal Processing, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0096-3518
  • Type

    jour

  • DOI
    10.1109/29.45553
  • Filename
    45553