An unsupervised and robust algorithm for segmenting color images

using graph theoretic concepts is proposed in this paper. A novel region

growing procedure is proposed for cycle (segments) formation and cycle

merging. Experiments were carried out on standard Berkeley Segmentation

Database Set (BSDS) and other public domain images and the results show the

efficacy of the proposed method