M
Michael K. Ng
Researcher at University of Hong Kong
Publications - 658
Citations - 24376
Michael K. Ng is an academic researcher from University of Hong Kong. The author has contributed to research in topics: Cluster analysis & Computer science. The author has an hindex of 72, co-authored 608 publications receiving 20492 citations. Previous affiliations of Michael K. Ng include The Chinese University of Hong Kong & Vanderbilt University.
Papers
More filters
Journal ArticleDOI
Multi-Dimensional Visual Data Completion via Low-Rank Tensor Representation Under Coupled Transform
TL;DR: Zhang et al. as discussed by the authors proposed a low-rank tensor representation based on coupled transform, which fully exploits the spatial multi-scale nature and redundancy in spatial and spectral/temporal dimensions, leading to a better low tensor multi-rank approximation.
Journal ArticleDOI
Fast inversion of triangular Toeplitz matrices
TL;DR: This paper presents an approximate inversion method for triangular Toeplitz matrices based on trigonometric polynomial interpolation and revise the approximate method proposed by Bini.
Journal ArticleDOI
A higher-order Markov model for the Newsboy's problem
TL;DR: A higher-order Markov model whose number of states and parameters are linear with respect to the order of the model is proposed and applied to solve the generalised Newsboy's problem.
Journal ArticleDOI
A divide-and-conquer fast finite difference method for spacetime fractional partial differential equation
TL;DR: A fast finite difference method (FDM) for spacetime FPDE, utilizing the Toeplitz-like structure of the coefficient matrix to develop a matrix-free preconditioned fast Krylov subspace iterative solver to invert the coefficient Matrix at each time step.
Proceedings ArticleDOI
Fast image reconstruction algorithms combining half-quadratic regularization and preconditioning
Mila Nikolova,Michael K. Ng +1 more
TL;DR: This work proposes a method applying pertinent preconditioning to an adapted half-quadratic equivalent form of the objective function, and focuses specifically on Huber regularization, which exhibits the possibility of getting very fast calculations while preserving the edges in the solution.