Full text
| |
| Author(s): |
André Luis da Costa
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | Limeira, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Faculdade de Tecnologia |
| Defense date: | 2013-02-22 |
| Examining board members: |
Marco Antonio Garcia de Carvalho;
João Paulo Papa;
Hélio Pedrini
|
| Advisor: | Marco Antonio Garcia de Carvalho |
| Abstract | |
The problem of bacteria colonies segmentation in Petri dishes has some very different characteristics from those found, for example, in segmenting natural images. The main feature is the high number of colonies that can be found on a plate. Thus, it is essential that the segmentation algorithm is capable of performing the image segmentation into a huge number of regions. This extreme scenario is ideal for analyzing segmentation algorithms limitations. In fact, this study showed that the original normalized cut algorithm, which is based on the spectral graph theory, is inappropriate for applications that require that the segmentation be performed on a large number of regions. However, the use of normalized cut criteria for segmenting bacteria colonies images is still possible thanks to a new algorithm that is being introduced in this paper. The new algorithm is based on hierarchical clustering of the graph nodes, instead of using the spectral theory concepts. Experiments also show that the bi-partitioning of a graph by the new algorithm has a normalized cut average value about 40 times lesser than the bi-partitioning by the algorithm based on the spectral theory (AU) | |
| FAPESP's process: | 10/14759-0 - Bacterial colony segmentation using graph cut |
| Grantee: | André Luis da Costa |
| Support Opportunities: | Scholarships in Brazil - Master |