期刊文献+

基于测地线的超像素谱聚类彩色图像分割 被引量:4

Color image segmentation of spectral clustering based on super pixel geodesic
下载PDF
导出
摘要 在图像分割中谱聚类算法得到了广泛的应用,但传统谱聚类算法易受到彩色图像大小和相似性测度的影响,导致计算量大和分割精度低的问题。为了解决这两个问题,提出一种新的基于超像素集测地线特征的谱聚类分割算法。该方法通过对彩色图像进行预分割得到超像素集,并以超像素集为基础构造加权图,利用测地线距离特征和颜色特征构造权值矩阵,最后应用NJW(Ng-Jordan-Weiss)算法得到最终的分割结果。对比实验结果表明该算法在分割精度和计算复杂度上都有较大改善。 Spectral clustering algorithm has been widely used in image segmentation, however, traditional spectral cluster- ing algorithms are susceptible to the effect of color image size and similarity measure. They create large amount of calcu- lation and the poor segmentation result. In order to solve these two problems, this paper proposes a new spectral clustering segmentation algorithm based on geodesic characteristics of super pixel set. It uses the pre-segmentation to get the super set of pixels. Then it constructs a weighted graph, and uses the geodesic distance and color features to build a weight matrix. It uses NJW (Ng-Jordan-Weiss) algorithm to get the segmentation result. The experimental results show that the segmenta- tion accuracy and computational complexity of the algorithm in this paper are improved substantially.
出处 《计算机工程与应用》 CSCD 北大核心 2015年第23期155-159,270,共6页 Computer Engineering and Applications
基金 国家自然科学基金(No.61373055)
关键词 预分割 超像素集 测地线距离 Ng-Jordan-Weiss(NJW)算法 pre-segmentation super pixel sets geodesic distance Ng-Jordan-Weiss(NJW) algorithm
  • 相关文献

参考文献17

  • 1Von L U.A tutorial on spectral clustering[J].Statistics and Computing,2007,17(4):395-416.
  • 2Shi J,Malik J.Normalized cut and image segmentation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2000,22(8):888-905.
  • 3Cour T,Bénézit F,Shi J.Spectral segmentation with multiscale graph decomposition[C]//Proc IEEE CVPR,2005:1124-1131.
  • 4Kim T H,Lee K M,Lee S U.Learning full pairwise affinities for spectral segmentation[C]//Proc IEEE CVPR,2010:2101-2108.
  • 5Bai X,Sapiro G.A geodesic framework for fast interactive image and video segmentation and matting[C]//Proc IEEE ICCV,2007:1-8.
  • 6Criminisi A,Sharp T,Blake A.Geos:geodesic image segmentation[C]//Proc ECCV,2008,1:99-112.
  • 7Price B L,Morse B S,Cohen S.Geodesic graph cut for interactive image segmentation[C]//Proc IEEE CVPR,2010:3161-3168.
  • 8Gulshan V,Rother C,Criminisi A,et al.Geodesic star convexity for interactive image segmentation[C]//Proc IEEE CVPR,2010:3129-3136.
  • 9Sumengen B,Bertelli L,Manjunath B.Fast and adaptive pairwise similarities for graph cuts-based image segmentation[C]//Proc CVPRW,2006.
  • 10Fowlkes C,Belongie S,Chung F,et al.Spectral grouping using the Nystr?m method[J].IEEE Trans on Pattern Analysis and Machine Intelligence,2004,26(2):214-225.

二级参考文献6

  • 1Tao Wenbing,Jin Hai,Zhang Yimin.Color imagesegmentation based on mean shift and normalized cuts. IEEE Transactions on Systems Man and Cybernetics . 2007
  • 2Zahn CT.Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers . 1971
  • 3Shi J,Malik J.Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence . 2000
  • 4Fukunaga K,Hostetler L D.The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Transactions on Information Theory . 1975
  • 5Cheng Y.Mean shift,mode seeking and clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence . 1995
  • 6贲志伟,赵勋杰.基于Mean Shift算法提取彩色图像有意义区域[J].激光与红外,2009,39(9):1004-1008. 被引量:6

共引文献31

同被引文献19

  • 1吕子昂,罗四维,杨坚,刘蕴辉,邹琪.模型的固有复杂度和泛化能力与几何曲率的关系[J].计算机学报,2007,30(7):1094-1103. 被引量:4
  • 2王玲,薄列峰,焦李成.密度敏感的谱聚类[J].电子学报,2007,35(8):1577-1581. 被引量:61
  • 3WU Z, LEAHY R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentationEJ~. IEEE Trans on PAMI,1993,15(ll):1101-1113.
  • 4SHI J, MALIK J. Normalized cuts and image segmentation[-J~. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000,22(8) :888-905.
  • 5HAGEN L,KAHNG A B. New spectral methods for ratio cut par- titioning and clustering EJ~. Computer-Aided Design, 1992,11 ( 9 ) .. 1074-1085.
  • 6SARKAR S, SOUNDARARAJAN P. Supervised learning of large perceptual organization: Graph spectral partitioning and learning automataEJ~. IEEE Transaction on Pattern Analysis and Machine Intelligence, 2000,22 (5) : 504-525.
  • 7DING C,HE X,ZHA H,et al. Spectral min-max cut for graph par- titioning and data clusteringEC~. Proc. of the IEEE Intl Conf. on Data Mining. 2001 ~ 107-114o.
  • 8MEILA M, XU L. Multiway cuts and spectral clusteringEZ~. Uni- versity o[ Washington Technical Report, 2003 : 442-447.
  • 9DRAKE A,VENTURA D. An empirical comparison of spectral learning methods for elassification[-C3. Proceedings of the 12th In- ternational Conference on Machine Learning and Applications, IEEE,2013(1) :9-14.
  • 10王磊,段会川.Otsu方法在多阈值图像分割中的应用[J].计算机工程与设计,2008,29(11):2844-2845. 被引量:92

引证文献4

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部