Hongkai Zhao

Hongkai Zhao

Auto-generated profile, based on publicly available information

Hongkai Zhao

Department of Mathematics, University of California, Irvine, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
21 May 2004 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
HZHongkai Zhao
Hongkai Zhao
In this paper a fast sweeping method for computing the numerical solution of Eikonal equations on a rectangular grid is presented. The method is an iterative method which uses upwind difference for discretization and uses Gauss-Seidel iterations with alternating sweeping ordering to solve the discretized system. The crucial idea is that each sweeping ordering follows a family of characteristics of the corresponding Eikonal equation in a certain direction simultaneously. The method has an optimal complexity of O ( N ) O(N) for N N grid points and is extremely simple to implement in any number of dimensions. Monotonicity and stability properties of the fast sweeping algorithm are proven. Convergence and error estimates of the algorithm for computing the distance function is studied in detail. It is shown that 2 n 2^{n} Gauss-Seidel iterations is enough for the distance function in n n dimensions. An estimation of the number of iterations for general Eikonal equations is also studied. Numerical examples are used to verify the analysis.

28 December 2005 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
YZYong-Tao Zhang
Yong-Tao Zhang
HZHong-Kai Zhao
Hong-Kai Zhao
JQJianliang Qian
Jianliang Qian

4 May 2011 in Physics in Medicine & Biology
Verified
Journal Article
Closed access
HGHao Gao
Hao Gao
JCJian-Feng Cai
Jian-Feng Cai
ZSZuowei Shen
Zuowei Shen
HZHongkai Zhao
Hongkai Zhao
The purpose of this paper for four-dimensional (4D) computed tomography (CT) is threefold. (1) A new spatiotemporal model is presented from the matrix perspective with the row dimension in space and the column dimension in time, namely the robust PCA (principal component analysis)-based 4D CT model. That is, instead of viewing the 4D object as a temporal collection of three-dimensional (3D) images and looking for local coherence in time or space independently, we perceive it as a mixture of low-rank matrix and sparse matrix to explore the maximum temporal coherence of the spatial structure among phases. Here the low-rank matrix corresponds to the 'background' or reference state, which is stationary over time or similar in structure; the sparse matrix stands for the 'motion' or time-varying component, e.g., heart motion in cardiac imaging, which is often either approximately sparse itself or can be sparsified in the proper basis. Besides 4D CT, this robust PCA-based 4D CT model should be applicable in other imaging problems for motion reduction or/and change detection with the least amount of data, such as multi-energy CT, cardiac MRI, and hyperspectral imaging. (2) A dynamic strategy for data acquisition, i.e. a temporally spiral scheme, is proposed that can potentially maintain similar reconstruction accuracy with far fewer projections of the data. The key point of this dynamic scheme is to reduce the total number of measurements, and hence the radiation dose, by acquiring complementary data in different phases while reducing redundant measurements of the common background structure. (3) An accurate, efficient, yet simple-to-implement algorithm based on the split Bregman method is developed for solving the model problem with sparse representation in tight frames.

9 March 2007 in Journal of Scientific Computing
Verified
Journal Article
Closed access
PDF file
JQJianliang Qian
Jianliang Qian
Yong-Tao ZhangYong-Tao Zhang
Yong-Tao Zhang
HZHong-Kai Zhao
Hong-Kai Zhao

17 May 2018 in Communications on Pure and Applied Mathematics
Verified
Journal Article
Closed access
PDF file
BEBjörn Engquist
Björn Engquist
HZHongkai Zhao
Hongkai Zhao

1 January 2013 in Inverse Problems and Imaging
Verified
Journal Article
Open access
PDF file
RLRongjie Lai
Rongjie Lai
JLJiang Liang
Jiang Liang
HZHong-Kai Zhao
Hong-Kai Zhao
In this work, we introduce a numerical method to approximate differential operators and integrals on point clouds sampled from a two dimensional manifold embedded in $\mathbb{R}^n$. Global mesh structure is usually hard to construct in this case. While our method only relies on the local mesh structure at each data point, which is constructed through local triangulation in the tangent space obtained by local principal component analysis (PCA). Once the local mesh is available, we propose numerical schemes to approximate differential operators and define mass matrix and stiffness matrix on point clouds, which are utilized to solve partial differential equations (PDEs) and variational problems on point clouds. As numerical examples, we use the proposed local mesh method and variational formulation to solve the Laplace-Beltrami eigenproblem and solve the Eikonal equation for computing distance map and tracing geodesics on point clouds.