Skip to main content
Book cover

Biennial International Conference on Information Processing in Medical Imaging

IPMI 1997: Information Processing in Medical Imaging pp 29–42Cite as

The softassign Procrustes matching algorithm

Part of the Lecture Notes in Computer Science book series (LNCS,volume 1230)

Abstract

The problem of matching shapes parameterized as a set of points is frequently encountered in medical imaging tasks. When the point-sets are derived from landmarks, there is usually no problem of determining the correspondences or homologies between the two sets of landmarks. However, when the point sets are automatically derived from images, the difficult problem of establishing correspondence and rejecting non-homologies as outliers remains. The Procrustes method is a well-known method of shape comparison and can always be pressed into service when homologies between point-sets are known in advance. This paper presents a powerful extension of the Procrustes method to pointsets of differing point counts with correspondences unknown. The result is the softassign Procrustes matching algorithm which iteratively establishes correspondence, rejects non-homologies as outliers, determines the Procrustes rescaling and the spatial mapping between the point-sets.

Keywords

  • Point Count
  • Spatial Mapping
  • Permutation Matrix
  • Lagrange Parameter
  • Procrustes Distance

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.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-63046-5_3
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   109.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-69070-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   139.00
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ, 1989.

    Google Scholar 

  2. P. J. Besl and N. D. McKay. A method for registration of 3-d shapes. IEEE Trans. Patt. Anal. Mach. Intell., 14(2):239–256, Feb. 1992.

    Google Scholar 

  3. M. Black and A. Rangarajan. On the Unification of Line Processes, Outlier Detection and Robust Statistics with Applications in Early Vision. Intl. J. Computer Vision, 19(1):57–91, 1996.

    Google Scholar 

  4. F. L. Bookstein. Morphometric tools for landmark data: Geometry and biology. Cambridge University Press, 1991.

    Google Scholar 

  5. F. L. Bookstein. Landmark methods for forms without landmarks: Localizing group differences in outline shape. In A. Amini, F. L. Bookstein, and D. Wilson, editors, Proc. of the Workshop on Mathematical Methods in Biomedical Image Analysis, pages 279–289. IEEE Computer Society Press, 1996.

    Google Scholar 

  6. J. Canny. A Computational Approach to Edge Detection. IEEE Trans. on Pattern Analysis and Machine Intelligence, 8(6):679–698, Nov. 1986.

    Google Scholar 

  7. S. Gold, A. Rangarajan, and E. Mjolsness. Learning with preknowledge: clustering with point and graph matching distance measures. Neural Computation, 8(4):787–804, 1996.

    Google Scholar 

  8. C. Goodall. Procrustes methods in the statistical analysis of shape. J. R. Statist. Soc. B, 53(2):285–339, 1991.

    Google Scholar 

  9. W. D. K. Green. The thin-plate spline and images with curving features. In K. V. Mardia, C. A. Gill, and I. L. Dryden, editors, Proceedings in image fusion and shape variability techniques, pages 79–97. Leeds University Press, 1996.

    Google Scholar 

  10. J. Hertz, A. Krogh, and R. G. Palmer. Introduction to the Theory of Neural Computation, volume 1 of A Lecture Notes volume in the Santa Fe Institute Studies in the Sciences of Complexity. Addison-Wesley, New York, 1991.

    Google Scholar 

  11. D. G. Kendall. Shape-manifolds, Procrustean metrics and complex projective spaces. Bulletin of the London Mathematical Society, 16:81–121, 1984.

    Google Scholar 

  12. J. J. Kosowsky and A. L. Yuille. The invisible hand algorithm: Solving the assignment problem with statistical physics. Neural Networks, 7(3):477–490, 1994.

    CrossRef  Google Scholar 

  13. D. Luenberger. Linear and Nonlinear Programming. Addison-Wesley, Reading, MA, 1984.

    Google Scholar 

  14. A. Rangarajan, S. Gold, and E. Mjolsness. A novel optimizing network architecture with applications. Neural Computation, 8(5):1041–1060, 1996.

    Google Scholar 

  15. A. Rangarajan, E. Mjolsness, S. Pappu, L. Davachi, P. Goldman-Rakic, and J. Duncan. A Robust Point Matching Algorithm for Autoradiograph Alignment. In K. H. Hohne and R. Kikinis, editors, Fourth International Conference on Visualization in Biomedical Computing, Lecture Notes in Computer Science, LNCS 1131, pages 277–286. Springer, New York, NY, 1996.

    Google Scholar 

  16. R. Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist., 35:876–879, 1964.

    Google Scholar 

  17. C. Small. The Statistical theory of shape. Springer-Verlag, 1996.

    Google Scholar 

  18. L. Sokoloff, M. Revich, C. Kennedy, M. H. DesRosiers, C. S. Patlak, K. D. Pettigrew, O. Sakurada, and M. Shinohara. The C14-deoxyglucose method for the measurement of local cerebral glucose utilization: theory, procedure, and normal values in the conscious and anesthetized albino rat. J. Neurochem., 28:897–916, 1977.

    PubMed  Google Scholar 

  19. P. Van den Elsen. Multimodality matching of brain images. PhD thesis, Utrecht University, Utrecht, Netherlands, 1993.

    Google Scholar 

  20. A. L. Yuille and J. J. Kosowsky. Statistical physics algorithms that converge. Neural Computation, 6(3):341–356, May 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departments of Diagnostic Radiology and Electrical Engineering, Yale University, USA

    Anand Rangarajan & Haili Chui

  2. Institute of Gerontology, University of Michigan, Ann Arbor

    Fred L. Bookstein

Authors
  1. Anand Rangarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haili Chui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fred L. Bookstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

    Rights and permissions

    Reprints and Permissions

    Copyright information

    © 1997 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Rangarajan, A., Chui, H., Bookstein, F.L. (1997). The softassign Procrustes matching algorithm. In: Duncan, J., Gindi, G. (eds) Information Processing in Medical Imaging. IPMI 1997. Lecture Notes in Computer Science, vol 1230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63046-5_3

    Download citation

    • DOI: https://doi.org/10.1007/3-540-63046-5_3

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-63046-3

    • Online ISBN: 978-3-540-69070-2

    • eBook Packages: Springer Book Archive