About: Image segmentation using iterated graph cuts with residual graph

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Image segmentation using iterated graph cuts with residual graph Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://link.springer.com/chapter/10.1007%2F978-3-642-41914-0_23
Description	In this paper, we present a new image segmentation method using iterated graph cuts. In the standard graph cuts method, the data term is computed on the basis of the brightness/color distribution of object and background. In this case, some background regions with the brightness/color similar to the object may be incorrectly labeled as an object. We try to overcome this drawback by introducing a new data term that reduces the importance of brightness/color distribution. This reduction is realised by a new part that uses data from a residual graph that remains after performing the max-flow algorithm. According to the residual weights, we change the weights of t-links in the graph and find a new cut on this graph. This operation makes our method iterative. The results and comparison with other graph cuts methods are presented. In this paper, we present a new image segmentation method using iterated graph cuts. In the standard graph cuts method, the data term is computed on the basis of the brightness/color distribution of object and background. In this case, some background regions with the brightness/color similar to the object may be incorrectly labeled as an object. We try to overcome this drawback by introducing a new data term that reduces the importance of brightness/color distribution. This reduction is realised by a new part that uses data from a residual graph that remains after performing the max-flow algorithm. According to the residual weights, we change the weights of t-links in the graph and find a new cut on this graph. This operation makes our method iterative. The results and comparison with other graph cuts methods are presented. (en)
Title	Image segmentation using iterated graph cuts with residual graph Image segmentation using iterated graph cuts with residual graph (en)
skos:prefLabel	Image segmentation using iterated graph cuts with residual graph Image segmentation using iterated graph cuts with residual graph (en)
skos:notation	RIV/61989100:27240/13:86088519!RIV14-MSM-27240___
http://linked.open...avai/predkladatel	Fakulta elektrotechniky a informatiky
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Sojka, Eduard Holuša, Michael
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	78868
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/13:86088519
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	residual graph; graph cuts; Image segmentation (en)
http://linked.open.../riv/klicoveSlovo	residual graph Image segmentation graph cuts
http://linked.open...ontrolniKodProRIV	[1BCC9D6642C9]
http://linked.open...v/mistoKonaniAkce	Rethymnon
http://linked.open...i/riv/mistoVydani	London
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computer Science. Volume 8033
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2013
http://linked.open...iv/tvurceVysledku	Sojka, Eduard Holuša, Michael
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-07-29 (xsd:date)
issn	0302-9743
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-41914-0_23
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-41913-3
http://localhost/t...ganizacniJednotka	27240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software