About: A Hierarchical Finite-State Model for Texture Segmentation     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
  • A novel model for unsupervised segmentation of texture images is presented. The image to be segmented is first discretized and then a hierarchical finite-state region-based model is automatically coupled with the data by means of a sequential optimization scheme, namely the Texture Fragmentation and Reconstruction (TFR) algorithm. Both intra- and inter-texture interactions are modeled, by means of an underlying hierarchical finite-state model, and eventually the segmentation task is addressed in a completely unsupervised manner. The output is then a nested segmentation, so that the user may decide the scale at which the segmentation has to be provided. TFR is composed of two steps: the former focuses on the estimation of the states at the finest level of the hierarchy, and is associated with an image fragmentation, or over-segmentation; the latter deals with the reconstruction of the hierarchy representing the textural interaction at different scales.
  • A novel model for unsupervised segmentation of texture images is presented. The image to be segmented is first discretized and then a hierarchical finite-state region-based model is automatically coupled with the data by means of a sequential optimization scheme, namely the Texture Fragmentation and Reconstruction (TFR) algorithm. Both intra- and inter-texture interactions are modeled, by means of an underlying hierarchical finite-state model, and eventually the segmentation task is addressed in a completely unsupervised manner. The output is then a nested segmentation, so that the user may decide the scale at which the segmentation has to be provided. TFR is composed of two steps: the former focuses on the estimation of the states at the finest level of the hierarchy, and is associated with an image fragmentation, or over-segmentation; the latter deals with the reconstruction of the hierarchy representing the textural interaction at different scales. (en)
  • Nový model neřízené segmentace texturních obrazů je studován v článku. Segmentovaný obraz se nejprve diskretizuje a potom hierarchický model s konečnými stavy je automaticky naučen na datech pomocí sekvenčního optimalizačního algoritmu nazvaného Texture Fragmentation and Reconstruction (TFR) algoritmus. Jak intra, tak inter texturní interakce jsou modelovány pomocí tohoto hierarchického modelu s konečnými stavy a segmentace je uskutečněna zcela neřízeným způsobem. Výsledkem je hierarchická segmentace, kde se uživatel může rozhodnout pro její měřítko. TFR se skládá ze dvou kroků, odhadu stavů a obrazové fragmentace. (cs)
Title
  • A Hierarchical Finite-State Model for Texture Segmentation
  • A Hierarchical Finite-State Model for Texture Segmentation (en)
  • Hierarchický model s konečnými stavy pro segmentaci textur (cs)
skos:prefLabel
  • A Hierarchical Finite-State Model for Texture Segmentation
  • A Hierarchical Finite-State Model for Texture Segmentation (en)
  • Hierarchický model s konečnými stavy pro segmentaci textur (cs)
skos:notation
  • RIV/67985556:_____/07:00083357!RIV08-AV0-67985556
http://linked.open.../vavai/riv/strany
  • 1209;1212
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET400750407), R, Z(AV0Z10750506)
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
  • 407907
http://linked.open...ai/riv/idVysledku
  • RIV/67985556:_____/07:00083357
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • image segmentation; texture; Markov random fields (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [E86C176463D0]
http://linked.open...v/mistoKonaniAkce
  • Honolulu
http://linked.open...i/riv/mistoVydani
  • Los Alamos
http://linked.open...i/riv/nazevZdroje
  • IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP'07) /32./
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Haindl, Michal
  • Scarpa, G.
  • Zerubia, J.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 1520-6149
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE
is http://linked.open...avai/riv/vysledek of
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, 97 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software