Approximations of Shape Metrics and Application to Shape Warping and Empirical Shape Statistics

International audienceThis chapter proposes a framework for dealing with two problems related to the analysis of shapes: the definition of the relevant set of shapes and that of defining a metric on it. Following a recent research monograph by Delfour and Zolésio [8], we consider the characteristic functions of the subsets of ℝ2 and their distance functions. The L 2 norm of the difference of characteristic functions and the L∞ and the W 1,2 norms of the difference of distance functions define interesting topologies, in particular that induced by the well-known Hausdorff distance. Because of practical considerations arising from the fact that we deal with image shapes defined on finite grids of pixels, we restrict our attention to subsets of ℝ2 of positive reach in the sense of Federer [12], with smooth boundaries of bounded curvature. For this particular set of shapes we show that the three previous topologies are equivalent. The next problem we consider is that of warping a shape onto another by infinitesimal gradient descent, minimizing the corresponding distance. Because the distance function involves an inf, it is not differentiable with respect to the shape. We propose a family of smooth approximations of the distance function which are continuous with respect to the Hausdorff topology, and hence with respect to the other two topologies. We compute the corresponding Gâteaux derivatives. They define deformation flows that can be used to warp a shape onto another by solving an initial value problem. We show several examples of this warping and prove properties of our approximations that relate to the existence of local minima. We then use this tool to produce computational de.nitions of the empirical mean and covariance of a set of shape examples. They yield an analog of the notion of principal modes of variation. We illustrate them on a variety of examples

Performance Evaluation of Geometric Active Contour (GAC) and Enhanced Geometric Active Contour Segmentation Model (ENGAC) for Medical Image Segmentation

Segmentation is an aspect of computer vision that deals with partitioning of an image into homogeneneous region. Medical image segmentation is an indispensable tool for medical image diagnoses. Geometric active contour (GAC) segmentation is one of the outstanding model used in machine learning community to solve the problem of medical image segmentation. However, It has problem of deviation from the true outline of the target feature and it generates spurious edge caused by noise that normally stop the evolution of the surface to be extracted. In this paper, enhanced Geometric active contour was formulated by using Kernel Principal Component Analysis(KPCA) with the existing Geometric active contour segmentation model and performance evaluation of the formulated model was carried out. Keyword: Geometric active contour, Segmentation, Medical image, Kernel Principal Component Analysis

Statistical M-Estimation and Consistency in Large Deformable Models for Image Warping

The problem of defining appropriate distances between shapes or images and modeling the variability of natural images by group transformations is at the heart of modern image analysis. A current trend is the study of probabilistic and statistical aspects of deformation models, and the development of consistent statistical procedure for the estimation of template images. In this paper, we consider a set of images randomly warped from a mean template which has to be recovered. For this, we define an appropriate statistical parametric model to generate random diffeomorphic deformations in two-dimensions. Then, we focus on the problem of estimating the mean pattern when the images are observed with noise. This problem is challenging both from a theoretical and a practical point of view. M-estimation theory enables us to build an estimator defined as a minimizer of a well-tailored empirical criterion. We prove the convergence of this estimator and propose a gradient descent algorithm to compute this M-estimator in practice. Simulations of template extraction and an application to image clustering and classification are also provided

Elastic Shape Models for Face Analysis Using Curvilinear Coordinates

International audienceThis paper studies the problem of analyzing variability in shapes of facial surfaces using a Rie- mannian framework, a fundamental approach that allows for joint matchings, comparisons, and deformations of faces under a chosen metric. The starting point is to impose a curvilinear coordinate system, named the Darcyan coordinate system, on facial surfaces; it is based on the level curves of the surface distance function measured from the tip of the nose. Each facial surface is now represented as an indexed collection of these level curves. The task of finding optimal deformations, or geodesic paths, between facial surfaces reduces to that of finding geodesics between level curves, which is accomplished using the theory of elastic shape analy- sis of 3D curves. Elastic framework allows for nonlinear matching between curves and between points across curves. The resulting geodesics provide optimal elastic deformations between faces and an elastic metric for comparing facial shapes. We demonstrate this idea using examples from FSU face databas

Approximations of shape metrics and application to shape warping and empirical shape statistics

This paper proposes a framework for dealing with several problems related to the analysis of shapes. Two related such problems are the definition of the relevant set of shapes and that of defining a metric on it. Following a recent research monograph by Delfour and Zolésio [11], we consider the characteristic functions of the subsets of R 2 and their distance functions. The L² norm of the difference of characteristic functions, the L∞ and the W 1,2 norms of the difference of distance functions define interesting topologies, in particular the well-known Hausdorff distance. Because of practical considerations arising from the fact that we deal wit