Related papers: QCMC: Quasi-conformal Parameterizations for Multip…
We study the conformal type of surfaces spread over the sphere via random quasiconformal maps. Constructing a random Beltrami coefficient on the complex plane, we obtain a locally quasiconformal homeomorphism with prescribed dilatation that…
In this research, a novel adaptive filtering algorithm is proposed for complex domain signal processing. The proposed algorithm is based on Wirtinger calculus and is called as q-Complex Least Mean Square (q-CLMS) algorithm. The proposed…
We present a unified theoretical and computational framework that bridges mathematical quasiperiodicity with classical crystallographic models. Based on a rigorous cut-and-projection construction, the proposed proximal coincidence point set…
We look for minimal conditions on a two-dimensional metric surface $X$ of locally finite Hausdorff $2$-measure under which $X$ admits an (almost) parametrization with good geometric and analytic properties. Only assuming that $X$ is locally…
Construction of spline surfaces from given boundary curves is one of the classical problems in computer aided geometric design, which regains much attention in isogeometric analysis in recent years and is called domain parameterization.…
We introduce a new convex optimization problem, termed quadratic decomposable submodular function minimization (QDSFM), which allows to model a number of learning tasks on graphs and hypergraphs. The problem exhibits close ties to…
Relying on paired synthetic data, existing learning-based Computational Aberration Correction (CAC) methods are confronted with the intricate and multifaceted synthetic-to-real domain gap, which leads to suboptimal performance in real-world…
Monte Carlo (MC) integration has been employed as the standard approximation method for the Sliced Wasserstein (SW) distance, whose analytical expression involves an intractable expectation. However, MC integration is not optimal in terms…
Teichm\"uller's classical mapping problem for plane domains concerns finding a lower bound for the maximal dilatation of a quasiconformal homeomorphism which holds the boundary pointwise fixed, maps the domain onto itself, and maps a given…
The increasing complexity and scale of photonic and electromagnetic devices demand efficient and accurate numerical solvers. In this work, we develop a parallel overlapping domain decomposition method (DDM) based on the finite-difference…
Quantum Monte Carlo (QMC) is an advanced simulation methodology for studies of manybody quantum systems. In this review, we focus on the electronic structure QMC, i.e., methods relevant for systems described by the electron-ion…
In this paper, we present new quasi-interpolating spline schemes defined on 3D bounded domains, based on trivariate $C^2$ quartic box splines on type-6 tetrahedral partitions and with approximation order four. Such methods can be used for…
Bayesian inverse problems highly rely on efficient and effective inference methods for uncertainty quantification (UQ). Infinite-dimensional MCMC algorithms, directly defined on function spaces, are robust under refinement of physical…
In mixed domain semi-supervised medical image segmentation (MiDSS), achieving superior performance under domain shift and limited annotations is challenging. This scenario presents two primary issues: (1) distributional differences between…
We present a survey of the many and various elements of the modern higher-dimensional theory of quasiconformal mappings and their wide and varied application. It is unified (and limited) by the theme of the author's interests. Thus we will…
Connected Submodular Maximization (CSM) is a graph problem with important applications to wireless network deployment, path planning, epidemic outbreaks, and cancer genome studies. In CSM, we are given a graph $G$, a non-negative monotone…
Perspective distortion (PD) leads to substantial alterations in the shape, size, orientation, angles, and spatial relationships of visual elements in images. Accurately determining camera intrinsic and extrinsic parameters is challenging,…
Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and…
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…
Subdivision surfaces provide an elegant isogeometric analysis framework for geometric design and analysis of partial differential equations defined on surfaces. They are already a standard in high-end computer animation and graphics and are…