bibtype C - Conference Paper (international conference)
ARLID 0395211
utime 20240103202838.6
mtime 20130920235959.9
WOS 000345516500052
DOI 10.1007/978-3-642-40261-6_52
title (primary) (eng) Unsupervised Dynamic Textures Segmentation
specification
page_count 8 s.
media_type P
serial
ARLID cav_un_epca*0395210
ISBN 978-3-642-40260-9
ISSN 0302-9743
title Computer Analysis of Images and Patterns
part_num I
part_title Part I
page_num 433-440
publisher
place Heidelberg
name Springer
year 2013
editor
name1 Wilson
name2 Richard
editor
name1 Bors
name2 Adrian
editor
name1 Hancock
name2 Edwin
editor
name1 Smith
name2 William
keyword dynamic texture segmentation
keyword unsupervised segmentation
author (primary)
ARLID cav_un_auth*0101093
name1 Haindl
name2 Michal
full_dept (cz) Rozpoznávání obrazu
full_dept (eng) Department of Pattern Recognition
department (cz) RO
department (eng) RO
institution UTIA-B
full_dept Department of Pattern Recognition
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0101165
name1 Mikeš
name2 Stanislav
full_dept (cz) Rozpoznávání obrazu
full_dept Department of Pattern Recognition
department (cz) RO
department RO
institution UTIA-B
full_dept Department of Pattern Recognition
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source
url http://library.utia.cas.cz/separaty/2013/RO/haindl-unsupervised dynamic textures segmentation.pdf
cas_special
abstract (eng) This paper presents an unsupervised dynamic colour texture segmentation method with unknown and variable number of texture classes. Single regions with dynamic textures can furthermore dynamically change their location as well as their shape. Individual dynamic multispectral texture mosaic frames are locally represented by Markovian features derived from four directional multispectral Markovian models recursively evaluated for each pixel site. Estimated frame-based Markovian parametric spaces are segmented using an unsupervised segmenter derived from the Gaussian mixture model data representation which exploits contextual information from previous video frames segmentation history. The segmentation algorithm for every frame starts with an over segmented initial estimation which is adaptively modified until the optimal number of homogeneous texture segments is reached. The presented method is objectively numerically evaluated on the dynamic textural test set from the Prague Segmentation Benchmark.
action
ARLID cav_un_auth*0293319
name International Conference on Computer Analysis of Images and Patterns (CAIP 2013) /15./
place York
dates 27.08.2013-29.08.2013
country GB
reportyear 2014
RIV BD
num_of_auth 2
presentation_type PR
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0223840
mrcbT16-q 100
mrcbT16-s 0.325
mrcbT16-y 16.75
mrcbT16-x 0.51
mrcbT16-4 Q2
mrcbT16-E Q3
arlyear 2013
mrcbU34 000345516500052 WOS
mrcbU63 cav_un_epca*0395210 Computer Analysis of Images and Patterns Part I I 978-3-642-40260-9 0302-9743 433 440 Computer Analysis of Images and Patterns Heidelberg Springer 2013 Lecture Notes in Computer Science 8047
mrcbU67 Wilson Richard 340
mrcbU67 Bors Adrian 340
mrcbU67 Hancock Edwin 340
mrcbU67 Smith William 340