• DocumentCode
    3061866
  • Title

    Low power and area efficient image segmentation VLSI architecture using 2-dimensional pixel-block scanning

  • Author

    Okazaki, Keita ; Nagaoka, Naomi ; Sugahara, Tatsuya ; Koide, Tetsushi ; Mattausch, Hans Jürgen

  • Author_Institution
    Grad. Sch. of Adv. Sci. of Matter, Hiroshima Univ., Higashi-Hiroshima
  • fYear
    2009
  • fDate
    8-11 Feb. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    We report a pixel-block scanning image segmentation VLSI based on a region-growing approach. Using the two techniques of (i) a limited scan to the boundary of each grown region and (ii) continued block-internal region growing, we have improved the overall segmentation speed and power consumption in comparison to a previous design. We evaluated the segmentation performance by MATLAB simulation and an ASIC design. The scan block shape and size are scalable, and can be optimized to fulfill segmentation speed, power consumption, and implementation area requirements. The pixel-parallel segmentation unit area could be reduced to 1/10 by changing the pixel-block size from 80 times 2 pixels to 4 times 4 pixels, which still enables real-time segmentation performance.
  • Keywords
    VLSI; application specific integrated circuits; image segmentation; integrated circuit design; low-power electronics; 2-dimensional pixel-block scanning; ASIC design; MATLAB simulation; VLSI architecture; area efficient image segmentation; continued block-internal region growing; low-power VLSI architecture; pixel-block size; pixel-parallel segmentation unit area; Biomedical signal processing; Cameras; Electronic mail; Energy consumption; Image segmentation; Image storage; Robot vision systems; Service oriented architecture; Smart pixels; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Signal Processing and Communications Systems, 2008. ISPACS 2008. International Symposium on
  • Conference_Location
    Bangkok
  • Print_ISBN
    978-1-4244-2564-8
  • Electronic_ISBN
    978-1-4244-2565-5
  • Type

    conf

  • DOI
    10.1109/ISPACS.2009.4806691
  • Filename
    4806691