Analyzing movement trajectories using a Markov bi-clustering method.
In this study we treat scribbling motion as a compositional system in which a limited set of elementary strokes are capable of concatenating amongst themselves in an endless number of combinations, thus producing an unlimited repertoire of complex constructs. We broke the continuous scribblings into small units and then calculated the Markovian transition matrix between the trajectory clusters. The Markov states are grouped in a way that minimizes the loss of mutual information between adjacent strokes. The grouping algorithm is based on a novel markov-state bi-clustering algorithm derived from the Information-Bottleneck principle. This approach hierarchically decomposes scribblings into increasingly finer elements. We illustrate the usefulness of this approach by applying it to human scribbling.
Erez
Keren
K
The Gonda Brain Research Center, Bar-Ilan University, Ramat-Gan, Israel.
Goldberger
Jacob
J
Sosnik
Ronen
R
Shemesh
Moshe
M
Rothstein
Susan
S
Abeles
Moshe
M
D000465:Algorithms; D016000:Cluster Analysis; D006801:Humans; D008390:Markov Chains; D008954:Models, Biological; D009068:Movement / Q000502:physiology*; D020521:Stroke / Q000503:physiopathology