• DocumentCode
    1729264
  • Title

    Eckhardt, U. (Inst. fuer Angewandte Math., Hamburg Univ., West Germany) Maderlechner, G

  • fYear
    1988
  • Firstpage
    727
  • Abstract
    There exist very complex sets that contain interior points and that are irreducible under thinning. The authors investigate the structure of such irreducible sets. It is shown that irreducible sets containing interior points have essentially the structure of a counterexample given by C. Arcelli (1981). Finally the question is raised of under which conditions irreducible sets that have a large kernel of interior points are not possible. It turns out that a very simple condition will suffice
  • Keywords
    computational geometry; computerised picture processing; topology; computerised picture processing; interior points; irreducible digital sets structure; kernel; Kernel; Topology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Pattern Recognition, 1988., 9th International Conference on
  • Conference_Location
    Rome
  • Print_ISBN
    0-8186-0878-1
  • Type

    conf

  • DOI
    10.1109/ICPR.1988.28341
  • Filename
    28341