A minimum spanning tree based image segmentation algorithm with closed-form solution
2014 (English)In: Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology, ISSN 0367-6234, Vol. 46, no 9, 123-128 p.Article in journal (Refereed) Published
For the edges between objects and background in an image are intertwined or their common boundaries are vague as well as the textures of objects and background are similar, a new method based on graph theory and closed-form solution was proposed. First, it uses closed-form solution to initially separate the objects from background roughly, then, to extract the detailed information of inter objects, it applies an improved graph-based algorithm to obtain the final image segmentation results. The test results show that the algorithm of matting avoids aliasing of foreground and background and the improved graph-based algorithm increases segmentation accuracy by 6% 12% effectively. Compared to the traditional algorithms such as region merging, ordinary graph, and thresholding, the new algorithm has the better accuracy and effect, therefore it has the significant superiority.
Place, publisher, year, edition, pages
2014. Vol. 46, no 9, 123-128 p.
Closed-form solution, Graph theory, Image segmentation, Minimum spanning tree
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-161008ScopusID: 2-s2.0-84908375325OAI: oai:DiVA.org:kth-161008DiVA: diva2:795676
QC 201503172015-03-172015-03-062015-03-17Bibliographically approved