Image registration is a core task in computational anatomy that establishes correspondences between images. Invertible deformable registration, which computes a deformation field and handles complex, non-linear transformation, is essential for tracking anatomical variations, especially in neuroimaging applications where inter-subject differences and longitudinal changes are key. Analyzing the deformation fields is challenging due to their non-linearity, limiting statistical analysis. However, traditional approaches for analyzing deformation fields are computationally expensive, sensitive to initialization, and prone to numerical errors, especially when the deformation is far from the identity. To address these limitations, we propose the Log-Euclidean Diffeomorphic Autoencoder (LEDA), an innovative framework designed to compute the principal logarithm of deformation fields by efficiently predicting consecutive square roots. LEDA operates within a linearized latent space that adheres to the diffeomorphisms group action laws, enhancing our model's robustness and applicability. We also introduce a loss function to enforce inverse consistency, ensuring accurate latent representations of deformation fields. Extensive experiments with the OASIS-1 dataset demonstrate the effectiveness of LEDA in accurately modeling and analyzing complex non-linear deformations while maintaining inverse consistency. Additionally, we evaluate its ability to capture and incorporate clinical variables, enhancing its relevance for clinical applications.

Game generation and analysis has commonly relied on hand authored rules and heuristics. This authoring task comes with a high authorial burden, both in the amount of rules and heuristics that need to be authored for decent coverage and in the complexity of authoring these rules. In this paper I present early work on \textit{Leda} and inductive logic programming system designed to learn these rules, so as to support further generation and analysis. I present Leda, describe its process, and finally show a sample set of the rules that it learns.

Game generation and analysis has commonly relied on hand authored rules and heuristics.  This authoring task comes with a high authorial burden, both in the amount of rules and heuristics that need to be authored for decent coverage and in the complexity of authoring these rules.  In this paper I present early work on \textit{Leda} and inductive logic programming system designed to learn these rules, so as to support further generation and analysis.  I present Leda, describe its process, and finally show a sample set of the rules that it learns.