• DocumentCode
    3263898
  • Title

    A shrinking algorithm for binary images to preserve topology

  • Author

    Jia, Xingxing ; Wang, Daoshun ; Wu, Yu-jiang ; Luo, Xiangyang

  • Author_Institution
    Sch. of Math. & Stat., Lanzhou Univ., Lanzhou, China
  • Volume
    3
  • fYear
    2010
  • fDate
    16-18 Oct. 2010
  • Firstpage
    1181
  • Lastpage
    1185
  • Abstract
    The two main factors that determine the quality of images from scaling algorithms are shape preservation and topology preservation. Most of the existing scaling algorithms focus on shape preservation and some pay attention to topology preservation. In this paper we propose a shrinking algorithm for binary images to preserve topology. The proposed algorithm shrinks the image by a factor of powers of 2 through iterative process. It divides the image into disjoint 2×2 rectangle blocks at each iterative step. Each block is in smooth region or in edge region. For smooth region, the block has the same color, so the corresponding pixel takes the same color as the block. For edge region, the block has different colors, so the corresponding pixel is processed according to human visual system and connectivity classification. Experimental results show that the proposed shrinking algorithm has better topology preservation and similar shape preservation in comparison with existing shrinking algorithms.
  • Keywords
    image classification; image resolution; iterative methods; binary images; connectivity classification; edge region; human visual system; iterative process; scaling algorithms; shape preservation; shrinking algorithm; smooth region; topology preservation; Classification algorithms; Gray-scale; Image edge detection; Pixel; Shape; Signal processing algorithms; Topology; binary image; connectivity preservation; pixel counting test; shape preservation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image and Signal Processing (CISP), 2010 3rd International Congress on
  • Conference_Location
    Yantai
  • Print_ISBN
    978-1-4244-6513-2
  • Type

    conf

  • DOI
    10.1109/CISP.2010.5647181
  • Filename
    5647181