• DocumentCode
    2679138
  • Title

    The digital morphological sampling theorem

  • Author

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

  • Author_Institution
    Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA
  • fYear
    1988
  • fDate
    7-9 Jun 1988
  • Firstpage
    2789
  • Abstract
    There are potential industrial applications for any methodology which inherently reduces processing time and cost and yet produces results sufficiently close to the result of full processing. It is for this reason that a morphological sampling theorem is important. The morphological sampling theorem described by the authors states: (1) how a digital image must be morphologically filtered before sampling to preserve the relevant information after sampling; (2) to what precision an appropriately 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 for the case of binary morphology
  • Keywords
    picture processing; binary morphology; computationally efficient scheme; digital image; digital morphological sampling theorem; morphologically filtered image; processing time; reconstructed; Costs; Digital filters; Digital images; Image sampling; Information filtering; Low pass filters; Morphology; Sampling methods; Signal resolution; Signal sampling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1988., IEEE International Symposium on
  • Conference_Location
    Espoo
  • Type

    conf

  • DOI
    10.1109/ISCAS.1988.15518
  • Filename
    15518