Biomedical subjects

Tony F Chan

Publications and source records attributed to Tony F Chan.

5 recordsLinked to original sources

PubMed2006

Dynamic cluster formation using level set methods.

Density-based clustering has the advantages for 1) allowing arbitrary shape of cluster and 2) not requiring the number of clusters as input. However, when clusters touch each other, both the cluster centers and cluster boundaries (as the peaks and valleys of the density distribution) become fuzzy and difficult to determine. We introduce the notion of cluster intensity function (CIF) which captures the important characteristics of clusters. When clusters are well-separated, CIFs are similar to density functions. But, when clusters become closed to each other, CIFs still clearly reveal cluster centers, cluster boundaries, and degree of membership of each data point to the cluster that it belongs. Clustering through bump hunting and valley seeking based on these functions are more robust than that based on density functions obtained by kernel density estimation, which are often oscillatory or oversmoothed. These problems of kernel density estimation are resolved using Level Set Methods and related techniques. Comparisons with two existing density-based methods, valley seeking and DBSCAN, are presented which illustrate the advantages of our approach.

Algorithms↗

PubMed2005

Brain surface parameterization using Riemann surface structure.

We develop a general approach that uses holomorphic 1-forms to parameterize anatomical surfaces with complex (possibly branching) topology. Rather than evolve the surface geometry to a plane or sphere, we instead use the fact that all orientable surfaces are Riemann surfaces and admit conformal structures, which induce special curvilinear coordinate systems on the surfaces. Based on Riemann surface structure, we can then canonically partition the surface into patches. Each of these patches can be conformally mapped to a parallelogram. The resulting surface subdivision and the parameterizations of the components are intrinsic and stable. To illustrate the technique, we computed conformal structures for several types of anatomical surfaces in MRI scans of the brain, including the cortex, hippocampus, and lateral ventricles. We found that the resulting parameterizations were consistent across subjects, even for branching structures such as the ventricles, which are otherwise difficult to parameterize. Compared with other variational approaches based on surface inflation, our technique works on surfaces with arbitrary complexity while guaranteeing minimal distortion in the parameterization. It also offers a way to explicitly match landmark curves in anatomical surfaces such as the cortex, providing a surface-based framework to compare anatomy statistically and to generate grids on surfaces for PDE-based signal processing.

Algorithms↗

PubMed2005

Optimization of brain conformal mapping with landmarks.

To compare and integrate brain data, data from multiple subjects are typically mapped into a canonical space. One method to do this is to conformally map cortical surfaces to the sphere. It is well known that any genus zero Riemann surface can be conformally mapped to a sphere. Therefore, conformal mapping offers a convenient method to parameterize cortical surfaces without angular distortion, generating an orthogonal grid on the cortex that locally preserves the metric. To compare cortical surfaces more effectively, it is advantageous to adjust the conformal parameterizations to match consistent anatomical features across subjects. This matching of cortical patterns improves the alignment of data across subjects, although it is more challenging to create a consistent conformal (orthogonal) parameterization of anatomy across subjects when landmarks are constrained to lie at specific locations in the spherical parameter space. Here we propose a new method, based on a new energy functional, to optimize the conformal parameterization of cortical surfaces by using landmarks. Experimental results on a dataset of 40 brain hemispheres showed that the landmark mismatch energy can be greatly reduced while effectively preserving conformality. The key advantage of this conformal parameterization approach is that any local adjustments of the mapping to match landmarks do not affect the conformality of the mapping significantly. We also examined how the parameterization changes with different weighting factors. As expected, the landmark matching error can be reduced if it is more heavily penalized, but conformality is progressively reduced.

Adult↗

PubMed2004

Genus zero surface conformal mapping and its application to brain surface mapping.

We developed a general method for global conformal parameterizations based on the structure of the cohomology group of holomorphic one-forms for surfaces with or without boundaries (Gu and Yau, 2002), (Gu and Yau, 2003). For genus zero surfaces, our algorithm can find a unique mapping between any two genus zero manifolds by minimizing the harmonic energy of the map. In this paper, we apply the algorithm to the cortical surface matching problem. We use a mesh structure to represent the brain surface. Further constraints are added to ensure that the conformal map is unique. Empirical tests on magnetic resonance imaging (MRI) data show that the mappings preserve angular relationships, are stable in MRIs acquired at different times, and are robust to differences in data triangulation, and resolution. Compared with other brain surface conformal mapping algorithms, our algorithm is more stable and has good extensibility.

Algorithms↗

PubMed2003

Genus zero surface conformal mapping and its application to brain surface mapping.

It is well known that any genus zero surface can be mapped conformally onto the sphere and any local portion thereof onto a disk. However, it is not trivial to find a general method which finds a conformal mapping between two general genus zero surfaces. We propose a new variational method which can find a unique mapping between any two genus zero manifolds by minimizing the harmonic energy of the map. We demonstrate the feasibility of our algorithm by applying it to the cortical surface matching problem. We use a mesh structure to represent the brain surface. Further constraints are added to ensure that the conformal map is unique. Empirical tests on MRI data show that the mappings preserve angular relationships, are stable in MRIs acquired at different times, and are robust to differences in data triangulation, and resolution. Compared with other brain surface conformal mapping algorithms, our algorithm is more stable and has good extensibility.

Algorithms↗