English
Related papers

Related papers: Dynamic Orthogonal Matching Pursuit for Sparse Dat…

200 papers

Random pulse repetition interval (PRI) waveform arouses great interests in the field of modern radars due to its ability to alleviate range and Doppler ambiguities as well as enhance electronic counter-countermeasures (ECCM) capabilities.…

Applications · Statistics 2018-10-15 Jieli Zhu , Tong Zhao , Tianyao Huang , Dengfeng Zhang

We have developed an approximate signal recovery algorithm with low computational cost for compressed sensing on the basis of randomly constructed sparse measurement matrices. The law of large numbers and the central limit theorem suggest…

Information Theory · Computer Science 2011-02-21 Yoshiyuki Kabashima , Tadashi Wadayama

Gradient inversion attacks reveal that private training text can be reconstructed from shared gradients, posing a privacy risk to large language models (LLMs). While prior methods perform well in small-batch settings, scaling to larger…

Machine Learning · Computer Science 2026-03-18 Yibo Li , Qiongxiu Li

In a recent paper, the authors proposed a new class of low-complexity iterative thresholding algorithms for reconstructing sparse signals from a small set of linear measurements \cite{DMM}. The new algorithms are broadly referred to as AMP,…

Information Theory · Computer Science 2009-11-24 David L. Donoho , Arian Maleki , Andrea Montanari

We introduce a theoretical approach for designing generalizations of the approximate message passing (AMP) algorithm for compressed sensing which are valid for large observation matrices that are drawn from an invariant random matrix…

Information Theory · Computer Science 2017-05-12 Burak Çakmak , Manfred Opper , Ole Winther , Bernard H. Fleury

Gradient-based learning imposes (deep) neural networks to be differentiable at all steps. This includes model-based architectures constructed by unrolling iterations of an iterative algorithm onto layers of a neural network, known as…

Machine Learning · Computer Science 2025-05-22 Sina Mohammad-Taheri , Matthew J. Colbrook , Simone Brugiapaglia

Remarkable properties of Compressed sensing (CS) has led researchers to utilize it in various other fields where a solution to an underdetermined system of linear equations is needed. One such application is in the area of array signal…

Information Theory · Computer Science 2018-01-26 Abhishek Aich , P. Palanisamy

With the growing prevalence of heterogeneous computing, CPUs are increasingly being paired with accelerators to achieve new levels of performance and energy efficiency. However, data movement between devices remains a significant…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-01-21 Luke Marzen , Junhyung Shim , Ali Jannesari

The dynamic mode decomposition (DMD) is a data-driven approach that extracts the dominant features from spatiotemporal data. In this work, we introduce sparse-mode DMD, a new variant of the optimized DMD framework that specifically…

Machine Learning · Statistics 2025-07-29 Sara M. Ichinaga , Steven L. Brunton , Aleksandr Y. Aravkin , J. Nathan Kutz

Mutual interference in automotive radar scenarios is going to become a major concern as the density of vehicles with radar sensors in the roads increases. The present work tackles the problem of frequency modulated continuous wave (FMCW) to…

Signal Processing · Electrical Eng. & Systems 2021-06-11 Aitor Correas-Serrano , María A. González-Huici

Hard thresholding pursuit (HTP) is a recently proposed iterative sparse recovery algorithm which is a result of combination of a support selection step from iterated hard thresholding (IHT) and an estimation step from the orthogonal…

Information Theory · Computer Science 2020-06-03 Samrat Mukhopadhyay , Mrityunjoy Chakraborty

Integrated Sensing and Communication (ISAC) is a technology paradigm that combines sensing capabilities with communication functionalities in a single device or system. In vehicle-to-everything (V2X) sidelink, ISAC can provide enhanced…

Signal Processing · Electrical Eng. & Systems 2024-11-06 Syed Najaf Haider Shah , Sebastian Semper , Aamir Ullah Khan , Christian Schneider , Joerg Robert

Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples.…

Numerical Analysis · Mathematics 2014-04-29 D. Needell , J. A. Tropp

Generalized orthogonal matching pursuit (gOMP), also called orthogonal multi-matching pursuit, is an extension of OMP in the sense that $N\geq1$ indices are identified per iteration. In this paper, we show that if the restricted isometry…

Information Theory · Computer Science 2016-12-20 Jinming Wen , Zhengchun Zhou , Dongfang Li , Xiaohu Tang

Compressive sensing is a technique to sample signals well below the Nyquist rate using linear measurement operators. In this paper we present an algorithm for signal reconstruction given such a set of measurements. This algorithm…

Information Theory · Computer Science 2009-06-08 Graeme Pope

Compressed Sensing aims to capture attributes of a sparse signal using very few measurements. Cand\`{e}s and Tao showed that sparse reconstruction is possible if the sensing matrix acts as a near isometry on all $\boldsymbol{k}$-sparse…

Information Theory · Computer Science 2009-10-18 Robert Calderbank , Stephen Howard , Sina Jafarpour

Orthogonal/vector approximate message-passing (AMP) is a powerful message-passing (MP) algorithm for signal reconstruction in compressed sensing. This paper proves the convergence of Bayes-optimal orthogonal/vector AMP in the large system…

Information Theory · Computer Science 2022-04-26 Keigo Takeuchi

Personalized cardiac diagnostics require accurate reconstruction of myocardial displacement fields from sparse clinical imaging data, yet current methods often demand intrusive access to computational models. In this work, we apply the…

In compressed sensing, we wish to reconstruct a sparse signal $x$ from observed data $y$. In sparse coding, on the other hand, we wish to find a representation of an observed signal $y$ as a sparse linear combination, with coefficients $x$,…

Computer Vision and Pattern Recognition · Computer Science 2013-11-25 Will Landecker , Rick Chartrand , Simon DeDeo

Ordinary differential equations (ODE) have been widely used for modeling dynamical complex systems. For high-dimensional ODE models where the number of differential equations is large, it remains challenging to estimate the ODE parameters…

Methodology · Statistics 2022-06-20 Muye Nanshan , Nan Zhang , Xiaolei Xun , Jiguo Cao
‹ Prev 1 8 9 10 Next ›