Visibility complexity of animation in flatland

Abstract

In this paper we address the problem of measuring the visibilitycomplexity of scene animation in flatland. In our previous work weproposed a complexity measure which quantifies the information transferin a static scene. Here we introduce two measures to capture thecomplexity of movement. The first approach measures the dissimilaritybetween successive frames of an animation using the variation ofinformation exchange between each pair of patches. The second one is theeuclidean distance between form factor distributions. We presentpreliminary results which show that both approaches attain asatisfactory and very similar animation classification.