kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Improved Minimum Spanning Tree based Image Segmentation with Guided Matting
Changan Univ, Sch Informat Engn, Xian 710064, Peoples R China..
Shaoxing Univ, Dept Comp Sci & Engn, Shaoxing 312000, Peoples R China..
2022 (English)In: KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, ISSN 1976-7277, Vol. 16, no 1, p. 211-230Article in journal (Refereed) Published
Abstract [en]

In image segmentation, for the condition that objects (targets) and background in an image are intertwined or their common boundaries are vague as well as their textures are similar, and the targets in images are greatly variable, the deep learning might be difficult to use. Hence, a new method based on graph theory and guided feathering is proposed. First, it uses a guided feathering algorithm to initially separate the objects from background roughly, then, the image is separated into two different images: foreground image and background image, subsequently, the two images are segmented accurately by using the improved graph-based algorithm respectively, and finally, the two segmented images are merged together as the final segmentation result. For the graph-based new algorithm, it is improved based on MST in three main aspects: (1) the differences between the functions of intra-regional and inter-regional; (2) the function of edge weight; and (3) re-merge mechanism after segmentation in graph mapping. Compared to the traditional algorithms such as region merging, ordinary MST and thresholding, the studied algorithm has the better segmentation accuracy and effect, therefore it has the significant superiority.

Place, publisher, year, edition, pages
Korean Society for Internet Information (KSII) , 2022. Vol. 16, no 1, p. 211-230
Keywords [en]
Graph Theory, Guided Feathering, Image Segmentation, Minimum Spanning Tree
National Category
Computer graphics and computer vision
Identifiers
URN: urn:nbn:se:kth:diva-309428DOI: 10.3837/tiis.2022.01.012ISI: 000752285800011Scopus ID: 2-s2.0-85124595408OAI: oai:DiVA.org:kth-309428DiVA, id: diva2:1642579
Note

QC 20220307

Available from: 2022-03-07 Created: 2022-03-07 Last updated: 2025-02-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Bergholm, Fredrik

Search in DiVA

By author/editor
Bergholm, Fredrik
By organisation
KTH
Computer graphics and computer vision

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 32 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf