About: On Partial Opimality by Auxiliary Submodular Problems

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

About: On Partial Opimality by Auxiliary Submodular Problems 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
Description	We prove several relations between 3 energy minimization techniques. Methods for determining a provably optimal partial assignment of variables by Ivan Kovtun (IK), the linear programming relaxation approach (LP) and the popular expansion move algorithm by Yuri Boykov. We propose a novel suffcient condition of optimal partial assignment, which is based on LP relaxation and called LP-autarky. We show that methods of Kovtun, which build auxiliary submodular problems, fulfill this suffcient condition. The following link is thus established: LP relaxation cannot be tightened by IK. For non-submodular problems this is a non-trivial result. In the case of two labels, LP relaxation provides optimal partial assignment, known as persistency, which, as we show, dominates IK. Relating IK with expansion move, we show that the set of fixed points of expansion move with any %22truncation%22 rule for the initial problem and the problem restricted by one-vs-all method of IK would coincide. We prove several relations between 3 energy minimization techniques. Methods for determining a provably optimal partial assignment of variables by Ivan Kovtun (IK), the linear programming relaxation approach (LP) and the popular expansion move algorithm by Yuri Boykov. We propose a novel suffcient condition of optimal partial assignment, which is based on LP relaxation and called LP-autarky. We show that methods of Kovtun, which build auxiliary submodular problems, fulfill this suffcient condition. The following link is thus established: LP relaxation cannot be tightened by IK. For non-submodular problems this is a non-trivial result. In the case of two labels, LP relaxation provides optimal partial assignment, known as persistency, which, as we show, dominates IK. Relating IK with expansion move, we show that the set of fixed points of expansion move with any %22truncation%22 rule for the initial problem and the problem restricted by one-vs-all method of IK would coincide. (en)
Title	On Partial Opimality by Auxiliary Submodular Problems On Partial Opimality by Auxiliary Submodular Problems (en)
skos:prefLabel	On Partial Opimality by Auxiliary Submodular Problems On Partial Opimality by Auxiliary Submodular Problems (en)
skos:notation	RIV/68407700:21230/11:00181662!RIV12-MSM-21230___
http://linked.open...avai/predkladatel	Fakulta elektrotechnická
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(1M0567), P(7E10044)
http://linked.open...iv/cisloPeriodika	2
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Hlaváč, Václav Shekhovtsov, Oleksandr
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	218097
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/11:00181662
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	bag-of-words; query expansion; large scale image retrieval (en)
http://linked.open.../riv/klicoveSlovo	bag-of-words large scale image retrieval query expansion
http://linked.open...odStatuVydavatele	UA - Ukrajina
http://linked.open...ontrolniKodProRIV	[D5BD91C28395]
http://linked.open...i/riv/nazevZdroje	Control Systems and Computers
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Centre for Applied Cybernetics Natural human-robot cooperation in dynamic environments
http://linked.open...UplatneniVysledku	2011
http://linked.open...v/svazekPeriodika	232
http://linked.open...iv/tvurceVysledku	Hlaváč, Václav Shekhovtsov, Oleksandr
issn	0130-5395
number of pages	8 (xsd:int)
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	On Partial Opimality by Auxiliary Submodular Problems On Partial Opimality by Auxiliary Submodular Problems

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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software