Visibility Complexity of Animation in Flatland

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.