Simultaneous Nonrigid Registration of Multiple Point Sets and Atlas Construction

  • Fei Wang
  • Baba C. Vemuri
  • Anand Rangarajan
  • Ilona M. Schmalfuss
  • Stephan J. Eisenschenk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3953)


Estimating a meaningful average or mean shape from a set of shapes represented by unlabeled point-sets is a challenging problem since, usually this involves solving for point correspondence under a non-rigid motion setting. In this paper, we propose a novel and robust algorithm that is capable of simultaneously computing the mean shape from multiple unlabeled point-sets (represented by finite mixtures) and registering them nonrigidly to this emerging mean shape. This algorithm avoids the correspondence problem by minimizing the Jensen-Shannon (JS) divergence between the point sets represented as finite mixtures. We derive the analytic gradient of the cost function namely, the JS-divergence, in order to efficiently achieve the optimal solution. The cost function is fully symmetric with no bias toward any of the given shapes to be registered and whose mean is being sought. Our algorithm can be especially useful for creating atlases of various shapes present in images as well as for simultaneously (rigidly or non-rigidly) registering 3D range data sets without having to establish any correspondence. We present experimental results on non-rigidly registering 2D as well as 3D real data (point sets).


Fetal Alcohol Syndrome Nonrigid Registration Active Shape Model Correspondence Problem Deformable Shape 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Small, C.: The Statistical theory of shape. Springer, New York (1996)zbMATHGoogle Scholar
  2. 2.
    Lin, J.: Divergence measures based on the shannon entropy. IEEE Trans. Infor. Theory 37, 145–151 (1991)zbMATHCrossRefGoogle Scholar
  3. 3.
    Hero, A., Ma, B., Michel, O., Gorman, J.: of entropic spanning graphs. IEEE Trans. Signal Processing 19, 85–95 (2002)Google Scholar
  4. 4.
    He, Y., Ben-Hamza, A., Krim, H.: A generalized divergence measure for robust image registration. IEEE Trans. Signal Processing 51, 1211–1220 (2003)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Klassen, E., Srivastava, A., Mio, W., Joshi, S.H.: Analysis of planar shapes using geodesic paths on shape spaces. IEEE Trans. Pattern Anal. Mach. Intell. 26, 372–383 (2003)CrossRefGoogle Scholar
  6. 6.
    Tagare, H.: Shape-based nonrigid correspondence with application to heart motion analysis. IEEE Trans. Med. Imaging 18, 570–579 (1999)CrossRefGoogle Scholar
  7. 7.
    Bookstein, F.L.: Principal warps: Thin-plate splines and the decomposition of deformations. IEEE Trans. Pattern Anal. Mach. Intell. 11, 567–585 (1989)zbMATHCrossRefGoogle Scholar
  8. 8.
    Chui, H., Rangarajan, A., Zhang, J., Leonard, C.M.: Unsupervised learning of an atlas from unlabeled point-sets. IEEE Trans. Pattern Anal. Mach. Intell. 26, 160–172 (2004)CrossRefGoogle Scholar
  9. 9.
    Belongie, S., Malik, J., Puzicha, J.: Shape matching and object recognition using shape contexts. IEEE Trans. Pattern Anal. Mach. Intell. 24, 509–522 (2002)CrossRefGoogle Scholar
  10. 10.
    Cootes, T.F., Taylor, C.J., Cooper, D.H., Graham, J.: Active shape models: their training and application. Comput. Vis. Image Underst. 61, 38–59 (1995)CrossRefGoogle Scholar
  11. 11.
    Hill, A., Taylor, C.J., Brett, A.D.: A framework for automatic landmark identification using a new method of nonrigid correspondence. IEEE Trans. Pattern Anal. Mach. Intell. 22, 241–251 (2000)CrossRefGoogle Scholar
  12. 12.
    Tsin, Y., Kanade, T.: A correlation-based approach to robust point set registration. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3023, pp. 558–569. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  13. 13.
    Glaunes, J., Trouvé, A., Younes, L.: Diffeomorphic matching of distributions: A new approach for unlabelled point-sets and sub-manifolds matching. CVPR 2, 712–718 (2004)Google Scholar
  14. 14.
    McLachlan, G., Basford, K.: Mixture Model:Inference and Applications to Clustering. Marcel Dekker, New York (1988)zbMATHGoogle Scholar
  15. 15.
    Endres, D.M., Schindelin, J.E.: A new metric for probability distributions. IEEE Trans. Inf. Theory 49, 1858–1860 (2003)CrossRefMathSciNetGoogle Scholar
  16. 16.
    Chui, H., Rangarajan, A.: A new point matching algorithm for non-rigid registration. Computer Vision and Image Understanding (CVIU) 89, 114–141 (2003)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Fei Wang
    • 1
  • Baba C. Vemuri
    • 1
  • Anand Rangarajan
    • 1
  • Ilona M. Schmalfuss
    • 2
  • Stephan J. Eisenschenk
    • 3
  1. 1.Department of Computer & Information Sciences & Engr.University of FloridaGainesville
  2. 2.Departments of RadiologyUniversity of FloridaGainesville
  3. 3.Department of NeurologyUniversity of FloridaGainesville

Personalised recommendations