文件名称:images
介绍说明－－下载内容均来自于网络，请自行研究使用
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
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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Color Image Segmentation Using Minimum Spanning.pdf