In order to improve the quality of image segmentation
Graph Theory Threshold Algorithm is established. First
map function is constructed between the graph and image
each vertex is mapped by point
each edge is mapped by line. Second
decision table of image edge is set by attribute of area
gray feature is defined weight coefficient between pixel of different points and groups
decisions of attribute weight are constructed with figure of pixel. Third
similar of pixel is computed by cluster between object and background class
minimum spanning tree method solved the problem of pseudo cut set. Finally
process is described. The experiments show this algorithm made image edge clearly
eliminate the over and under of merger phenomenon
entropy of information is 28.7803 bit
time are 1.454 3 s. It takes less time and has large information.
关键词
Keywords
references
张俊娜,冯云芝. 基于量子最大熵多阈值算法的图像分割研究[J]. 激光与红外,2013,43(5):578-582. Zhang J N, Feng Y Z. Image segmentation research based on quantum maximum entropy algorithm [J].Laser and Infrared,2013,43(5):578-582.(in Chinese)[2] Cheng L J, Ding Y S, Hao K R, et al. An ensemble kernel classifier with immune clonal selection algorithm for automatic discriminant of primary open- angle glaucoma [J].Neuro Computing, 2012, 83(4):1-11.[3] 张田. 一种改进的基于图的图像分割方法[J]. 西华大学学报,2011,30(1):61-64. Zhang T. An Improved graph-based image segmentation method [J]. Journal of Xihua University,2011,30(1):61-64.(in Chinese)[4] Wu Z, Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation [J].IEEE Transactions on Pattern Analysis and Machine Intelligence, 1993, 15(11):1101-1113.[5] Shi J, Malik J. Normalized cuts and image segmentation [J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2000, 22(8):888-905.[6] Grady L, Schwartz E L. Isoperimetric graph partitioning for image segmentation [J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2006, 28(3):469-475.[7] Felzenszwalb P. Efficient graph-based image segmentation [J].International Journal of Computer Vision,2004, 59(2):167-181.[8] 陈丽娟. 矩阵论中的图论匹配法[J]. 南京信息工程大学学报,2011,3(6):571-573. Chen L J. Matching method of graph theory in matrix theory [J].Journal of Nanjing University of Information Science and Technology,2011,3(6):571-573.(in Chinese)[9] 方富贵. 图论的算法和应用研究[J]. 计算机与数字工程,2012,40(2):115-117. Fang F G. Study on the Algorithm and applications in graph theory [J]. Computer and Digital Engineering,2012,40(2):115-117. (in Chinese)[10] 卢鹏,王锡淮,肖健梅. 连续属性决策表离散化的图论方法[J]. 计算机工程与应用,2012,48(6):13-16. Lu P, Wang X H, Xiao J M. Graph method of discretization of decision table with continuous attributes [J].Computer Engineering and Applications,2012,48(6):13-16. (in Chinese)[11] 洪汉玉,颜露新,郭祥云,等.生产线复杂场景条件下的动目标提取方法[J]. 华中科技大学学报,2012,40(7):57-61. Hong H Y,Yan L X,Guo X Y,et al. Approach to extract moving targets from production line under complex scenes [J].Journal of Huazhong University of Science And Technology,2012,40(7):57-61. (in Chinese)[12] 段薇,马丽,路向阳.基于信息增益和最小距离分类的决策树改进算法[J]. 科学技术与工程,2013,13(6):1643-1646. Duan W, Ma L, Lu X Y. An improved algorithm of decision tree based on information gain and minimum distance classification [J].Science Technology and Engineering,2013,13(6):1643-1646. (in Chinese)[13] 熊小华,刘艳芳,宁爱兵.图的Steiner最小树的竞争决策算法[J]. 上海理工大学学报,2012,34(5):1643-1646. Xiong X H, Liu Y F, Ning A B. Competitive decision algorithm for the steiner minimal tree problem in graphs[J].Journal of University of Shanghai for Science and Technology,2012,34(5):1643-1646. (in Chinese)[14] 李荪,李哲英,刘佳,等. 图论分割算法算子消耗模型OCM的建立与分析[J]. 电子测量与仪器学报,2012,26(11):1011-1018. Li S,Li Z Y, Liu J,et al. Operator cost model and analysis based on graph-based segmentation [J]. Journal of Electronic Measurement and Instrument,2012,26(11):1011-1018. (in Chinese)[15] 张乾,冯夫健,林鑫,等. 一种基于图论的图像分割算法[J]. 计算机工程,2012,38(18):194-197. Zhang Q,Feng F J,lin X, et al. An image segmentation algorithm based on graph theory [J]. Computer Engineering,2012,38(18):194-197. (in Chinese)