Automatic landmark identification using a new method of non-rigid correspondence

  • A. Hill
  • A. D. Brett
  • C. J. Taylor
Posters Registration/Maping/Tracking
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1230)


A method for corresponding the boundaries of two shapes is presented. The algorithm locates a matching pair of sparse polygonal approximations, one for each of a pair of boundaries, by minimising a cost function using a greedy algorithm. The cost function expresses the dissimilarity in both the shape and representation error (with respect to the defining boundary) of the sparse polygons. Results are presented for three classes of shape which exhibit various types of non-rigid deformation. The algorithm is also applied to an automatic landmark identification task for the construction of statistical shape models.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. J. Besl and N. D. McKay. A method for registration of 3d shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2):239–256, 1992.Google Scholar
  2. 2.
    I. Cohen, N. Ayache, and P. Sulger. Tracking points on deformable objects using curvature information. In G. Sandini, editor, 2nd European Conference on Computer Vision, Santa Margherita Ligure, Italy, pages 458–466. Springer-Verlag, May 1992.Google Scholar
  3. 3.
    T. F. Cootes, C. J. Taylor, D. H. Cooper, and J. Graham. Active shape models — their training and application. Computer Vision and Image Understanding, 61(1):38–59, Jan. 1995.Google Scholar
  4. 4.
    B. Geiger. Three-dimensional modeling of human organs and its application to diagnosis and surgical planning. Technical report no. 2105, Institut National de Recherche en Informatique et Automatique, Dec. 1993.Google Scholar
  5. 5.
    A. Hill and C. J. Taylor. Automatic landmark generation for point distribution models. In E. Hancock, editor, 5th British Machine Vison Conference, York, England, pages 429–438. BMVA Press, Sept. 1994.Google Scholar
  6. 6.
    C. Kambhamettu and D. B. Goldgof. Point correspondence recovery in non-rigid motion. In IEEE Conference on Computer Vision and Pattern Recognition, pages 222–227, 1992.Google Scholar
  7. 7.
    W. J. Schroeder, J. A. Zarge, and W. E. Lorensen. Decimation of triangle meshes. Computer Graphics, 26(2):65–70, 1992.Google Scholar
  8. 8.
    S. Sclaroff and A. P. Pentland. Modal matching for correspondence and recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(6):545–561, 1995.Google Scholar
  9. 9.
    L. S. Shapiro and J. M. Brady. A modal approach to feature-based correspondence. In P. Mowforth, editor, 2nd British Machine Vison Conference, Glasgow, Scotland, pages 78–85. Springer-Verlag, Sept. 1991.Google Scholar
  10. 10.
    H. D. Tagare, D. O'Shea, and A. Rangarajan. A geometric criterion for shape-based non-rigid correspondence. In 5th International Conference on Computer Vision, MIT, Cambridge, Massachusetts, pages 434–439, June 1995.Google Scholar
  11. 11.
    P. Zhu and P. M. Chirlian. On critical point detection of digital shapes. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8):737–748, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • A. Hill
    • 1
  • A. D. Brett
    • 1
  • C. J. Taylor
    • 1
  1. 1.Department of Medical BiophysicsUniversity of ManchesterManchesterUK

Personalised recommendations