• DocumentCode
    1713163
  • Title

    Total 8-connectivity on the square raster

  • Author

    Kasvand, T.

  • Author_Institution
    Dept. of Comput. Sci., Concordia Univ., Montreal, Que., Canada
  • fYear
    1988
  • Firstpage
    354
  • Abstract
    In order to avoid logical inconsistencies on the regular square raster, the foreground and the background in a binary image have to be treated differently during, for example, labelling or thinning operations. If the foreground is considered 8-connected, then the background has to be 4-connected, or vice versa. It is demonstrated that after certain topographic and possibly topological changes to a binary image, its foreground and background can both be considered 8-connected and the inconsistencies are eliminated. In particular, the foreground and background can be thinned using 8-connectivity. The erosion and dilatation problems that arise as a result of the changes can be overcome by constrained erosions and dilations which do not create possibilities of penetration or blocking of passages. After logical operations it is best to check the resultant image for penetration numbers
  • Keywords
    computer vision; computerised pattern recognition; computerised picture processing; background; binary image; computer vision; computerised picture processing; constrained dilatation; constrained erosions; foreground; labelling; logical inconsistencies; passage blocking; pattern recognition; penetration; regular square raster; thinning; topographic changes; topological changes; total 8-connectivity; Computer science; Hardware; Humans; Image processing; Labeling; Skeleton; Switches;
  • 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.28241
  • Filename
    28241