Two tree-based methods for the waterfall

Abstract The waterfall transform is a hierarchical segmentation technique based on the watershed transform from the field of mathematical morphology. Watershed-based techniques are useful in numerous fields ranging from image segmentation to cell-and-portal generation for games. The waterfall helps mitigate the problem of over-segmentation that commonly occurs when applying the basic watershed transform. It can also be used as a core part of a method for constructing image partition forests , a tree-based, multi-scale representation of an image. The best existing method for the waterfall is fast and effective, but our experience has been that it is not as straightforward to implement as might be desired. Furthermore, it does not deal consistently with the issue of non-minimal plateaux. This paper therefore proposes two new tree-based methods for the waterfall. Both are easier to implement than the existing state-of-the-art, and in our implementations, both were faster by a constant factor. The Simplified Waterfall (SW) method focuses on simplicity and ease of implementation; the Balanced Waterfall (BW) method focuses on robust handling of non-minimal plateaux. We perform experiments on both 2D and 3D images to contrast the new methods with each other and with the existing state-of-the-art, and show that both achieve a noticeable speed-up whilst producing similar results.

[1]  Françoise Peyrin,et al.  A constrained region growing approach based on watershed for the segmentation of low contrast structures in bone micro-CT images , 2008, Pattern Recognit..

[2]  Jon Atli Benediktsson,et al.  Segmentation and classification of hyperspectral images using watershed transformation , 2010, Pattern Recognit..

[3]  Stanislav L. Stoev,et al.  RaFSi - A Fast Watershed Algorithm Based on Rainfalling Simulation , 2000, WSCG.

[4]  L. MOUMOUN,et al.  HIERARCHICAL SEGMENTATION USING THE MARKERS FOR THE WATERSHED TRANSFORMATION , 2010 .

[5]  Serge Beucher,et al.  Watershed, Hierarchical Segmentation and Waterfall Algorithm , 1994, ISMM.

[6]  Irina Voiculescu,et al.  Region analysis of abdominal CT scans using image partition forests , 2008, CSTST.

[7]  Daniel P. Huttenlocher,et al.  Efficient Graph-Based Image Segmentation , 2004, International Journal of Computer Vision.

[8]  Thierry M. Bernard,et al.  Statistical solution to watershed over-segmentation , 2004, 2004 International Conference on Image Processing, 2004. ICIP '04..

[9]  Isabelle Bloch,et al.  Oversegmentation control for inexact graph matching: First results , 2007, ISMM.

[10]  Irina Voiculescu,et al.  The Use of Image Partition Forests in the Analysis of Abdominal CT Scans , 2008 .

[11]  ALID,et al.  IMAGE SEGMENTATION: A WATERSHED TRANSFORMATION ALGORITHM , 2011 .

[12]  Lijun Chen,et al.  An efficient and robust algorithm for 3D mesh segmentation , 2006, Multimedia Tools and Applications.

[13]  Beatriz Marcotegui,et al.  Fast Implementation of Waterfall Based on Graphs , 2005, ISMM.

[14]  Luc Van Gool,et al.  The Pascal Visual Object Classes (VOC) Challenge , 2010, International Journal of Computer Vision.

[15]  Oldrich Vysata,et al.  Wavelet use for reduction of watershed transform over-segmentation in biomedical images processing , 2010, Proceedings of the 10th IEEE International Conference on Information Technology and Applications in Biomedicine.

[16]  Patrick de Smet Optimized high speed pixel sorting and its application in watershed based image segmentation , 2010, Pattern Recognit..

[17]  Ron Kikinis,et al.  Improved watershed transform for medical image segmentation using prior information , 2004, IEEE Transactions on Medical Imaging.

[18]  Alf D. Linney,et al.  The analysis of facial profiles using scale space techniques , 1992, Pattern Recognit..

[19]  S. Beucher,et al.  Morphological segmentation , 1990, J. Vis. Commun. Image Represent..

[20]  Rafael C. González,et al.  Local Determination of a Moving Contrast Edge , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Nina Sumiko Tomita Hirata,et al.  Interactive Image Segmentation with Integrated use of the Markers and the Hierarchical Watershed Approaches , 2009, VISAPP.

[22]  W. Bieniecki Oversegmentation avoidance in watershed-based algorithms for color images , 2004, Proceedings of the International Conference Modern Problems of Radio Engineering, Telecommunications and Computer Science, 2004..

[23]  Serge Beucher,et al.  THE WATERSHED TRANSFORMATION APPLIED TO IMAGE SEGMENTATION , 2009 .

[24]  N. Kalouptsidis,et al.  A DISJOINT SET ALGORITHM FOR THE WATERSHED TRANSFORM , 2008 .

[25]  Andrew Blake,et al.  Geodesic star convexity for interactive image segmentation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[26]  Bidyut Baran Chaudhuri,et al.  An efficient method based on watershed and rule-based merging for segmentation of 3-D histo-pathological images , 2001, Pattern Recognit..

[27]  I. Chakrabarti,et al.  An efficient immersion-based watershed transform method and its prototype architecture , 2007, J. Syst. Archit..

[28]  Alina N. Moga,et al.  An efficient watershed algorithm based on connected components , 2000, Pattern Recognit..

[29]  Jue Wang,et al.  A perceptually motivated online benchmark for image matting , 2009, CVPR.

[30]  Jose Luis Patino,et al.  Fuzzy relations applied to minimize over segmentation in watershed algorithms , 2005, Pattern Recognit. Lett..

[31]  Maria Frucci Oversegmentation reduction by flooding regions and digging watershed lines , 2006, Int. J. Pattern Recognit. Artif. Intell..

[32]  Ross T. Whitaker,et al.  Partitioning 3D Surface Meshes Using Watershed Segmentation , 1999, IEEE Trans. Vis. Comput. Graph..

[33]  Jean Stawiaski,et al.  REGION MERGING VIA GRAPH-CUTS , 2011 .

[34]  Pedro Gómez Vilda,et al.  An improved watershed algorithm based on efficient computation of shortest paths , 2007, Pattern Recognit..

[35]  Jitendra Malik,et al.  A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[36]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[37]  M. A. Gonzalez,et al.  Automatic marker determination algorithm for watershed segmentation using clustering , 2009 .

[38]  James F. Hamlin Automatically Generated Maps of 3 D Environments , 2008 .

[39]  François X. Sillion,et al.  Volumetric cell‐and‐portal generation , 2003, Comput. Graph. Forum.

[40]  Alexandre X. Falcão,et al.  IFT-Watershed from gray-scale marker , 2002, Proceedings. XV Brazilian Symposium on Computer Graphics and Image Processing.

[41]  Serge Beucher Segmentation d'images et morphologie mathématique , 1990 .

[42]  Abraham Duarte,et al.  Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic , 2005, EvoWorkshops.

[43]  Jitendra Malik,et al.  Scale-Space and Edge Detection Using Anisotropic Diffusion , 1990, IEEE Trans. Pattern Anal. Mach. Intell..