Generation of a statistical shape model with probabilistic point correspondences and the expectation maximization- iterative closest point algorithm
- 226 Downloads
Identification of point correspondences between shapes is required for statistical analysis of organ shapes differences. Since manual identification of landmarks is not a feasible option in 3D, several methods were developed to automatically find one-to-one correspondences on shape surfaces. For unstructured point sets, however, one-to-one correspondences do not exist but correspondence probabilities can be determined.
Materials and methods:
A method was developed to compute a statistical shape model based on shapes which are represented by unstructured point sets with arbitrary point numbers. A fundamental problem when computing statistical shape models is the determination of correspondences between the points of the shape observations of the training data set. In the absence of landmarks, exact correspondences can only be determined between continuous surfaces, not between unstructured point sets. To overcome this problem, we introduce correspondence probabilities instead of exact correspondences. The correspondence probabilities are found by aligning the observation shapes with the affine expectation maximization-iterative closest points (EM-ICP) registration algorithm. In a second step, the correspondence probabilities are used as input to compute a mean shape (represented once again by an unstructured point set). Both steps are unified in a single optimization criterion which depe nds on the two parameters ‘registration transformation’ and ‘mean shape’. In a last step, a variability model which best represents the variability in the training data set is computed. Experiments on synthetic data sets and in vivo brain structure data sets (MRI) are then designed to evaluate the performance of our algorithm.
The new method was applied to brain MRI data sets, and the estimated point correspondences were compared to a statistical shape model built on exact correspondences. Based on established measures of “generalization ability” and “specificity”, the estimates were very satisfactory.
The novel algorithm for building a generative statistical shape model (gSSM) does not need one-to-one point correspondences but relies solely on point correspondence probabilities for the computation of mean shape and eigenmodes. It is well-suited for shape analysis on unstructured point sets.
KeywordsIterative Close Point Minimum Description Length Point Correspondence Variability Model Iterative Close Point
Unable to display preview. Download preview PDF.
- Vos F, de Bruin P, Streeksa G, Maas M, van Vliet L, Vossepoel A (2004) A statistical shape model without using landmarks. In: Proceedings of the ICPR’04, vol 3, pp 714–717Google Scholar
- Besl PJ and McKay ND (1992). A method for registration of 3D shapes. IEEE Trans PAMI 14: 239–256 Google Scholar
- Zhao Z, Theo EK (2005) A novel framework for automated 3D PDM construction using deformable models. In: Medical imaging 2005, SPIE proc, vol 5747, pp 303–314Google Scholar
- Heimann T, Wolf I, Williams T, Meinzer H (2005) 3D active shape models using gradient descent optimization of description length. In: Proceedings of the IPMI’05, vol 3565, pp 566–577Google Scholar
- Cates J, Meyer M, Fletcher P, Whitaker R (2006) Entropy-based particle systems for shape correspondences. In: Proceedings of the MICCAI’06, vol 1, pp 90–99Google Scholar
- Peter A, Rangarajan A (2006) Shape analysis using the Fisher-Rao Riemannian metric: unifying shape representation and deformation. In: IEEE transactions ISBI’06, pp 1164–1167Google Scholar
- Chui H, Rangarajan A, Zhang J and Leonard C (2004). Unsupervised learning of an atlas from unlabeled point-sets. IEEE Trans PAMI’ 04(26): 160–172 Google Scholar
- Granger S, Pennec X (2002) Multi-scale EM-ICP: a fast and robust approach for surface registration. In: Proceedings of the ECCV’02, LNCS, vol 2525, pp 418–432Google Scholar
- Rangarajan A, Chui H, Bookstein FL (1997) The softassign procrustes matching algorithm. In: Proceedings of the IPMI’97, vol 1230, pp 29–42Google Scholar
- Dempster A, Laird N and Rubin D (1977). Maximum likelihood from incomplete data via the EM algorithm. Royal Stat B 39: 1–38 Google Scholar
- Granger S (2003) Une approche statistique multi-échelle au recalage rigide de surfaces: application à l’implantologie dentaire. PhD thesis, Ecole des Mines de ParisGoogle Scholar
- Styner M, Rajamani K, Nolte L, Zsemlye G, Székely G, Taylor C, Davies R (2003) Evaluation of 3D correspondence methods for model building. In: Proceedings for the IPMI’03, vol 2732, pp 63–75Google Scholar