Image segmentation by improved minimum spanning tree with fractional differential and Canny detector

Lin, JianpuFuzhou Univ, Coll Phys & Informat Engn, Natl Local Joint Engn Lab Flat Panel Display Tech, Fuzhou 10086, Fujian, Peoples R China. (författare)

QC 20191002
In this study, we propose an algorithm that uses an improved Minimum Spanning Tree algorithm and a modified Canny edge detector to segment images that contain a considerable amount of noises. First, we use our modified Canny operator to pre-process an image, and record the obtained object boundary information; then, we apply the improved Minimum Spanning Tree algorithm to associate the above information with boundary points in order to separate edges into two classes in the image, namely the inner and boundary regions. In particular, Minimum Spanning Tree algorithm is improved by using Fractional differential and combining the functions of the intra-regional and inter-regional differences with a function for edge weights. Based on the experimental results, compared with the other four exiting algorithms, the new algorithm has the higher accuracy and the better effect for noised image segmentation.

Guo, TailiangFuzhou Univ, Coll Phys & Informat Engn, Natl Local Joint Engn Lab Flat Panel Display Tech, Fuzhou 10086, Fujian, Peoples R China. (författare)
Yan, Qun F.Fuzhou Univ, Coll Phys & Informat Engn, Natl Local Joint Engn Lab Flat Panel Display Tech, Fuzhou 10086, Fujian, Peoples R China. (författare)
Wang, WeixingKTH,Fuzhou Univ, Coll Phys & Informat Engn, Natl Local Joint Engn Lab Flat Panel Display Tech, Fuzhou 10086, Fujian, Peoples R China.(Swepub:kth)PI000000 (författare)
KTHFuzhou Univ, Coll Phys & Informat Engn, Natl Local Joint Engn Lab Flat Panel Display Tech, Fuzhou 10086, Fujian, Peoples R China. (creator_code:org_t)

Ingår i:Journal of Algorithms and Computational Technology: SAGE PUBLICATIONS LTD131748-30181748-3026

Av författaren/redakt...: Lin, Jianpu; Guo, Tailiang; Yan, Qun F.; Wang, Weixing

Om ämnet

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.