Class AlgorithmLowerCompletion

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

    public class AlgorithmLowerCompletion
    extends AlgorithmBase
    Author:
    ilb 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.5 Algorithm for lowercompletion using a FIFO queue. A valued graph is called lower complete when each node which is not in a minimum has a neighboring node of lower value. If an image is lower complete, each pixel which is not in a minimum has a neighbor of lower grey value. This algorithm transforms an image to a lower complete image. Lower complete images are often used as inputs to watershed transforms.
    • Field Detail

      • numNeighbor

        private int numNeighbor
      • limitBins

        private boolean limitBins
      • binNumber

        private int binNumber
      • minBuffer

        private boolean[][] minBuffer
    • Constructor Detail

      • AlgorithmLowerCompletion

        public AlgorithmLowerCompletion​(ModelImage destImage,
                                        ModelImage srcImage,
                                        int numNeighbor,
                                        boolean limitBins,
                                        int binNumber)
    • 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()
      • getMinBuffer

        public boolean[][] getMinBuffer()