Ting-Li Chen

Dr. Ting-Li Chen

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 January 2006 in Journal of Neuroscience
Verified
Journal Article
Open access
PDF file
AAAsohan Amarasingham
Asohan Amarasingham
TCTing-Li Chen
Ting-Li Chen
SGStuart Geman
Stuart Geman
MHMatthew T. Harrison
Matthew T. Harrison
DSDavid L. Sheinberg
David L. Sheinberg
The variability of cortical activity in response to repeated presentations of a stimulus has been an area of controversy in the ongoing debate regarding the evidence for fine temporal structure in nervous system activity. We present a new statistical technique for assessing the significance of observed variability in the neural spike counts with respect to a minimal Poisson hypothesis, which avoids the conventional but troubling assumption that the spiking process is identically distributed across trials. We apply the method to recordings of inferotemporal cortical neurons of primates presented with complex visual stimuli. On this data, the minimal Poisson hypothesis is rejected: the neuronal responses are too reliable to be fit by a typical firing-rate model, even allowing for sudden, time-varying, and trial-dependent rate changes after stimulus onset. The statistical evidence favors a tightly regulated stimulus response in these neurons, close to stimulus onset, although not further away.

1 September 2013 in Statistics & Probability Letters
Verified
Journal Article
Closed access
TCTing-Li Chen
Ting-Li Chen
CHChii-Ruey Hwang
Chii-Ruey Hwang

1 September 2023 in Artificial Intelligence in Medicine
Verified
Journal Article
Closed access
YNYiuwai Ng
Yiuwai Ng
MLMin-Tsun Liao
Min-Tsun Liao
TCTing-Li Chen
Ting-Li Chen
CLChih-Kuo Lee
Chih-Kuo Lee
CCCheng-Ying Chou
Cheng-Ying Chou
WWWeichung Wang
Weichung Wang

1 January 2012 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
TCTing-Li Chen
Ting-Li Chen
WCWei-Kuo Chen
Wei-Kuo Chen
CHChii-Ruey Hwang
Chii-Ruey Hwang
HPHui-Ming Pai
Hui-Ming Pai
Let ${\cal X}$ be a finite space and let $\pi$ be an underlying probability on ${\cal X}$. For any real-valued function $f$ defined on ${\cal X}$, we are interested in calculating the expectation of $f$ under $\pi$. Let $X_0,X_1,\ldots,X_n,\ldots$ be a Markov chain generated by some transition matrix $P$ with invariant distribution $\pi$. The time average, $\frac{1}{n}\sum_{k=0}^{n-1} f(X_k)$, is a reasonable approximation to the expectation, $E_\pi[f(X)]$. Which matrix $P$ minimizes the asymptotic variance of $\frac{1}{n}\sum_{k=0}^{n-1} f(X_k)$? The answer depends on $f$. Rather than a worst-case analysis, we will identify the set of $P$'s that minimize the average asymptotic variance, averaged with respect to a uniform distribution on $f$.

1 March 2014 in The Annals of Applied Statistics
Verified
Journal Article
Open access
PDF file
TCTing-Li Chen
Ting-Li Chen
DHDai-Ni Hsieh
Dai-Ni Hsieh
HHHung Hung
Hung Hung
ITI-Ping Tu
I-Ping Tu
PWPei-Shien Wu
Pei-Shien Wu
SHSu-Yun Huang
Su-Yun Huang
Cryo-electron microscopy (cryo-EM) has recently emerged as a powerful tool for obtaining three-dimensional (3D) structures of biological macromolecules in native states. A minimum cryo-EM image data set for deriving a meaningful reconstruction is comprised of thousands of randomly orientated projections of identical particles photographed with a small number of electrons. The computation of 3D structure from 2D projections requires clustering, which aims to enhance the signal to noise ratio in each view by grouping similarly oriented images. Nevertheless, the prevailing clustering techniques are often compromised by three characteristics of cryo-EM data: high noise content, high dimensionality and large number of clusters. Moreover, since clustering requires registering images of similar orientation into the same pixel coordinates by 2D alignment, it is desired that the clustering algorithm can label misaligned images as outliers. Herein, we introduce a clustering algorithm $\gamma$-SUP to model the data with a $q$-Gaussian mixture and adopt the minimum $\gamma$-divergence for estimation, and then use a self-updating procedure to obtain the numerical solution. We apply $\gamma$-SUP to the cryo-EM images of two benchmark macromolecules, RNA polymerase II and ribosome. In the former case, simulated images were chosen to decouple clustering from alignment to demonstrate $\gamma$-SUP is more robust to misalignment outliers than the existing clustering methods used in the cryo-EM community. In the latter case, the clustering of real cryo-EM data by our $\gamma$-SUP method eliminates noise in many views to reveal true structure features of ribosome at the projection level.

29 July 2024 in Computer Methods and Programs in Biomedicine
Verified
Journal Article
Closed access
CLChih-Kuo Lee
Chih-Kuo Lee
TCTing-Li Chen
Ting-Li Chen
JWJeng-En Wu
Jeng-En Wu
MLMin-Tsun Liao
Min-Tsun Liao
CWChiehhung Wang
Chiehhung Wang
CCCheng-Ying Chou
Cheng-Ying Chou