Means in spaces of tree-like shapes

The mean is often the most important statistic of a dataset as it provides a single point that summarizes the entire set. While the mean is readily defined and computed in Euclidean spaces, no commonly accepted solutions are currently available in more complicated spaces, such as spaces of tree-structured data. In this paper we study the notion of means, both generally in Gromov’s CAT(0)-spaces (metric spaces of non-positive curvature), but also specifically in the space of tree-like shapes. We prove local existence and uniqueness of means in such spaces and discuss three different algorithms for computing means. We make an experimental evaluation of the three algorithms through experiments on three different sets of data with tree-like structure: a synthetic dataset, a leaf morphology dataset from images, and a set of human airway subtrees from medical CT scans. This experimental study provides great insight into the behavior of the different methods and how they relate to each o...

• Type: Journal
• Year: 2011
• Where: ICCV
• Authors: Aasa Feragen, Søren Hauberg, Mads Nielsen, François Lauze
• Keywords: Computer Vision, ICCV 2011, Leaf Morphology, Medical Ct, Synthetic Dataset