About: Windowpane Detection based on Maximum Aposteriori Labeling     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)

AttributesValues
rdf:type
Description
  • Segmentation of windowpanes in the images of facades is formulated as a task of maximum aposteriori labeling. Assuming orthographic rectification of the building facade, the windowpanes are always axis-parallel rectangles of relatively low variability in appearance. Every image pixel has one of 10 possible labels, and the adjacent pixels are interconnected via links which defines allowed label configuration, such that the labels are forced to form 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 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 does not model the structure at all, they typically only have a penalty when adjacent labels are different, in order to make resulting patches more continuous to reduce influence of noise and prevent over-segmentation.
  • Segmentation of windowpanes in the images of facades is formulated as a task of maximum aposteriori labeling. Assuming orthographic rectification of the building facade, the windowpanes are always axis-parallel rectangles of relatively low variability in appearance. Every image pixel has one of 10 possible labels, and the adjacent pixels are interconnected via links which defines allowed label configuration, such that the labels are forced to form 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 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 does not model the structure at all, they typically only have a penalty when adjacent labels are different, in order to make resulting patches more continuous to reduce influence of noise and prevent over-segmentation. (en)
Title
  • Windowpane Detection based on Maximum Aposteriori Labeling
  • Windowpane Detection based on Maximum Aposteriori Labeling (en)
skos:prefLabel
  • Windowpane Detection based on Maximum Aposteriori Labeling
  • Windowpane Detection based on Maximum Aposteriori Labeling (en)
skos:notation
  • RIV/68407700:21230/07:00218868!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • R
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 461317
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/07:00218868
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Segmentation; structure model; Markov Random Fields; MRF; Potts model; labeling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [CD337CE5EDF8]
http://linked.open...i/riv/mistoVydani
  • Praha
http://linked.open...telVyzkumneZpravy
  • Center for Machine Perception, K13133 FEE, Czech Technical University
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Čech, Jan
  • Šára, Radim
number of pages
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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