Skip to main navigation Skip to search Skip to main content

Clustering dynamic textures with the hierarchical EM algorithm

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

The dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model has been applied to a wide variety of computer vision problems, such as motion segmentation, motion classification, and video registration. In this paper, we derive a new algorithm for clustering DT models that is based on the hierarchical EM algorithm. The proposed clustering algorithm is capable of both clustering DTs and learning novel DT cluster centers that are representative of the cluster members, in a manner that is consistent with the underlying generative probabilistic model of the DT. We then demonstrate the efficacy of the clustering algorithm on several applications in motion analysis, including hierarchical motion clustering, semantic motion annotation, and bag-of-systems codebook generation. ©2010 IEEE.
Original languageEnglish
Title of host publicationProceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
PublisherIEEE
Pages2022-2029
ISBN (Electronic)978-1-4244-6985-7, 978-1-4244-6983-3
ISBN (Print)9781424469840
DOIs
Publication statusPublished - 2010
Event2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2010) - San Francisco, CA, United States
Duration: 13 Jun 201018 Jun 2010

Publication series

Name
ISSN (Print)1063-6919
ISSN (Electronic)1063-6919

Conference

Conference2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2010)
PlaceUnited States
CitySan Francisco, CA
Period13/06/1018/06/10

Fingerprint

Dive into the research topics of 'Clustering dynamic textures with the hierarchical EM algorithm'. Together they form a unique fingerprint.

Cite this