Subscribe
Issue No.11 - November (2008 vol.30)
pp: 2023-2039
Brent C. Munsell , University of South Carolina, Columbia
Pahal Dalal , University of South Carolina, Columbia
Song Wang , University of South Carolina, Columbia
ABSTRACT
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-correspondence evaluation methods, the proposed benchmark first generates a large set of synthetic shape instances by randomly sampling a given statistical shape model that defines a ground-truth shape space. We then run a test shape-correspondence algorithm on these synthetic shape instances to identify a set of corresponded landmarks. According to the identified corresponded landmarks, we construct a new statistical shape model, which defines a new shape space. We finally compare this new shape space against the ground-truth shape space to determine the performance of the test shape-correspondence algorithm. In this paper, we introduce three new performance measures that are landmark independent to quantify the difference between the ground-truth and the newly derived shape spaces. By introducing a ground-truth shape space that is defined by a statistical shape model and three new landmark-independent performance measures, we believe the proposed benchmark allows for a more objective evaluation of shape correspondence than previous methods. In this paper, we focus on developing the proposed benchmark for $2$D shape correspondence. However it can be easily extended to $3$D cases.
INDEX TERMS
Statistical shape analysis, shape correspondence, point distribution model, benchmark study
CITATION
Brent C. Munsell, Pahal Dalal, Song Wang, "Evaluating Shape Correspondence for Statistical Shape Analysis: A Benchmark Study", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.30, no. 11, pp. 2023-2039, November 2008, doi:10.1109/TPAMI.2007.70841
REFERENCES
 [1] S. Belongie, J. Malik, and J. Puzicha, “Shape Matching and Object Recognition Using Shape Contexts,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, Apr. 2002. [2] F. Bookstein, “Principal Warps: Thin-Plate Splines and the Decomposition of Deformations,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 6, pp. 567-585, June 1989. [3] F. Bookstein, “Landmark Methods for Forms without Landmarks: Morphometrics of Group Differences in Outline Shape,” Medical Image Analysis, vol. 1, no. 3, pp. 225-243, 1997. [4] E. Catmull and R. Rom, “A Class of Local Interpolating Splines,” Computer Aided Geometric Design, pp. 317-326, 1974. [5] H. Chui and A. Rangarajan, “A New Point Matching Algorithm for Non-Rigid Registration,” Computer Vision and Image Understanding, vol. 89, pp. 114-141, 2003. [6] T. Cootes, C. Taylor, D. Cooper, and J. Graham, “Active Shape Models—Their Training and Application,” Computer Vision and Image Understanding, vol. 61, no. 1, pp. 38-59, Jan. 1995. [7] T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. MIT Press, 1990. [8] R. Davies, “Learning Shape: Optimal Models for Analysing Natural Variablility,” PhD dissertation, Univ. of Manchester, 2002. [9] R. Davies, C. Twining, T. Cootes, J. Waterton, and C. Taylor, “A Minimum Description Length Approach to Statistical Shape Modeling,” IEEE Trans. Medical Imaging, vol. 21, no. 5, pp. 525-537, May 2002. [10] A. Ericsson, “Automatic Shape Modelling with Applications in Medical Imaging,” PhD dissertation, Centre for Math. Sciences, Lund Univ., 2006. [11] J. Friedman and L. Rafsky, “Multivariate Generalization of the Wald-Wolfowitz and Smirnov Two-Sample Tests,” Annals of Statistics, vol. 7, pp. 697-717, 1979. [12] A. Goldberg and R. Kennedy, “An Efficient Cost Scaling Algorithm for the Assignment Problem,” Math. Programming, vol. 71, pp. 153-178, 1995. [13] J. Gower and G. Dijksterhuis, Procrustes Problems. Oxford Univ. Press, 2004. [14] J. Karlsson and A. Ericsson, “A Ground Truth Correspondence Measure for Benchmarking,” Proc. Int'l Conf. Pattern Recognition, vol. 3, pp. 568-573, 2006. [15] A. Kotcheff and C.J. Taylor, “Automatic Construction of Eigen-Shape Models by Genetic Algorithm,” Proc. Information Processing in Medical Imaging Conf., pp. 1-14, 1997. [16] M. Leventon, E. Grimson, and O. Faugeras, “Statistical Shape Influence in Geodesic Active Contours,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 316-323, 2000. [17] B. Munsell, P. Dalal, and S. Wang, “A New Benchmark for Shape Correspondence Evaluation,” Proc. Int'l Conf. Medical Image Computing and Computer Assisted Intervention, vol. 1, pp. 507-514, 2007. [18] M. Powell, “A Thin Plate Spline Method for Mapping Curves into Curves in Two Dimensions,” Proc. Computational Techniques and Applications, pp. 43-57, 1995. [19] T. Richardson and S. Wang, “Nonrigid Shape Correspondence Using Landmark Sliding, Insertion and Deletion,” Proc. Int'l Conf. Medical Image Computing and Computer Assisted Intervention, vol. 2, pp. 435-442, 2005. [20] M. Styner, K. Rajamani, L.-P. Nolte, G. Zsemlye, G. Szekely, C. Taylor, and R. Davies, “Evaluation of 3D Correspondence Methods for Model Building,” Proc. Information Processing in Medical Imaging Conf., pp. 63-75, 2003. [21] H. Thodberg, “Adding Curvature to Minimum Description Length Shape Models,” Proc. British Machine Vision Conf., vol. 2, pp. 251-260, 2003. [22] H. Thodberg, “Minimum Description Length Shape and Appearance Models,” Proc. Information Processing in Medical Imaging Conf., pp. 51-62, 2003. [23] S. Wang, T. Kubota, and T. Richardson, “Shape Correspondence through Landmark Sliding,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 143-150, 2004. [24] J. Xie and P. Heng, “Shape Modeling Using Automatic Landmarking,” Proc. Int'l Conf. Medical Image Computing and Computer Assisted Intervention, vol. 2, pp. 709-716, 2005.