A Structural Approach to Image Segmentation
Daniel Gómez, Javier Montero, Javier Yáñez · 2009
In this work we propose an efficient and polynomial algorithm for the graph segmentation problem based on the coloring problem for graphs. The work here presented extend the algorithm published in making possible the segmentation to any class of graph (not only fuzzy-valued planar graphs) and also improving the computational complexity of the previous work.