Ting Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ting Chen has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Anand Rangarajan
University of Florida
3 shared publications - Baba C. Vemuri
Department of CISE University of Florida Gainesville FL USA
3 shared publications - Stephan J. Eisenschenk
Department of Neurology, University of Florida, Gainesville, FL, USA
3 shared publications Maneesh Dewan
SYNGO US R&D, Siemens Healthcare
1 shared publicationShaoting Zhang
Rutgers University
1 shared publicationYiqiang Zhan
SYNGO US R&D, Siemens Healthcare
1 shared publication
Latest Publications
- 26 January 2012
- Published by Elsevier in NeuroImage
- Vol. 60 (3) , 1778-1787
Construction of a neuroanatomical shape complex atlas from 3D MRI brain structures
- 26 January 2012
- Published by Elsevier in NeuroImage
- Vol. 60 (3) , 1778-1787
Construction of a neuroanatomical shape complex atlas from 3D MRI brain structures
- Open Access
- 1 January 2011
- Published by Springer Nature
- Vol. 14, 595-602
Mixture of Segmenters with Discriminative Spatial Regularization and Sparse Weight Selection
This paper presents a novel segmentation algorithm which automatically learns the combination of weak segmenters and builds a strong one based on the assumption that the locally weighted combination varies w.r.t. both the weak segmenters and the training images. We learn the weighted combination during the training stage using a discriminative spatial regularization which depends on training set labels. A closed form solution to the cost function is derived for this approach. In the testing stage, a sparse regularization scheme is imposed to avoid overfitting. To the best of our knowledge, such a segmentation technique has never been reported in literature and we empirically show that it significantly improves on the performances of the weak segmenters. After showcasing the performance of the algorithm in the context of atlas-based segmentation, we present comparisons to the existing weak segmenter combination strategies on a hippocampal data set.
- 1 January 2011
- Published by Springer Nature
- Vol. 14, 595-602
Open AccessMixture of Segmenters with Discriminative Spatial Regularization and Sparse Weight Selection
This paper presents a novel segmentation algorithm which automatically learns the combination of weak segmenters and builds a strong one based on the assumption that the locally weighted combination varies w.r.t. both the weak segmenters and the training images. We learn the weighted combination during the training stage using a discriminative spatial regularization which depends on training set labels. A closed form solution to the cost function is derived for this approach. In the testing stage, a sparse regularization scheme is imposed to avoid overfitting. To the best of our knowledge, such a segmentation technique has never been reported in literature and we empirically show that it significantly improves on the performances of the weak segmenters. After showcasing the performance of the algorithm in the context of atlas-based segmentation, we present comparisons to the existing weak segmenter combination strategies on a hippocampal data set.
- 1 January 2011
- Published by Springer Nature
- Vol. 14, 574-581
Automatic Alignment of Brain MR Scout Scans Using Data-adaptive Multi-structural Model
Accurate slice positioning of diagnostic MR brain images is clinically important due to their inherent anisotropic resolution. Recently, a low-res fast 3D “scout” scan has become popular as a pre-requisite localizer for the positioning of these diagnostic high-res images on relevant anatomies. Automation of this “scout” scan alignment needs to be highly robust, accurate and reproducible, which can not be achieved by existing methods such as voxel-based registration. Although recently proposed “Learning Ensembles of Anatomical Patterns (LEAP)” framework [4] paves the way to high robustness through redundant anatomy feature detections, the “somewhat conflicting” accuracy and reproducibility goals can not be satisfied simultaneously from the single model-based alignment perspective. Hence, we present a data adaptive multi-structural model based registration algorithm to achieve these joint goals. We validate our system on a large number of clinical data sets (731 adult and 100 pediatric brain MRI scans). Our algorithm demonstrates > 99.5% robustness with high accuracy. The reproducibility is < 0.32° for rotation and < 0.27mm for translation on average within multiple follow-up scans for the same patient.
- 1 January 2011
- Published by Springer Nature
- Vol. 14, 574-581
Automatic Alignment of Brain MR Scout Scans Using Data-adaptive Multi-structural Model
Accurate slice positioning of diagnostic MR brain images is clinically important due to their inherent anisotropic resolution. Recently, a low-res fast 3D “scout” scan has become popular as a pre-requisite localizer for the positioning of these diagnostic high-res images on relevant anatomies. Automation of this “scout” scan alignment needs to be highly robust, accurate and reproducible, which can not be achieved by existing methods such as voxel-based registration. Although recently proposed “Learning Ensembles of Anatomical Patterns (LEAP)” framework [4] paves the way to high robustness through redundant anatomy feature detections, the “somewhat conflicting” accuracy and reproducibility goals can not be satisfied simultaneously from the single model-based alignment perspective. Hence, we present a data adaptive multi-structural model based registration algorithm to achieve these joint goals. We validate our system on a large number of clinical data sets (731 adult and 100 pediatric brain MRI scans). Our algorithm demonstrates > 99.5% robustness with high accuracy. The reproducibility is < 0.32° for rotation and < 0.27mm for translation on average within multiple follow-up scans for the same patient.
- Open Access
- 1 January 2010
- Published by Springer Nature
- Vol. 13, 65-72
Construction of Neuroanatomical Shape Complex Atlas from 3D Brain MRI
This paper proposes a novel technique for constructing a neuroanatomical shape complex atlas using an information geometry framework. A shape complex is a collection of shapes in a local neighborhood. We represent the boundary of the entire shape complex using the zero level set of a distance function \(S(\textbf{x})\). The spatial relations between the different anatomical structures constituting the shape complex are captured via the distance transform. We then leverage the well known relationship between the stationary state wave function ψ(x) of the Schrödinger equation \(-\hbar^2\nabla^2 \psi+\psi=0\) and the eikonal equation \(\|\nabla S\|=1\) satisfied by any distance function \(S(\textbf{x})\). This leads to a one-to-one map between \(\psi(\textbf{x})\) and S(x) and allows for recovery of \(S(\textbf{x})\) from ψ(x) through an explicit mathematical relationship. Since the wave function can be regarded as a square-root density function, we are able to exploit this connection and convert shape complex distance transforms into probability density functions. Furthermore, square-root density functions can be seen as points on a unit hypersphere whose Riemannian structure is fully known. A shape complex atlas is constructed by first computing the Karcher mean \(\bar\psi(\textbf{x})\) of the wave functions, followed by an inverse mapping of the estimated mean back to the space of distance transforms in order to realize the atlas. We demonstrate the shape complex atlas computation via a set of experiments on a population of brain MRI scans. We also present modes of variation from the computed atlas for the control population to demonstrate the shape complex variability.- 1 January 2010
- Published by Springer Nature
- Vol. 13, 65-72
Open AccessConstruction of Neuroanatomical Shape Complex Atlas from 3D Brain MRI
This paper proposes a novel technique for constructing a neuroanatomical shape complex atlas using an information geometry framework. A shape complex is a collection of shapes in a local neighborhood. We represent the boundary of the entire shape complex using the zero level set of a distance function \(S(\textbf{x})\). The spatial relations between the different anatomical structures constituting the shape complex are captured via the distance transform. We then leverage the well known relationship between the stationary state wave function ψ(x) of the Schrödinger equation \(-\hbar^2\nabla^2 \psi+\psi=0\) and the eikonal equation \(\|\nabla S\|=1\) satisfied by any distance function \(S(\textbf{x})\). This leads to a one-to-one map between \(\psi(\textbf{x})\) and S(x) and allows for recovery of \(S(\textbf{x})\) from ψ(x) through an explicit mathematical relationship. Since the wave function can be regarded as a square-root density function, we are able to exploit this connection and convert shape complex distance transforms into probability density functions. Furthermore, square-root density functions can be seen as points on a unit hypersphere whose Riemannian structure is fully known. A shape complex atlas is constructed by first computing the Karcher mean \(\bar\psi(\textbf{x})\) of the wave functions, followed by an inverse mapping of the estimated mean back to the space of distance transforms in order to realize the atlas. We demonstrate the shape complex atlas computation via a set of experiments on a population of brain MRI scans. We also present modes of variation from the computed atlas for the control population to demonstrate the shape complex variability.