Ming‐Jun Lai

ORCID: 0000-0003-0274-2545
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Numerical Analysis Techniques
  • Image and Signal Denoising Methods
  • Sparse and Compressive Sensing Techniques
  • Advanced Numerical Methods in Computational Mathematics
  • Numerical methods in engineering
  • Mathematical Analysis and Transform Methods
  • Statistical and numerical algorithms
  • Matrix Theory and Algorithms
  • Blind Source Separation Techniques
  • Advanced Optimization Algorithms Research
  • Numerical methods in inverse problems
  • Advanced Mathematical Modeling in Engineering
  • Computational Geometry and Mesh Generation
  • Digital Filter Design and Implementation
  • Statistical Methods and Inference
  • Medical Image Segmentation Techniques
  • 3D Shape Modeling and Analysis
  • Microwave Imaging and Scattering Analysis
  • Complex Network Analysis Techniques
  • Soil Geostatistics and Mapping
  • Differential Equations and Numerical Methods
  • Mathematical functions and polynomials
  • Remote Sensing and LiDAR Applications
  • Polynomial and algebraic computation
  • Advanced Image Fusion Techniques

University of Georgia
2015-2025

National Taipei University of Technology
2005

University of Missouri–St. Louis
2003

Pennsylvania State University
2003

University of Utah
1992

Texas A&M University
1985

10.1016/j.acha.2008.09.001 article EN publisher-specific-oa Applied and Computational Harmonic Analysis 2008-09-26

10.1007/s10915-016-0318-2 article EN Journal of Scientific Computing 2016-11-12

In this paper, we first study $\ell_q$ minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, focus on unconstrained minimization, which show a few advantages noisy measurements and/or approximately Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1--38] constrained start with preliminary yet novel analysis includes convergence, error bound, local convergence behavior. Then, are extended to...

10.1137/110840364 article EN SIAM Journal on Numerical Analysis 2013-01-01

We study an unconstrained version of the $\ell_q$ minimization for sparse solution underdetermined linear systems $0<q\leq1$. Although is nonconvex when $q<1$, we introduce a regularization and develop iterative algorithm. show that algorithm converges solutions converge to under some additional assumptions on systems. Numerical experiments are presented demonstrate effectiveness our approach.

10.1137/090775397 article EN SIAM Journal on Optimization 2011-01-01

10.1007/s00205-010-0357-z article EN Archive for Rational Mechanics and Analysis 2010-09-06

In this paper, we propose an efficient and scalable low rank matrix completion algorithm. The key idea is to extend the orthogonal matching pursuit method from vector case case. We further economic version of our algorithm by introducing a novel weight updating rule reduce time storage complexity. Both versions are computationally inexpensive for each iteration find satisfactory results in few iterations. Another advantage proposed that it has only one tunable parameter, which rank. It easy...

10.1137/130934271 article EN SIAM Journal on Scientific Computing 2015-01-01

10.1016/j.acha.2010.11.002 article EN Applied and Computational Harmonic Analysis 2010-11-11

This paper studies the long-existing idea of adding a nice smooth function to "smooth" nondifferentiable objective in context sparse optimization, particular, minimization $\|\mathbf{x}\|_1+\frac{1}{2\alpha}\|\mathbf{x}\|_2^2$, where $\mathbf{x}$ is vector, as well $\|\mathbf{X}\|_*+\frac{1}{2\alpha}\|\mathbf{X}\|_F^2$, $\mathbf{X}$ matrix and $\|\mathbf{X}\|_*$ $\|\mathbf{X}\|_F$ are nuclear Frobenius norms $\mathbf{X}$, respectively. We show that they let vectors low-rank matrices be...

10.1137/120863290 article EN SIAM Journal on Imaging Sciences 2013-01-01

10.1023/a:1018958011262 article EN Advances in Computational Mathematics 1998-01-01

10.1016/j.acha.2006.04.001 article EN Applied and Computational Harmonic Analysis 2006-06-20

In this paper the asymptotic behavior of penalized spline estimators is studied using bivariate splines over triangulations and an energy functional as penalty. The rate L2 convergence derived, which achieves optimal nonparametric established by Stone (1982). normality established, shown to hold uniformly points where regression function estimated. size conditional variance also evaluated a simple expression for given. Simulation experiments have provided strong evidence that corroborates...

10.5705/ss.2010.278 article EN Statistica Sinica 2012-09-10

This paper introduces a parallel and distributed extension to the alternating direction method of multipliers (ADMM) for solving convex problem: minimize $\sum_{i=1}^N f_i(x_i)$ subject A_i x_i=c, x_i\in \mathcal{X}_i$. The algorithm decomposes original problem into N smaller subproblems solves them in at each iteration. Jacobian-type is well suited computing particularly attractive certain large-scale problems. few novel results. Firstly, it shows that extending ADMM straightforwardly from...

10.48550/arxiv.1312.3040 preprint EN other-oa arXiv (Cornell University) 2013-01-01

Surface-based data are prevalent across diverse practical applications in various fields. This paper introduces a novel nonparametric method to discover the underlying signals from distributed on complex surface-based domains. The proposed approach involves penalised spline estimator defined triangulation of surface patches, enabling effective signal extraction and recovery. offers superior handling 'leakage' or 'boundary effects' over domains, enhanced computational efficiency, capabilities...

10.1080/10485252.2025.2449886 article EN Journal of nonparametric statistics 2025-01-07

\textit{Drosophila melanogaster} has been established as a model organism for investigating the fundamental principles of developmental gene interactions. The expression patterns can be documented digital images, which are annotated with anatomical ontology terms to facilitate pattern discovery and comparison. automated annotation images received increasing attention due recent expansion image database. effectiveness relies on quality feature representation. Previous studies have...

10.48550/arxiv.1407.8147 preprint EN other-oa arXiv (Cornell University) 2014-01-01

It is known that generalized barycentric coordinates can be used to form Bernstein polynomial-like functions over a polygon with any number of sides. We propose use these space continuous polygonal splines (piecewise defined functions) order $d$ partition consisting polygons which able reproduce all polynomials degree $d$. Locally supported basis for the are constructed $d\ge 2$. The construction $d=2$ simpler than "serendipity" quadratic finite elements have appeared in recent literature....

10.1137/15m101155x article EN SIAM Journal on Numerical Analysis 2016-01-01

We give many examples of bivariate nonseparable compactly supported orthonormal wavelets whose scaling functions are over [0,3]x[0,3]. The Holder continuity properties these studied.

10.1109/83.841541 article EN IEEE Transactions on Image Processing 2000-05-01

We consider the functional linear regression model where explanatory variable is a random surface and response real variable, in various situations both noise can be unbounded dependent. Bivariate splines over triangulations represent surfaces. use this representation to construct least squares estimators of function with penalisation term. Under assumptions that regressors sample span large enough space functions, bivariate approximation properties yield consistency estimators. Simulations...

10.1080/10485250903323180 article EN Journal of nonparametric statistics 2009-12-01

Macro-elements of arbitrary smoothness are constructed on Powell-Sabin triangle splits. These elements useful for solving boundary-value problems and interpolation Hermite data. It is shown that they optimal with respect to spline degree, we believe also the number degrees freedom. The construction provides local bases certain superspline spaces defined over refinements. be stable as a function smallest angle in triangulation, which turn implies associated have order approximation power.

10.1090/s0025-5718-01-01379-5 article EN Mathematics of Computation 2001-07-22

We study minimal energy interpolation and discrete penalized least squares approximation problems on the unit sphere using nonhomogeneous spherical splines. Several numerical experiments are conducted to compare approximating properties of homogeneous Our show that splines have certain advantages over

10.1137/040620722 article EN SIAM Journal on Scientific Computing 2006-01-01

10.1016/j.jat.2005.09.010 article EN publisher-specific-oa Journal of Approximation Theory 2005-11-16

Bivariate splines with various degrees are considered in this paper. A matrix form of the extended smoothness conditions for these is presented. Upon form, multivariate spline method numerical solution partial differential equations (PDEs) proposed by Awanou, Lai, and Wenston [The scattered data fitting solutions equations, Wavelets Splines, G. Chen M. J. eds., Nashboro Press, Brentwood, TN, 2006, pp. 24–76] generalized to obtain a new method. It observed that, combined prelocal refinement...

10.1137/060667207 article EN SIAM Journal on Scientific Computing 2007-01-01
Coming Soon ...