Computer Vision — ECCV 2002

We describe an automatic method for building optimal 3D statistical shape models from sets of training shapes. Although shape models show considerable promise as a basis for segmenting and interpreting images, a major drawback of the approach is the need to establish a dense correspondence across a training set of example shapes. It is important to establish the correct correspondence, otherwise poor models can result. In 2D, this can be achieved using manual ‘landmarks’, but in 3D this becomes impractical. We show it is possible to establish correspondences automatically, by casting the correspondence problem as one of finding the ‘optimal’ parameterisation of each shape in the training set. We describe an explicit representation of surface parameterisation, that ensures the resulting correspondences are legal, and show how this representation can be manipulated to minimise the description length of the training set using the model. This results in compact models with good generalisation properties. Results are reported for two sets of biomedical shapes, showing significant improvement in model properties compared to those obtained using a uniform surface parameterisation.

[1]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[2]  Johan Montagnat,et al.  A review of deformable surfaces: topology, geometry and deformation , 2001, Image Vis. Comput..

[3]  Robert M. Gray,et al.  Minimum discrimination information clustering: modeling and quantization with Gauss mixtures , 2001, Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205).

[4]  Dimitris N. Metaxas,et al.  Parallel hidden Markov models for American sign language recognition , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[5]  Zhuowen Tu,et al.  Image Segmentation by Data-Driven Markov Chain Monte Carlo , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Stéphane Pateux Spatial segmentation of color images according to the MDL formalism , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[7]  Josef Kittler,et al.  Region growing: a new approach , 1998, IEEE Trans. Image Process..

[8]  Brendan J. Frey,et al.  Transformed hidden Markov models: estimating mixture models of images and inferring spatial transformations in video sequences , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[9]  Yu Jin Zhang,et al.  Evaluation and comparison of different segmentation algorithms , 1997, Pattern Recognit. Lett..

[10]  Richard Szeliski,et al.  An integrated Bayesian approach to layer extraction from image sequences , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[11]  Ron Kimmel,et al.  Images as Embedded Maps and Minimal Surfaces: Movies, Color, Texture, and Volumetric Medical Images , 2000, International Journal of Computer Vision.

[12]  Harpreet S. Sawhney,et al.  Layered representation of motion video using robust maximum-likelihood estimation of mixture models and MDL encoding , 1995, Proceedings of IEEE International Conference on Computer Vision.

[13]  Brendan J. Frey Filling in scenes by propagating probabilities through layers and into appearance models , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[14]  Ron Kimmel,et al.  Geometric-Variational Approach for Color Image Enhancement and Segmentation , 1999, Scale-Space.

[15]  Michel Barlaud,et al.  DREAM2S: Deformable Regions Driven by an Eulerian Accurate Minimization Method for Image and Video Segmentation , 2002, ECCV.

[16]  J. Sethian,et al.  Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations , 1988 .

[17]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[18]  Michael I. Jordan,et al.  An Introduction to Variational Methods for Graphical Models , 1999, Machine-mediated learning.

[19]  Michael I. Jordan,et al.  MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY and CENTER FOR BIOLOGICAL AND COMPUTATIONAL LEARNING DEPARTMENT OF BRAIN AND COGNITIVE SCIENCES , 2001 .

[20]  Pascal Fua,et al.  Using Generic Geometric Models for Intelligent Shape Extraction , 1987, AAAI.

[21]  V. Caselles,et al.  A geometric model for active contours in image processing , 1993 .

[22]  Max A. Viergever,et al.  Probabilistic Multiscale Image Segmentation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[23]  P.K Sahoo,et al.  A survey of thresholding techniques , 1988, Comput. Vis. Graph. Image Process..

[24]  Stan Z. Li,et al.  Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.

[25]  Vladimir Kolmogorov,et al.  An experimental comparison of min-cut/max- flow algorithms for energy minimization in vision , 2001, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  S. Sangwine,et al.  The Colour Image Processing Handbook , 1998, Springer US.

[27]  J. Le Moigne Refining Image Segmentation by Integration of Edge and Region Data , 1992, [Proceedings] IGARSS '92 International Geoscience and Remote Sensing Symposium.

[28]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[29]  Edward H. Adelson,et al.  Representing moving images with layers , 1994, IEEE Trans. Image Process..

[30]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[31]  Alex Pentland,et al.  Coupled hidden Markov models for complex action recognition , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.