中文
相关论文

相关论文: Orthogonal symmetric Toeplitz matrices for compres…

200 篇论文

This paper introduces a new framework of fast and efficient sensing matrices for practical compressive sensing, called Structurally Random Matrix (SRM). In the proposed framework, we pre-randomize a sensing signal by scrambling its samples…

信息论 · 计算机科学 2015-05-28 Thong T. Do , Lu Gan , Nam H. Nguyen , Trac D. Tran

Compressed sensing is a signal processing method that acquires data directly in a compressed form. This allows one to make less measurements than what was considered necessary to record a signal, enabling faster or more precise measurement…

统计力学 · 物理学 2012-08-20 Florent Krzakala , Marc Mézard , François Sausset , Yifan Sun , Lenka Zdeborová

Sign truncated matching pursuit (STrMP) algorithm is presented in this paper. STrMP is a new greedy algorithm for the recovery of sparse signals from the sign measurement, which combines the principle of consistent reconstruction with…

信息论 · 计算机科学 2013-12-13 Wenhui Liu , Da Gong , Zhiqiang Xu

Spectral compressed sensing involves reconstructing a spectral-sparse signal from a subset of uniformly spaced samples, with applications in radar imaging and wireless channel estimation. By fully exploiting the signal structures, this…

最优化与控制 · 数学 2025-11-25 Wenlong Wang , Wen Huang , Zai Yang

A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many…

信息论 · 计算机科学 2010-04-13 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner , Andrew Thompson

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…

信息论 · 计算机科学 2017-05-12 Burak Çakmak , Manfred Opper , Ole Winther , Bernard H. Fleury

Optimal transport (OT) is a versatile framework for comparing probability measures, with many applications to statistics, machine learning, and applied mathematics. However, OT distances suffer from computational and statistical scalability…

统计理论 · 数学 2022-06-08 Ziv Goldfeld , Kengo Kato , Gabriel Rioux , Ritwik Sadhu

Dimension reduction plays an essential role when decreasing the complexity of solving large-scale problems. The well-known Johnson-Lindenstrauss (JL) Lemma and Restricted Isometry Property (RIP) admit the use of random projection to reduce…

信息论 · 计算机科学 2018-03-14 Gen Li , Yuantao Gu

A sufficient condition reported very recently for perfect recovery of a K-sparse vector via orthogonal matching pursuit (OMP) in K iterations is that the restricted isometry constant of the sensing matrix satisfies…

信息论 · 计算机科学 2014-01-06 Ling-Hua Chang , Jwo-Yuh Wu

A structured random matrix ensemble that maintains constant modulus entries and unit-norm columns, often called a random phase-rotated (RPR) matrix, is considered in this paper. We analyze the coherence statistics of RPR measurement…

信号处理 · 电气工程与系统科学 2019-10-23 Qiyou Duan , Taejoon Kim , Lin Dai , Erik Perrins

An intriguing phenomenon in many instances of compressed sensing is that the reconstruction quality is governed not just by the overall sparsity of the signal, but also on its structure. This paper is about understanding this phenomenon,…

泛函分析 · 数学 2014-03-28 Ben Adcock , Anders C. Hansen , Bogdan Roman

This paper demonstrates that if the restricted isometry constant $\delta_{K+1}$ of the measurement matrix $A$ satisfies $$ \delta_{K+1} < \frac{1}{\sqrt{K}+1}, $$ then a greedy algorithm called Orthogonal Matching Pursuit (OMP) can recover…

信息论 · 计算机科学 2012-01-16 Qun Mo , Yi Shen

Direction of Arrival (DOA) estimation of mixed uncorrelated and coherent sources is a long existing challenge in array signal processing. Application of compressive sensing to array signal processing has opened up an exciting class of…

信号处理 · 电气工程与系统科学 2018-09-10 Abhishek Aich , P. Palanisamy

Orthogonal matching pursuit~(OMP) is a commonly used greedy algorithm for recovering sparse signals from compressed measurements. In this paper, we introduce a variant of the OMP algorithm to reduce the complexity of reconstructing a class…

信号处理 · 电气工程与系统科学 2025-11-25 Xinwei Zhao , Jinming Wen , Hongqi Yang , Xiao Ma

Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. This paper studies a $K \times N$ partial Fourier measurement matrix for compressed sensing which is deterministically…

信息论 · 计算机科学 2010-12-30 Nam Yul Yu

Compressed sensing is a technique for recovering a high-dimensional signal from lower-dimensional data, whose components represent partial information about the signal, utilizing prior knowledge on the sparsity of the signal. For further…

信息论 · 计算机科学 2014-02-18 Yingying Xu , Yoshiyuki Kabashima

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…

信息论 · 计算机科学 2011-02-21 Yoshiyuki Kabashima , Tadashi Wadayama

In this work, we analyze modulated sampling schemes, such as the Nyquist Folding Receiver, which are highly efficient, readily implementable, non-uniform sampling schemes that allows for the blind estimation of a narrow-band signal's…

信息论 · 计算机科学 2012-08-01 Ray Maleh , Gerald L. Fudge

Optical Deflectometric Tomography (ODT) provides an accurate characterization of transparent materials whose complex surfaces present a real challenge for manufacture and control. In ODT, the refractive index map (RIM) of a transparent…

计算机视觉与模式识别 · 计算机科学 2013-10-31 Adriana Gonzalez , Laurent Jacques , Christophe De Vleeschouwer , Philippe Antoine

Compressed sensing is designed to measure sparse signals directly in a compressed form. However, most signals of interest are only "approximately sparse", i.e. even though the signal contains only a small fraction of relevant (large)…

信息论 · 计算机科学 2013-04-04 Jean Barbier , Florent Krzakala , Marc Mézard , Lenka Zdeborová