Class AlgorithmHillClimbingWatershed

  • All Implemented Interfaces:
    java.awt.event.ActionListener, java.awt.event.WindowListener, java.lang.Runnable, java.util.EventListener

    public class AlgorithmHillClimbingWatershed
    extends AlgorithmBase
    Author:
    ilb Reference: 1.) The Watershed Transform: Definitions, Algorithms, and Parallelization Strategies by Jos B.T.M. Roerdink and Arnold Meijster, Fundamentals Informaticae 41 (2001), pp. 187-228. Algorithm 4.3 Watershed transform w.r.t. topographcial distance by hill climbing From Section 4.2.3 Hill Climbing use distance values of 1 for both 4 and 8 connected in calculating steepest upper neighbors. 2.) Automated Sulcal Segmentation Using Watersheds on the Cortical Surface by Maryam E. Rettmann, Xiao Han, Chenyang Xu, and Jerry L. Prince, NeuroImage 15, 2002, Section Merging of Catchment Basins, p.338.
    • Field Detail

      • numNeighbor

        private int numNeighbor
      • limitBins

        private boolean limitBins
      • binNumber

        private int binNumber
      • merge

        private boolean merge
      • mergeThreshold

        private double mergeThreshold
    • Constructor Detail

      • AlgorithmHillClimbingWatershed

        public AlgorithmHillClimbingWatershed​(ModelImage destImage,
                                              ModelImage srcImage,
                                              int numNeighbor,
                                              boolean limitBins,
                                              int binNumber,
                                              boolean merge,
                                              double mergeThreshold)
    • Method Detail

      • runAlgorithm

        public void runAlgorithm()
        Description copied from class: AlgorithmBase
        Actually runs the algorithm. Implemented by inheriting algorithms.
        Specified by:
        runAlgorithm in class AlgorithmBase
      • run2D

        public void run2D()
      • run3D

        public void run3D()