Related papers: Low-complexity Scaling Methods for DCT-II Approxim…
We study an estimator with a convex formulation for recovery of low-rank matrices from rank-one projections. Using initial estimates of the factors of the target $d_1\times d_2$ matrix of rank-$r$, the estimator admits a practical…
In this paper, we present modifications of the iterative hard thresholding (IHT) method for recovery of jointly row-sparse and low-rank matrices. In particular a Riemannian version of IHT is considered which significantly reduces…
This paper proposes a robust reduced-rank scheme for adaptive beamforming based on joint iterative optimization (JIO) of adaptive filters. The scheme provides an efficient way to deal with filters with large number of elements. It consists…
In a recent paper we presented a linear scaling Kohn-Sham density functional theory (DFT) code based on Daubechies wavelets, where a minimal set of localized support functions is optimized in situ and therefore adapted to the chemical…
Reconstruction in limited-angle digital breast tomosynthesis (DBT) suffers from slow convergence of low spatial-frequency components when using weighted data-fidelity terms within primal-dual optimization. We introduce a two-channel…
We consider a class of difference-of-convex (DC) optimization problems where the objective function is the sum of a smooth function and a possible nonsmooth DC function. The application of proximal DC algorithms to address this problem…
We introduce a structured low rank matrix completion algorithm to recover a series of images from their under-sampled measurements, where the signal along the parameter dimension at every pixel is described by a linear combination of…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
In this paper, we consider the integrating factor midpoint method for wave-type equations and derive optimal order a posteriori error estimates. We first introduce an integrating factor midpoint approximation defined by the piecewise linear…
Robust methods have been a successful approach to deal with contaminations and noises in image processing. In this paper, we introduce a new robust method for two-dimensional autoregressive models. Our method, called BMM-2D, relies on…
We address the channel estimation (CE) problem in reconfigurable intelligent surface (RIS) aided orthogonal frequency-division multiplexing (OFDM) systems by proposing a dual-structure and multi-dimensional transformations (DS-MDT)…
We introduce compositional tensor trains (CTTs) for the approximation of multivariate functions, a class of models obtained by composing low-rank functions in the tensor-train format. This format can encode standard approximation tools,…
In this paper, we propose a method to approximate the Gaussian function on ${\mathbb R}$ by a short cosine sum. We generalise and extend the differential approximation method proposed in [4, 40] to approximate $\mathrm{e}^{-t^{2}/2\sigma}$…
Two algorithms are introduced for the computation of discrete integral transforms with a multiscale approach operating in discrete three-dimensional (3D) volumes while considering its real-time implementation. The first algorithm, referred…
This paper deals with tactics for fast computation in least squares regression in high dimensions. These tactics include: (a) the majorization-minimization (MM) principle, (b) smoothing by Moreau envelopes, and (c) the proximal distance…
We propose an intra frame predictive strategy for compression of 3D point cloud attributes. Our approach is integrated with the region adaptive graph Fourier transform (RAGFT), a multi-resolution transform formed by a composition of…
Micromagnetics simulations require accurate approximation of the magnetization dynamics described by the Landau-Lifshitz-Gilbert equation, which is nonlinear, nonlocal, and has a non-convex constraint, posing interesting challenges in…
Accurate direction of arrival (DoA) and time of arrival (ToA) estimation is an stringent requirement for several wireless systems like sonar, radar, communications, and dual-function radar communication (DFRC). Due to the use of high…
Collocation boundary element methods for integral equations are easier to implement than Galerkin methods because the elements of the discretization matrix are given by lower-dimensional integrals. For that same reason, the matrix assembly…
Solving dual quaternion equations is an important issue in many fields such as scientific computing and engineering applications. In this paper, we first introduce a new metric function for dual quaternion matrices. Then, we reformulate…