We design a probabilistic trajectory synthesis algorithm for generating time-varying sequences of geometric configuration data. The algorithm takes a set of observed samples (each may come from a different trajectory) and simulates the dynamic evolution of the patterns in O(n 2 logn) time. To synthesize geometric configurations with indistinct identities, we use the pair correlation function to summarize point distribution, and α-shapes to maintain topological shape features based on a fast persistence matching approach. We apply our method to build a computational model for the geometric transformation of the cone mosaic in retinitis pigmentosa - an inherited and currently untreatable retinal degeneration. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Gu, C., Guibas, L., & Kerber, M. (2014). Topology-driven trajectory synthesis with an example on retinal cell motions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8701 LNBI, pp. 326–339). Springer Verlag. https://doi.org/10.1007/978-3-662-44753-6_24
Mendeley helps you to discover research relevant for your work.