14.08.2013 Views

Docteur de l'université Automatic Segmentation and Shape Analysis ...

Docteur de l'université Automatic Segmentation and Shape Analysis ...

Docteur de l'université Automatic Segmentation and Shape Analysis ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

36 Chapter 2 Literature Review<br />

In parameterization based methods, the shape l<strong>and</strong>marks are mapped to the pa-<br />

rameter space bijectively, which establishes a correspon<strong>de</strong>nce between each l<strong>and</strong>-<br />

mark point <strong>and</strong> a parameter. Depending on the topology of the object, the un<strong>de</strong>r-<br />

lying domain of parameters is usually chosen to be a simpler space homeomorphic<br />

to the representation of the shape. The correspon<strong>de</strong>nce between different shapes is<br />

then <strong>de</strong>fined by associating the l<strong>and</strong>mark points with the same parameter. Most<br />

common genus 0 surfaces (i.e. homeomorphic to the sphere S 2 ) are usually pa-<br />

rameterized by spherical coordinates mapping the l<strong>and</strong>marks to the points on the<br />

unit sphere. Commonly used parameterization algorithms are angle-preserving<br />

conformal mapping (Haker et al., 2000; Gu <strong>and</strong> Yau, 2003; Gu et al., 2004), <strong>and</strong><br />

area-preserving mapping (Brechbühler et al., 1995). Based on the spherical pa-<br />

rameterization, the correspon<strong>de</strong>nce can be <strong>de</strong>termined by aligning the first or<strong>de</strong>r<br />

ellipsoid of the SPHARM shape <strong>de</strong>composition (Kelemen et al., 1999). Since the<br />

parameterization of each shape is in<strong>de</strong>pen<strong>de</strong>nt, there is no guarantee of ‘optimal’<br />

correspon<strong>de</strong>nce between two parameterizations. Reparameterization, i.e. transfor-<br />

mation in the parameterization space, is nee<strong>de</strong>d to improve the correspon<strong>de</strong>nce.<br />

For a shape mo<strong>de</strong>l with given correspon<strong>de</strong>nce, the <strong>de</strong>terminant of the covariance<br />

matrix is used by Kotcheff <strong>and</strong> Taylor (1998) as an objective function for the opti-<br />

mization the mo<strong>de</strong>l correspon<strong>de</strong>nce <strong>and</strong> compactness. The minimum <strong>de</strong>scription<br />

length (MDL, Davies et al., 2002) based on information theoretic principles is used<br />

as the cost function in search for optimal correspon<strong>de</strong>nce, which is to be solved<br />

by genetic algorithm (Davies et al., 2002) or Nel<strong>de</strong>r-Mead simplex (Davies et al.,<br />

2003). A simplified MDL by Thodberg (2003) gives comparable performance as<br />

the original, with analytic form that can be minimized more efficiently using the<br />

steepest gradient (Ericsson <strong>and</strong> Åström, 2003; Hladůvka <strong>and</strong> Bühler, 2005). To<br />

reduce the computational complexity of reparameterization on the sphere, the<br />

‘shape image’ technique is <strong>de</strong>veloped by embedding the sphere to a rectangular<br />

region, such that the interpolation can be carried out on a 2D grid (Davies et al.,<br />

2008b). Full <strong>de</strong>tails of the SSM optimization has been published as a monograph<br />

(Davies et al., 2008a).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!