• DocumentCode
    3432695
  • Title

    A novel topology based watershed segmentation

  • Author

    Allili, Madjid ; Bentabet, Layachi ; Chen, Yan

  • Author_Institution
    Dept. of Comput. Sci., Bishop´´s Univ., Sherbrooke, QC, Canada
  • fYear
    2012
  • fDate
    2-5 July 2012
  • Firstpage
    824
  • Lastpage
    829
  • Abstract
    We propose a novel method for watershed segmentation based on the topological properties of triangular irregular networks (TIN) associated with input images through their height fields. The classical watershed segmentation is very sensitive to the initial markers definition. In order to avoid undesirable effects such as oversegmentation, we propose to use topological features, such as critical points, to extract meaningful markers. Critical points based watershed algorithm is developed and implemented to carry out grey scale image segmentation. Unlike the classical watershed algorithms, which rely on a flooding simulation starting from the gradient´s image minima, the proposed technique defines growing regions for both maxima and minima. It therefore uses the grey scale image directly and avoids noise amplification that results from the gradient operator. Experiments demonstrate that this method provides a good segmentation procedure for gray-scale images.
  • Keywords
    feature extraction; gradient methods; image colour analysis; image segmentation; TIN; critical points based watershed algorithm; flooding simulation; gradient image minima; grey scale image segmentation; noise amplification; oversegmentation; topological feature; topology based watershed segmentation; triangular irregular network; Algorithm design and analysis; Feature extraction; Image segmentation; Lattices; Noise; Signal processing algorithms; Transforms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Science, Signal Processing and their Applications (ISSPA), 2012 11th International Conference on
  • Conference_Location
    Montreal, QC
  • Print_ISBN
    978-1-4673-0381-1
  • Electronic_ISBN
    978-1-4673-0380-4
  • Type

    conf

  • DOI
    10.1109/ISSPA.2012.6310667
  • Filename
    6310667