Examples of net.sourceforge.watershed.Watershed_Algorithm

net.sourceforge.watershed.Watershed_Algorithm

nfo.nih.gov/ij/plugins/watershed.html This algorithm is an implementation of the watershed immersion algorithm written by Vincent and Soille (1991). @Article{Vincent/Soille :1991, author = "Lee Vincent and Pierre Soille", year = "1991", keywords = "IMAGE-PROC SKELETON SEGMENTATION GIS", institution = "Harvard/Paris+Louvain", title = "Watersheds in digital spaces: An efficient algorithm based on immersion simulations", journal = "IEEE PAMI, 1991", volume = "13", number = "6", pages = "583--598", annote = "Watershed lines (e.g. the continental divide) mark the boundaries of catchment regions in a topographical map. The height of a point on this map can have a direct correlation to its pixel intensity. WIth this analogy, the morphological operations of closing (or opening) can be understood as smoothing the ridges (or filling in the valleys). Develops a new algorithm for obtaining the watershed lines in a graph, and then uses this in developing a new segmentation approach based on the {"}depth of immersion{"}.", } A review of Watershed algorithms can be found at : http://www.cs.rug.nl/~roe/publications/parwshed.pdf @Article{RoeMei00, author = "Roerdink and Meijster", title = "The WatershedTransform: Definitions, Algorithms and Parallelization Strategies", journal = "FUNDINF: Fundamenta Informatica", volume = "41", publisher = "IOS Press", year = "2000", }

        // want the watershed to grow into the background
        for (int i = 0; i < waterShed.length; i++) {
            if (control.getSlice(z)[i] == 0)
                waterShed[i] = (short) 0;
        }
        Watershed_Algorithm wc = new Watershed_Algorithm();
        wc.run(waterShed, width, height);
        int regionID = 1;
        int maxCount = Integer.MIN_VALUE;
        Point p = null;
        short[] mark = new short[width * height];
        int countregs = 0;

            if (control.getSlice(z)[i] == 0)
                waterShed[i] = (short) 0;
        }


        // Apply watershed
        Watershed_Algorithm wc = new Watershed_Algorithm();
        wc.run(waterShed, width, height);
        int regionID = 1;
        int maxCount = Integer.MIN_VALUE;
        Point p = null;
        short[] mark = new short[width * height];
        int countregs = 0;

        for (int z = 0; z < stack.getDepth(); z++) {
            control.setProgress(z);
            if (control.isStopped()) {
                return;
            }
            Watershed_Algorithm wa = new Watershed_Algorithm();
            wa.run(stack.getSlice(z), stack.getWidth(), stack.getHeight());
        }
    }

Examples of net.sourceforge.watershed.Watershed_Algorithm

Related Classes of net.sourceforge.watershed.Watershed_Algorithm