Advanced Search

ISSN1001-3806 CN51-1125/TN Map

Volume 38 Issue 6
Sep.  2014
Article Contents
Turn off MathJax

Citation:

Research of image segmentation based on graph theory and minimum cut set algorithm

  • Received Date: 2013-12-25
    Accepted Date: 2014-03-07
  • In order to improve the quality of image segmentation, graph theory and minimal cut set algorithm were used. Firstly, using the pixel points of image as the mapping nodes of the graph theory, the node weight were calculated by the ratio of the balance factor and the shared nearest neighbor nodes. Then, the minimum cut set of the image was established based on the minimized energy equation, the gray value of the segmentation block was extracted as the block feature vector and the image was segmented by minimum spanning tree. The adjacent regions were judged to be combined or to be segmented by judging function. Finally the algorithm flow was given. The results show that the target information can be segmented by this algorithm. This algorithm has good robustness and small peak memory.
  • 加载中
  • [1]

    XU T J, QIAN X F, DAI X R, et al. Unwrapping algorithm based on segmentation and zooming for under sampled wrapped phase[J]. Laser Technology, 2014, 38(1): 39-43 (in Chinese).
    [2]

    WEI XE F, LIU X. Research of image segmentation based on 2-D maximum entropy optimal threshold[J].Laser Technology, 2013, 37(4): 519-522 (in Chinese).
    [3]

    HUANG J, YUAN Zh W, TIAN Z Sh. Research on wavelet threshold function denoising of CDMA signal[J]. Video Engineering, 2013, 37(7): 75-78 (in Chinese).
    [4]

    LI K F, WANG Zh. Application of improved wavelet threshold denoising in speech recognition[J]. Computer Technology and Development, 2013, 23(5): 231-234 (in Chinese).
    [5]

    CHEN Y X. Ant spatial clustering based on fuzzy if-then rule[J]. Mathematics in Practice and Theory, 2011, 41(19): 114-119 (in Chinese).
    [6]

    LI M, LUO H Y, ZHENG X L, et al. Image segmentation based on improved Otsu algorithm[J]. Journal of Nanjing University of Science and Technology, 2012, 36(2): 332-337 (in Chinese).
    [7]

    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).
    [8]

    XIE Y Sh, FAN X P, LIAO Zh F, et al. Weighted cluster fusion algorithm based on graph[J]. Application Research of Computers, 2013, 30(4): 1015-1016 (in Chinese).
    [9]

    JING G Q, CHEN D W. A finite element nodal ordering with algebraic graph theory[J]. Journal of Tongji University, 2010, 38(6): 929-934 (in Chinese).
    [10]

    MENG Q T. Segmentation algorithms based on the natural scene graph and clustering image. Suzhou: Soochow University, 2010: 32-46 (in Chinese).
    [11]

    WANG X S, ZHOU M Q, FAN Y CH, et al. The algorithm of graph cut using HSI weights in color image segmentation[J]. Journal of Image and Graphics, 2011, 16(2):221-226 (in Chinese).
    [12]

    CUI B G, MENG A X. Fast remote sensing image segmentation algorithm based on nearest neighbor direct graph[J]. Computer Science, 2013, 40(10): 274-278 (in Chinese).
  • 加载中
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Article views(3625) PDF downloads(657) Cited by()

Proportional views

Research of image segmentation based on graph theory and minimum cut set algorithm

  • 1. College of Information Engineering, Huanghuai University, Zhumadian 463000, China

Abstract: In order to improve the quality of image segmentation, graph theory and minimal cut set algorithm were used. Firstly, using the pixel points of image as the mapping nodes of the graph theory, the node weight were calculated by the ratio of the balance factor and the shared nearest neighbor nodes. Then, the minimum cut set of the image was established based on the minimized energy equation, the gray value of the segmentation block was extracted as the block feature vector and the image was segmented by minimum spanning tree. The adjacent regions were judged to be combined or to be segmented by judging function. Finally the algorithm flow was given. The results show that the target information can be segmented by this algorithm. This algorithm has good robustness and small peak memory.

Reference (12)

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return