English
Related papers

Related papers: A Novel Sufficient Condition for Generalized Ortho…

200 papers

A greedy pursuit strategy which finds a common basis for approximating a set of similar signals is proposed. The strategy extends the Optimized Orthogonal Matching Pursuit approach to selecting the subspace containing the approximation of…

Signal Processing · Electrical Eng. & Systems 2025-03-24 Laura Rebollo-Neira

This paper considers theoretical analysis of recovering a low rank matrix given a few expansion coefficients with respect to any basis. The current approach generalizes the existing analysis for the low-rank matrix completion problem with…

Information Theory · Computer Science 2018-12-17 Abiy Tasissa , Rongjie Lai

Compressed Sensing aims to capture attributes of $k$-sparse signals using very few measurements. In the standard Compressed Sensing paradigm, the $\m\times \n$ measurement matrix $\A$ is required to act as a near isometry on the set of all…

Information Theory · Computer Science 2015-05-14 Robert Calderbank , Stephen Howard , Sina Jafarpour

A greedy algorithm called Bayesian multiple matching pursuit (BMMP) is proposed to estimate a sparse signal vector and its support given $m$ linear measurements. Unlike the maximum a posteriori (MAP) support detection, which was proposed by…

Information Theory · Computer Science 2019-04-04 Kyung-Su Kim , Sae-Young Chung

The restricted isometry property (RIP) is essential for the linear map to guarantee the successful recovery of low-rank matrices. The existing works show that the linear map generated by the measurement matrices with independent and…

Information Theory · Computer Science 2024-05-08 Wei Zhang , Zhenni Wang

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…

Information Theory · Computer Science 2010-04-13 Jeffrey D. Blanchard , Coralia Cartis , Jared Tanner , Andrew Thompson

In this paper, we propose an algorithm referred to as multipath matching pursuit that investigates multiple promising candidates to recover sparse signals from compressed measurements. Our method is inspired by the fact that the problem to…

Information Theory · Computer Science 2014-03-11 Suhyuk , Kwon , Jian Wang , Byonghyo Shim

This paper proposes two novel schemes of wideband compressive spectrum sensing (CSS) via block orthogonal matching pursuit (BOMP) algorithm, for achieving high sensing accuracy in real time. These schemes aim to reliably recover the…

Signal Processing · Electrical Eng. & Systems 2023-04-14 Liyang Lu , Wenbo Xu , Yue Wang , Zhi Tian

Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant dictionaries as…

Information Theory · Computer Science 2015-05-30 Albert Fannjiang , Wenjing Liao

While Multi-Object Tracking (MOT) has made substantial advancements, it is limited by heavy reliance on prior knowledge and limited to predefined categories. In contrast, Generic Multiple Object Tracking (GMOT), tracking multiple objects…

Computer Vision and Pattern Recognition · Computer Science 2024-09-05 Duy Le Dinh Anh , Kim Hoang Tran , Ngan Hoang Le

Accurate parameter estimation such as angle of arrival (AOA) is essential to enhance the performance of integrated sensing and communication (ISAC) in mmWave multiple-input multiple-output (MIMO) systems. This work presents a sensing-aided…

Information Theory · Computer Science 2025-03-05 Ngoc-Son Duong , Khac-Hoang Ngo , Thai-Mai Dinh , Van-Linh Nguyen

When the linear measurements of an instance of low-rank matrix recovery satisfy a restricted isometry property (RIP)---i.e. they are approximately norm-preserving---the problem is known to contain no spurious local minima, so exact recovery…

Machine Learning · Computer Science 2018-11-01 Richard Y. Zhang , Cédric Josz , Somayeh Sojoudi , Javad Lavaei

We propose a novel greedy algorithm for the support recovery of a sparse signal from a small number of noisy measurements. In the proposed method, a new support index is identified for each iteration based on bit-wise maximum a posteriori…

Information Theory · Computer Science 2019-10-29 J. Chae , S. -N. Hong

Applications of compressed sensing motivate the possibility of using different operators to encode and decode a signal of interest. Since it is clear that the operators cannot be too different, we can view the discrepancy between the two…

Numerical Analysis · Mathematics 2010-04-02 Matthew A. Herman , Deanna Needell

This paper establishes a sharp condition on the restricted isometry property (RIP) for both the sparse signal recovery and low-rank matrix recovery. It is shown that if the measurement matrix $A$ satisfies the RIP condition…

Information Theory · Computer Science 2013-02-07 T. Tony Cai , Anru Zhang

Group synchronization refers to estimating a collection of group elements from the noisy pairwise measurements. Such a nonconvex problem has received much attention from numerous scientific fields including computer vision, robotics, and…

Optimization and Control · Mathematics 2021-12-14 Linglingzhi Zhu , Jinxin Wang , Anthony Man-Cho So

A novel sparse array synthesis method for non-uniform planar arrays is proposed, which belongs to compressive sensing (CS)-based systhesis. Particularly, we propose an off-grid refinement technique to simultaneously optimize the antenna…

Signal Processing · Electrical Eng. & Systems 2022-07-29 Songjie Yang , Baojuan Liu , Zhiqin Hong , Zhongpei Zhang

A reliable support detection is essential for a greedy algorithm to reconstruct a sparse signal accurately from compressed and noisy measurements. This paper proposes a novel support detection method for greedy algorithms, which is referred…

Information Theory · Computer Science 2016-08-24 Namyoon Lee

This paper addresses the reconstruction of sparse signals from generalized linear measurements. Signal sparsity is assumed to be sublinear in the signal dimension while it was proportional to the signal dimension in conventional research.…

Information Theory · Computer Science 2026-04-13 Keigo Takeuchi

Hyperspectral Imaging (HSI) is used in a wide range of applications such as remote sensing, yet the transmission of the HS images by communication data links becomes challenging due to the large number of spectral bands that the HS images…

Computer Vision and Pattern Recognition · Computer Science 2024-01-29 Jon Alvarez Justo , Milica Orlandic