Determining groupwise correspondence across a set of unlabeled examples of either shapes or images, by the use of an optimisation procedure, is a well-established technique that has been shown to produce quantitatively better models than other approaches. However, the computational cost of the optimisation is high, leading to long convergence times. In this paper, we show how topologically non-trivial shapes can be mapped to regular grids (called shape images). This leads to an initial reduction in computational complexity. By also considering the question of régularisation, we show that a non-parametric fluid regulariser can be applied in a principled manner, the fluid flowing on the shape surface itself, whilst not loosing the computational gain made by the use of shape images. We show that this non-parametric regularisation leads to a further considerable gain, when compared to previous parametric regularisation methods. Quantitative evaluation is performed on biological datasets, and shown to yield a substantial decrease in convergence time, with no loss of model quality. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Twining, C., Davies, R., & Taylor, C. (2007). Non-parametric surface-based regularisation for building statistical shape models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4584 LNCS, pp. 738–750). Springer Verlag. https://doi.org/10.1007/978-3-540-73273-0_61
Mendeley helps you to discover research relevant for your work.