Adaptation of the watershed cuts algorithm to cellular complexes
From LRDE
- Authors
- Guillaume Doré
- Type
- techreport
- Year
- 2015
- Number
- 1507
- Projects
- Olena
- Keywords
- Watershed cuts, minimum spanning forests, image processing
Abstract
The main purpose of the watershed algorithm is to segment a gray-level image into regions (basins). More specifically, the "watershed cut" algorithm performs some cuts in an edge-valued graph built from an image.First we have considered an image as a 4-connected graph, where the vertices represent the pixels. Yet we have noticed that this representation can miss some local minima. A second approach, based on a simplicial complex, has been studied. This work relies on Milena, the generic C++ library dedicated to image processing library developed at the LRDE.