brip_watershed.h File Reference

---

Detailed Description

Computes the seeded watershed algorithm.

Author:

J.L. Mundy

The watershed algorithm proceeds from a set of seeds that are defined by some other process. A typical seed generator is to find local minima of gradient magnitude. A cost function is defined that provides a measure on pixels in the image. A typical cost is based on the gradient magnitude. The initial seed is extended to a region by adding the lowest cost pixel. The region continues to grow by adding lowest cost unlabeled pixels to each pixel in the region.

Each seed defines a unique label which is propagated to each pixel in the associated region. Regions are isolated by a boundary with a unique (0) label.

Region growth is managed by a priority queue. Neigborhing pixels to each seed are inserted in the queue to get the process started. When a new pixel is added to the region, its unlabeled neighbors are added to the queue.

    Modifications
     Initial version June 18, 2004
   

Definition in file brip_watershed.h.

#include <vcl_map.h>
#include <vcl_queue.h>
#include <vbl/vbl_array_2d.h>
#include <vil1/vil1_image.h>
#include <vil1/vil1_memory_image_of.h>
#include <brip/brip_region_pixel.h>
#include <brip/brip_watershed_params.h>

Go to the source code of this file.

Classes
class	brip_watershed

---