Kevin Tsia

Dr. Kevin Tsia


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
2 March 2020 in Nature Methods
Verified
Journal Article
Closed access
PDF file
JWJianglai Wu
Jianglai Wu
YLYajie Liang
Yajie Liang
SCShuo Chen
Shuo Chen
CHChing-Lung Hsu
Ching-Lung Hsu
MCMariya Chavarha
Mariya Chavarha
NJNa Ji
Na Ji

12 August 2016 in Light: Science & Applications
Verified
Journal Article
Open access
PDF file
JWJiang-Lai Wu
Jiang-Lai Wu
YXYi-Qing Xu
Yi-Qing Xu
JXJing-Jiang Xu
Jing-Jiang Xu
XWXiao-Ming Wei
Xiao-Ming Wei
ACAntony Cs Chan
Antony Cs Chan
KTKevin Tsia
Kevin Tsia
Optical time-stretch imaging enables the continuous capture of non-repetitive events in real time at a line-scan rate of tens of MHz—a distinct advantage for the ultrafast dynamics monitoring and high-throughput screening that are widely needed in biological microscopy. However, its potential is limited by the technical challenge of achieving significant pulse stretching (that is, high temporal dispersion) and low optical loss, which are the critical factors influencing imaging quality, in the visible spectrum demanded in many of these applications. We present a new pulse-stretching technique, termed free-space angular-chirp-enhanced delay (FACED), with three distinguishing features absent in the prevailing dispersive-fiber-based implementations: (1) it generates substantial, reconfigurable temporal dispersion in free space (>1 ns nm−1) with low intrinsic loss (<6 dB) at visible wavelengths; (2) its wavelength-invariant pulse-stretching operation introduces a new paradigm in time-stretch imaging, which can now be implemented both with and without spectral encoding; and (3) pulse stretching in FACED inherently provides an ultrafast all-optical laser-beam scanning mechanism at a line-scan rate of tens of MHz. Using FACED, we demonstrate not only ultrafast laser-scanning time-stretch imaging with superior bright-field image quality compared with previous work but also, for the first time, MHz fluorescence and colorized time-stretch microscopy. Our results show that this technique could enable a wider scope of applications in high-speed and high-throughput biological microscopy that were once out of reach.

28 April 2010 in Optics Express
Verified
Journal Article
Open access
PDF file
KTKevin Tsia
Kevin Tsia
KGKeisuke Goda
Keisuke Goda
DCDale Capewell
Dale Capewell
BJBahram Jalali
Bahram Jalali
Serial time-encoded amplified microscopy (STEAM) is an entirely new imaging modality that enables ultrafast continuous real-time imaging with high sensitivity. By means of optical image amplification, STEAM overcomes the fundamental tradeoff between sensitivity and speed that affects virtually all optical imaging systems. Unlike the conventional microscope systems, the performance of STEAM depends not only on the lenses, but also on the properties of other components that are unique to STEAM, namely the spatial disperser, the group velocity dispersion element, and the back-end electronic digitizer. In this paper, we present an analysis that shows how these considerations affect the spatial resolution, and how they create a trade-off between the number of pixels and the frame rate of the STEAM imager. We also quantify how STEAM’s optical image amplification feature improves the imaging sensitivity. These analyses not only provide valuable insight into the operation of STEAM technology but also serve as a blue print for implementation and optimization of this new imaging technology.

20 September 2021 in Nature Communications
Verified
Journal Article
Open access
PDF file
SSShobana V. Stassen
Shobana V. Stassen
GYGwinky G. K. Yip
Gwinky G. K. Yip
Kenneth WongKenneth Wong
Kenneth Wong
JHJoshua W. K. Ho
Joshua W. K. Ho
KTKevin Tsia
Kevin Tsia
Inferring cellular trajectories using a variety of omic data is a critical task in single-cell data science. However, accurate prediction of cell fates, and thereby biologically meaningful discovery, is challenged by the sheer size of single-cell data, the diversity of omic data types, and the complexity of their topologies. We present VIA, a scalable trajectory inference algorithm that overcomes these limitations by using lazy-teleporting random walks to accurately reconstruct complex cellular trajectories beyond tree-like pathways (e.g., cyclic or disconnected structures). We show that VIA robustly and efficiently unravels the fine-grained sub-trajectories in a 1.3-million-cell transcriptomic mouse atlas without losing the global connectivity at such a high cell count. We further apply VIA to discovering elusive lineages and less populous cell fates missed by other methods across a variety of data types, including single-cell proteomic, epigenomic, multi-omics datasets, and a new in-house single-cell morphological dataset.

23 January 2020 in Bioinformatics
Verified
Journal Article
Open access
PDF file
SSShobana V Stassen
Shobana V Stassen
DSDickson M D Siu
Dickson M D Siu
KLKelvin C M Lee
Kelvin C M Lee
JHJoshua W K Ho
Joshua W K Ho
Hayden K.-H. SoHayden K.-H. So
Hayden K.-H. So
KTKevin Tsia
Kevin Tsia
New single-cell technologies continue to fuel the explosive growth in the scale of heterogeneous single-cell data. However, existing computational methods are inadequately scalable to large datasets and therefore cannot uncover the complex cellular heterogeneity. We introduce a highly scalable graph-based clustering algorithm PARC—Phenotyping by Accelerated Refined Community-partitioning—for large-scale, high-dimensional single-cell data (>1 million cells). Using large single-cell flow and mass cytometry, RNA-seq and imaging-based biophysical data, we demonstrate that PARC consistently outperforms state-of-the-art clustering algorithms without subsampling of cells, including Phenograph, FlowSOM and Flock, in terms of both speed and ability to robustly detect rare cell populations. For example, PARC can cluster a single-cell dataset of 1.1 million cells within 13 min, compared with >2 h for the next fastest graph-clustering algorithm. Our work presents a scalable algorithm to cope with increasingly large-scale single-cell analysis. https://github.com/ShobiStassen/PARC. Supplementary data are available at Bioinformatics online.

27 October 2021 in Nature Photonics
Verified
Journal Article
Closed access
PDF file
JWJianglai Wu
Jianglai Wu
NJNa Ji
Na Ji
KTKevin Tsia
Kevin Tsia