About: Windowpane Detection based on Maximum Aposteriori Probability Labeling

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

About: Windowpane Detection based on Maximum Aposteriori Probability Labeling Goto Sponge Distinct 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	Segmentation of windowpanes in images of building facades is formulated as a task of maximum aposteriori probability labeling. Assuming orthographic rectification of the image, the windowpanes are always axis-parallel rectangles of relatively low variability in appearance. Every image pixel has one of 10 possible labels, and the labels in adjacent pixels are constrained by allowed label configuration, such that the image labels represent a set of non-overlapping rectangles. The task of finding the most probable labeling of a given image leads to NP-hard discrete optimization problem. However, we find an approximate solution using a general solver suitable for such problems and we obtain promising results which we demonstrate on several experiments. Substantial difference between the presented paper and the state-of-the-art papers on segmentation based on Markov Random Fields is that we have a strong structure model, forcing the labels to form rectangles, while other methods do not mode Segmentation of windowpanes in images of building facades is formulated as a task of maximum aposteriori probability labeling. Assuming orthographic rectification of the image, the windowpanes are always axis-parallel rectangles of relatively low variability in appearance. Every image pixel has one of 10 possible labels, and the labels in adjacent pixels are constrained by allowed label configuration, such that the image labels represent a set of non-overlapping rectangles. The task of finding the most probable labeling of a given image leads to NP-hard discrete optimization problem. However, we find an approximate solution using a general solver suitable for such problems and we obtain promising results which we demonstrate on several experiments. Substantial difference between the presented paper and the state-of-the-art papers on segmentation based on Markov Random Fields is that we have a strong structure model, forcing the labels to form rectangles, while other methods do not mode (en)
Title	Windowpane Detection based on Maximum Aposteriori Probability Labeling Windowpane Detection based on Maximum Aposteriori Probability Labeling (en)
skos:prefLabel	Windowpane Detection based on Maximum Aposteriori Probability Labeling Windowpane Detection based on Maximum Aposteriori Probability Labeling (en)
skos:notation	RIV/68407700:21230/08:00144353!RIV10-MSM-21230___
http://linked.open...avai/riv/aktivita	P R
http://linked.open...avai/riv/aktivity	P(1ET101210407), R
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Šára, Radim Čech, Jan
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	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	405795
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/08:00144353
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Markov Random Field; constrained segmentation; probabilistic labeling; structure model (en)
http://linked.open.../riv/klicoveSlovo	Markov Random Field constrained segmentation probabilistic labeling structure model
http://linked.open...ontrolniKodProRIV	[332DFA87D938]
http://linked.open...v/mistoKonaniAkce	Buffalo
http://linked.open...i/riv/mistoVydani	Singapore
http://linked.open...i/riv/nazevZdroje	Image Analysis - From Theory to Applications, Proceedings of the 12th International Workshop on Combinatorial Image Analysis (IWCIA'08)
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	Multi-camera system for modeling and recognition of events
http://linked.open...UplatneniVysledku	2008
http://linked.open...iv/tvurceVysledku	Čech, Jan Šára, Radim
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2008-04-07 (xsd:date)
number of pages	9 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Research Publishing Services
https://schema.org/isbn	978-3-540-78274-2
http://localhost/t...ganizacniJednotka	21230

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