Sökning: id:"swepub:oai:DiVA.org:kth-161008" >
A minimum spanning ...
A minimum spanning tree based image segmentation algorithm with closed-form solution
-
- Wang, Weixing (författare)
- KTH,Skolan för informations- och kommunikationsteknik (ICT),School of Physics and Information Engineering, Fuzhou University, Fuzhou, China
-
Shi, H. (författare)
-
(creator_code:org_t)
- 2014
- 2014
- Engelska.
-
Ingår i: Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology. - 0367-6234. ; 46:9, s. 123-128
- Relaterad länk:
-
https://urn.kb.se/re...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences (hsv//eng)
Nyckelord
- Closed-form solution
- Graph theory
- Image segmentation
- Minimum spanning tree
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas