Title: Visibility Complexity of Animation in Flatland
Authors: Rigau, Jaume
Feixas, Miquel
Sbert, Mateu
Citation: WSCG '2001: Conference proceedings: The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001: University of West Bohemia, Plzen, Czech Republic, February 5.-9., 2001, p. 352-359.
Issue Date: 2001
Publisher: University of West Bohemia
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2001/Papers_2001/R282.ps.gz
ISBN: 80-7082-713-0
ISSN: 1213-6972
Keywords: viditelnost;animace;Flatland;euklidovská vzdálenost;teorie informace
Keywords in different language: visibility;animation;Flatland;euclidean distance;information theory
Abstract: In this paper we address the problem of measuring the visibility complexity of scene animation in flatland. In our previous work we proposed a complexity mea-sure which quantifies the information transfer in a static scene. Here we introduce two measures to capture the complexity of movement. The first approach measures the dissimilarity between successive frames of an animation using the variation of information exchange between each pair of patches. The second one is the eu-clidean distance between form factor distributions. We present preliminary results which show that both approaches attain a satisfactory and very similar animation classification.
Rights: © University of West Bohemia
Appears in Collections:WSCG '2001: Conference proceedings

Files in This Item:
File Description SizeFormat 
Rigau.pdfPlný text1,2 MBAdobe PDFView/Open
Rigau.psPlný text653 kBPostscriptView/Open
Rigau_obr.psObrázová příloha238,46 kBPostscriptView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11289

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.