Repetitive Delone Sets and Quasicrystals

This paper considers the problem of characterizing the simplest discrete point sets that are aperiodic, using invariants based on topological dynamics. A Delone set whose patch-counting function N(T), for radius T, is finite for all T is called repetitive if there is a function M(T) such that every ball of radius M(T)+T contains a copy of each kind of patch of radius T that occurs in the set. This is equivalent to the minimality of an associated topological dynamical system with R^n-action. There is a lower bound for M(T) in terms of N(T), namely N(T) = O(M(T)^n), but no general upper bound. The complexity of a repetitive Delone set can be measured by the growth rate of its repetitivity function M(T). For example, M(T) is bounded if and only if the set is a crystal. A set is called is linearly repetitive if M(T) = O(T) and densely repetitive if M(T) = O(N(T))^{1/n}). We show that linearly repetitive sets and densely repetitive sets have strict uniform patch frequencies, i.e. the associated topological dynamical system is strictly ergodic. It follows that such sets are diffractive. In the reverse direction, we construct a repetitive Delone set in R^n which has M(T) = O(T(log T)^{2/n}(log log log T)^{4/n}), but does not have uniform patch frequencies. Aperiodic linearly repetitive sets have many claims to be the simplest class of aperiodic sets, and we propose considering them as a notion of "perfectly ordered quasicrystal".Comment: To appear in "Ergodic Theory and Dynamical Systems" vol.23 (2003). 37 pages. Uses packages latexsym, ifthen, cite and files amssym.def, amssym.te

Real-World Repetition Estimation by Div, Grad and Curl

We consider the problem of estimating repetition in video, such as performing push-ups, cutting a melon or playing violin. Existing work shows good results under the assumption of static and stationary periodicity. As realistic video is rarely perfectly static and stationary, the often preferred Fourier-based measurements is inapt. Instead, we adopt the wavelet transform to better handle non-static and non-stationary video dynamics. From the flow field and its differentials, we derive three fundamental motion types and three motion continuities of intrinsic periodicity in 3D. On top of this, the 2D perception of 3D periodicity considers two extreme viewpoints. What follows are 18 fundamental cases of recurrent perception in 2D. In practice, to deal with the variety of repetitive appearance, our theory implies measuring time-varying flow and its differentials (gradient, divergence and curl) over segmented foreground motion. For experiments, we introduce the new QUVA Repetition dataset, reflecting reality by including non-static and non-stationary videos. On the task of counting repetitions in video, we obtain favorable results compared to a deep learning alternative

Local Complexity of Delone Sets and Crystallinity

This paper characterizes when a Delone set X is an ideal crystal in terms of restrictions on the number of its local patches of a given size or on the hetereogeneity of their distribution. Let N(T) count the number of translation-inequivalent patches of radius T in X and let M(T) be the minimum radius such that every closed ball of radius M(T) contains the center of a patch of every one of these kinds. We show that for each of these functions there is a `gap in the spectrum' of possible growth rates between being bounded and having linear growth, and that having linear growth is equivalent to X being an ideal crystal. Explicitly, for N(T), if R is the covering radius of X then either N(T) is bounded or N(T) >= T/2R for all T>0. The constant 1/2R in this bound is best possible in all dimensions. For M(T), either M(T) is bounded or M(T) >= T/3 for all T>0. Examples show that the constant 1/3 in this bound cannot be replaced by any number exceeding 1/2. We also show that every aperiodic Delone set X has M(T) >= c(n)T for all T>0, for a certain constant c(n) which depends on the dimension n of X and is greater than 1/3 when n > 1.Comment: 26 pages. Uses latexsym and amsfonts package

Pure point diffraction implies zero entropy for Delone sets with uniform cluster frequencies

Delone sets of finite local complexity in Euclidean space are investigated. We show that such a set has patch counting and topological entropy 0 if it has uniform cluster frequencies and is pure point diffractive. We also note that the patch counting entropy is 0 whenever the repetitivity function satisfies a certain growth restriction.Comment: 16 pages; revised and slightly expanded versio

Key-Pose Prediction in Cyclic Human Motion

In this paper we study the problem of estimating innercyclic time intervals within repetitive motion sequences of top-class swimmers in a swimming channel. Interval limits are given by temporal occurrences of key-poses, i.e. distinctive postures of the body. A key-pose is defined by means of only one or two specific features of the complete posture. It is often difficult to detect such subtle features directly. We therefore propose the following method: Given that we observe the swimmer from the side, we build a pictorial structure of poselets to robustly identify random support poses within the regular motion of a swimmer. We formulate a maximum likelihood model which predicts a key-pose given the occurrences of multiple support poses within one stroke. The maximum likelihood can be extended with prior knowledge about the temporal location of a key-pose in order to improve the prediction recall. We experimentally show that our models reliably and robustly detect key-poses with a high precision and that their performance can be improved by extending the framework with additional camera views.Comment: Accepted at WACV 2015, 8 pages, 3 figure