Related papers: Sparse Approximation to the Dirac-{\delta} Distrib…
We propose a general algorithm for approximating nonstandard Bayesian posterior distributions. The algorithm minimizes the Kullback-Leibler divergence of an approximating distribution to the intractable posterior distribution. Our method…
The Fast Fourier Transform (FFT) is an algorithm of paramount importance in signal processing as it allows to apply the Fourier transform in O(n log n) instead of O(n 2) arithmetic operations. Graph Signal Processing (GSP) is a recent…
In this paper, an evolutionary-based sparse regression algorithm is proposed and applied onto experimental data collected from a Duffing oscillator setup and numerical simulation data. Our purpose is to identify the Coulomb friction terms…
Fourier Ptychography (FP) is a recently proposed technique for large field of view and high resolution imaging. Specifically, FP captures a set of low resolution images under angularly varying illuminations and stitches them together in…
We propose a novel sparse sliced inverse regression method based on random projections in a large $p$ small $n$ setting. Embedded in a generalized eigenvalue framework, the proposed approach finally reduces to parallel execution of…
We propose a new fourth-order compact time-splitting ($S_\text{4c}$) Fourier pseudospectral method for the Dirac equation by splitting the Dirac equation into two parts together with using the double commutator between them to integrate the…
Deep representation learning has become one of the most widely adopted approaches for visual search, recommendation, and identification. Retrieval of such representations from a large database is however computationally challenging.…
The problem of off-grid direction-of-arrival (DOA) estimation is investigated. We develop a grid-based method to jointly estimate the closest spatial frequency (the sine of DOA) grids, and the gaps between the estimated grids and the…
We develop the uniform sparse Fast Fourier Transform (usFFT), an efficient, non-intrusive, adaptive algorithm for the solution of elliptic partial differential equations with random coefficients. The algorithm is an adaption of the sparse…
This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications which work with multiple signals maintaining some degree of dependency such as radar and sensor networks. In this paper, we…
Discrete delta functions define the limits of attainable spatial resolution for all imaging systems. Here we construct broad, multi-dimensional discrete functions that replicate closely the action of a Dirac delta function under aperiodic…
We propose a new algorithm for sparse spike estimation from Fourier measurements. Based on theoretical results on non-convex optimization techniques for off-the-grid sparse spike estimation, we present a projected gradient descent algorithm…
Diffusive representations of fractional derivatives have proven to be useful tools in the construction of fast and memory efficient numerical methods for solving fractional differential equations. A common challenge in many of the known…
(This paper was written in November 2011 and never published. It is posted on arXiv.org in its original form in June 2016). Many recent object recognition systems have proposed using a two phase training procedure to learn sparse…
Wireless OFDM channels can be approximated by a time varying filter with sparse time domain taps. Recent achievements in sparse signal processing such as compressed sensing have facilitated the use of sparsity in estimation, which improves…
We propose a method based on sinc series approximations for computing the Rayleigh-Sommerfeld and Fresnel diffraction integrals of optics. The diffraction integrals are given in terms of a convolution, and our proposed numerical approach is…
This work deals with directional of arrival (DOA) estimation with a large antenna array. We first develop a novel signal model with a sparse system transfer matrix using an inverse discrete Fourier transform (DFT) operation, which leads to…
Faraday tomography (or rotation measure synthesis) is a procedure to convert linear polarization spectra into the Faraday dispersion function, which provides us with unique information of magneto-ionic media along the line of sight.…
In this paper we propose an identification procedure of a sparse graphical model associated to a Gaussian stationary stochastic process. The identification paradigm exploits the approximation of autoregressive processes through reciprocal…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…