Abstract
In this paper we present a new method for aligning point distribution models to noisy and unlabelled image data. The aim is to construct an enhanced version of the point distribution model of Cootes and Taylor in which the point-position information is augmented with a neighbourhood graph which represents the relational arrangement of the landmark points. We show how this augmented point distribution model can be matched to unlabelled point-sets which are subject to both additional clutter and point drop-out. The statistical framework adopted for this study interleaves the processes of finding point correspondences and estimating the alignment parameters of the point distribution model. The utility measure underpinning the work is the cross entropy between two probability distributions which respectively model alignment errors and correspondence errors. In the case of the point alignment process, we assume that the registration errors follow a Gaussian distribution. The correspondence errors are modelled using probability distribution which has been used for symbolic graph-matching. Experimental results are presented using medical image sequences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Amit, Y., Kong, A.: Graphical Templates for Model Registration. IEEE PAMI18 (1996) 225–236
Cootes, T.F., Taylor, C.J., Cooper, D.H., Graham, J.: Active Shape Models-Their Training and Application. CVIU 61 (1995) 38–59
Cross, A.D.J., Hancock, E.R.: Graph Matching with a Dual-Step EM Algorithm. IEEE PAMI 20(11) (1998) 1236–1253
Gold, S., Rangarajan, S.: A graduated assignment algorithm for graph matching. IEEE PAMI 18(4) (1996) 377–388
Chui, H., Rangarajan, A.: A new algorithm for non-rigid point matching. Proceedings of IEEE Conference, CVPR 2000, vol. 2 (2000) 44–51
Kendall, D.G.: Shape Manifolds: Procrustean metrics and complex projective spaces. Bulletin of the London Mathematical Society 16 (1984) 81–121
Lades, M., Vorbruggen, J.C., Buhmann, J., Lange, J., von der Maalsburg, Wurtz, R.P., Konen, W.: Distortion-invariant object-recognition in a dynamic link architecture. Transactions on Computers 42 (1993) 300–311
Sclaroff, S., Pentland, A.P.: Modal Matching for Correspondence and Recognition. PAMI17 (1995) 545–661
Scott, G.L., Longuet-Higgins, H.C.: An Algorithm for Associating the Features of 2 Images. Proceedings of the Royal Society of London Series-Biological 244(1309) (1991) 21–26
Shapiro, L.S., Brady, J.M.: Feature-based Correspondence-An Eigenvector Approach. Image and Vision Computing 10 (1992) 283–288
Ullman, S.: The Interpretation of Visual Motion. MIT Press (1979)
Umeyama, S.: An Eigen Decomposition Approach to Weighted Graph Matching Problems. IEEE PAMI10 (1988) 695–703
Umeyama, S.: Least Squares Estimation of Transformation Parameters between Two Point sets. IEEE PAMI 13(4) (1991) 376–380
Umeyama, S.: Parameterised Point Pattern Matching and its Application to Recognition of Object Families. IEEE PAMI 15 (1993) 136–144
Werman, M., Weinshall, D.: Similarity and Affine Invariant Distances between 2D Point Sets. IEEE Trans, on PAMI, 17(8) (1995) 810–814
Wilson, R.C., Hancock, E.R.: Structural matching by discrete relaxation. IEEE T-PAMI 19(6) (June 1997) 634–648
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, B., Hancock, E.R. (2001). Relational Constraints for Point Distribution Models. In: Skarbek, W. (eds) Computer Analysis of Images and Patterns. CAIP 2001. Lecture Notes in Computer Science, vol 2124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44692-3_78
Download citation
DOI: https://doi.org/10.1007/3-540-44692-3_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42513-7
Online ISBN: 978-3-540-44692-7
eBook Packages: Springer Book Archive