oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing  [PDF]
Yaser Eftekhari,Anoosheh Heidarzadeh,Amir H. Banihashemi,Ioannis Lambadaris
Mathematics , 2011,
Abstract: In this paper, we present a new approach for the analysis of iterative node-based verification-based (NB-VB) recovery algorithms in the context of compressive sensing. These algorithms are particularly interesting due to their low complexity (linear in the signal dimension $n$). The asymptotic analysis predicts the fraction of unverified signal elements at each iteration $\ell$ in the asymptotic regime where $n \rightarrow \infty$. The analysis is similar in nature to the well-known density evolution technique commonly used to analyze iterative decoding algorithms. To perform the analysis, a message-passing interpretation of NB-VB algorithms is provided. This interpretation lacks the extrinsic nature of standard message-passing algorithms to which density evolution is usually applied. This requires a number of non-trivial modifications in the analysis. The analysis tracks the average performance of the recovery algorithms over the ensembles of input signals and sensing matrices as a function of $\ell$. Concentration results are devised to demonstrate that the performance of the recovery algorithms applied to any choice of the input signal over any realization of the sensing matrix follows the deterministic results of the analysis closely. Simulation results are also provided which demonstrate that the proposed asymptotic analysis matches the performance of recovery algorithms for large but finite values of $n$. Compared to the existing technique for the analysis of NB-VB algorithms, which is based on numerically solving a large system of coupled differential equations, the proposed method is much simpler and more accurate.
Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing  [PDF]
Yaser Eftekhari,Amir H. Banihashemi,Ioannis Lambadaris
Mathematics , 2012,
Abstract: In this paper, we present a probabilistic analysis of iterative node-based verification-based (NB-VB) recovery algorithms over irregular graphs in the context of compressed sensing. Verification-based algorithms are particularly interesting due to their low complexity (linear in the signal dimension $n$). The analysis predicts the average fraction of unverified signal elements at each iteration $\ell$ where the average is taken over the ensembles of input signals and sensing matrices. The analysis is asymptotic ($n \rightarrow \infty$) and is similar in nature to the well-known density evolution technique commonly used to analyze iterative decoding algorithms. Compared to the existing technique for the analysis of NB-VB algorithms, which is based on numerically solving a large system of coupled differential equations, the proposed method is much simpler and more accurate. This allows us to design irregular sensing graphs for such recovery algorithms. The designed irregular graphs outperform the corresponding regular graphs substantially. For example, for the same recovery complexity per iteration, we design irregular graphs that can recover up to about 40% more non-zero signal elements compared to the regular graphs. Simulation results are also provided which demonstrate that the proposed asymptotic analysis matches the performance of recovery algorithms for large but finite values of $n$.
An Efficient Approach Toward the Asymptotic Analysis of Node-Based Recovery Algorithms in Compressed Sensing  [PDF]
Yaser Eftekhari,Amir H. Banihashemi,Ioannis Lambadaris
Mathematics , 2010,
Abstract: In this paper, we propose a general framework for the asymptotic analysis of node-based verification-based algorithms. In our analysis we tend the signal length $n$ to infinity. We also let the number of non-zero elements of the signal $k$ scale linearly with $n$. Using the proposed framework, we study the asymptotic behavior of the recovery algorithms over random sparse matrices (graphs) in the context of compressive sensing. Our analysis shows that there exists a success threshold on the density ratio $k/n$, before which the recovery algorithms are successful, and beyond which they fail. This threshold is a function of both the graph and the recovery algorithm. We also demonstrate that there is a good agreement between the asymptotic behavior of recovery algorithms and finite length simulations for moderately large values of $n$.
Model-Based Compressive Sensing  [PDF]
Richard G. Baraniuk,Volkan Cevher,Marco F. Duarte,Chinmay Hegde
Mathematics , 2008,
Abstract: Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for the acquisition of sparse or compressible signals that can be well approximated by just K << N elements from an N-dimensional basis. Instead of taking periodic samples, CS measures inner products with M < N random vectors and then recovers the signal via a sparsity-seeking optimization or greedy algorithm. Standard CS dictates that robust signal recovery is possible from M = O(K log(N/K)) measurements. It is possible to substantially decrease M without sacrificing robustness by leveraging more realistic signal models that go beyond simple sparsity and compressibility by including structural dependencies between the values and locations of the signal coefficients. This paper introduces a model-based CS theory that parallels the conventional theory and provides concrete guidelines on how to create model-based recovery algorithms with provable performance guarantees. A highlight is the introduction of a new class of structured compressible signals along with a new sufficient condition for robust structured compressible signal recovery that we dub the restricted amplification property, which is the natural counterpart to the restricted isometry property of conventional CS. Two examples integrate two relevant signal models - wavelet trees and block sparsity - into two state-of-the-art CS recovery algorithms and prove that they offer robust recovery from just M=O(K) measurements. Extensive numerical simulations demonstrate the validity and applicability of our new theory and algorithms.
Compressive sensing based beamforming for noisy measurements  [PDF]
Siyang Zhong,Xun Huang
Computer Science , 2013,
Abstract: Compressive sensing is the newly emerging method in information technology that could impact array beamforming and the associated engineering applications. However, practical measurements are inevitably polluted by noise from external interference and internal acquisition process. Then, compressive sensing based beamforming was studied in this work for those noisy measurements with a signal-to-noise ratio. In this article, we firstly introduced the fundamentals of compressive sensing theory. After that, we implemented two algorithms (CSB-I and CSB-II). Both algorithms are proposed for those presumably spatially sparse and incoherent signals. The two algorithms were examined using a simple simulation case and a practical aeroacoustic test case. The simulation case clearly shows that the CSB-I algorithm is quite sensitive to the sensing noise. The CSB-II algorithm, on the other hand, is more robust to noisy measurements. The results by CSB-II at $\mathrm{SNR}=-10\,$dB are still reasonable with good resolution and sidelobe rejection. Therefore, compressive sensing beamforming can be considered as a promising array signal beamforming method for those measurements with inevitably noisy interference.
Measurement Matrix Design for Compressive Sensing Based MIMO Radar  [PDF]
Y. Yu,A. P. Petropulu,H. V. Poor
Mathematics , 2011, DOI: 10.1109/TSP.2011.2162328
Abstract: In colocated multiple-input multiple-output (MIMO) radar using compressive sensing (CS), a receive node compresses its received signal via a linear transformation, referred to as measurement matrix. The samples are subsequently forwarded to a fusion center, where an L1-optimization problem is formulated and solved for target information. CS-based MIMO radar exploits the target sparsity in the angle-Doppler-range space and thus achieves the high localization performance of traditional MIMO radar but with many fewer measurements. The measurement matrix is vital for CS recovery performance. This paper considers the design of measurement matrices that achieve an optimality criterion that depends on the coherence of the sensing matrix (CSM) and/or signal-to-interference ratio (SIR). The first approach minimizes a performance penalty that is a linear combination of CSM and the inverse SIR. The second one imposes a structure on the measurement matrix and determines the parameters involved so that the SIR is enhanced. Depending on the transmit waveforms, the second approach can significantly improve SIR, while maintaining CSM comparable to that of the Gaussian random measurement matrix (GRMM). Simulations indicate that the proposed measurement matrices can improve detection accuracy as compared to a GRMM.
Compressive sensing based velocity estimation in video data  [PDF]
Ana Miletic,Nemanja Ivanovic
Computer Science , 2015,
Abstract: This paper considers the use of compressive sensing based algorithms for velocity estimation of moving vehicles. The procedure is based on sparse reconstruction algorithms combined with time-frequency analysis applied to video data. This algorithm provides an accurate estimation of object's velocity even in the case of a very reduced number of available video frames. The influence of crucial parameters is analysed for different types of moving vehicles.
Approximation Algorithms for Model-Based Compressive Sensing  [PDF]
Chinmay Hegde,Piotr Indyk,Ludwig Schmidt
Computer Science , 2014,
Abstract: Compressive Sensing (CS) stipulates that a sparse signal can be recovered from a small number of linear measurements, and that this recovery can be performed efficiently in polynomial time. The framework of model-based compressive sensing (model-CS) leverages additional structure in the signal and prescribes new recovery schemes that can reduce the number of measurements even further. However, model-CS requires an algorithm that solves the model-projection problem: given a query signal, produce the signal in the model that is also closest to the query signal. Often, this optimization can be computationally very expensive. Moreover, an approximation algorithm is not sufficient for this optimization task. As a result, the model-projection problem poses a fundamental obstacle for extending model-CS to many interesting models. In this paper, we introduce a new framework that we call approximation-tolerant model-based compressive sensing. This framework includes a range of algorithms for sparse recovery that require only approximate solutions for the model-projection problem. In essence, our work removes the aforementioned obstacle to model-based compressive sensing, thereby extending the applicability of model-CS to a much wider class of models. We instantiate this new framework for the Constrained Earth Mover Distance (CEMD) model, which is particularly useful for signal ensembles where the positions of the nonzero coefficients do not change significantly as a function of spatial (or temporal) location. We develop novel approximation algorithms for both the maximization and the minimization versions of the model-projection problem via graph optimization techniques. Leveraging these algorithms into our framework results in a nearly sample-optimal sparse recovery scheme for the CEMD model.
基于压缩感知的非重构频谱感知算法研究
Non-reconstruction spectrum sensing algorithm based on compressive sensing
 [PDF]

宋雅鑫,齐丽娜
- , 2018,
Abstract: 为了减小信号重构下频谱感知算法的计算复杂度和恢复频谱准确性对判决结果的影响,提出了基于压缩感知的非重构单节点频谱感知算法。在单节点频谱感知中,首先将信道划分成信道组,以降低采样协方差矩阵的计算复杂度;然后求得采样协方差矩阵对角线上的值并进行去噪,以提高检测性能。为了解决单节点频谱感知可能存在深度衰落和终端隐藏的问题,提出了多节点协作频谱感知并进行了系统仿真与分析。仿真结果表明,非重构单节点和多节点协作频谱感知算法都能够有效地检测出频谱空洞,并且多节点协作频谱感知检测的准确度更高。
A non reconstruction spectrum sensing algorithm for single node based on compressive sensing (CS) is proposed to reduce the computational complexity on the reconstruction and the influence of spectrum reconstruction accuracy on the decision result.In single node spectrum sensing algorithm,the channels are firstly divided into channel groups to reduce the computational complexity of the sample covariance matrix.Then,the diagonal values of the sample covariance matrix are obtained,and detection performance is further improved by a de noising algorithm.To solve the problems of the degraded detection performance,and deep fading channels and hidden terminals for single node spectrum sensing,multi node cooperative spectrum sensing is proposed,and the simulation and the analysis of the system are carried out.The simulation results show that the two non reconstruction spectrum sensing algorithms for both single node and cooperative multi node can effectively detect the spectrum holes and the detection accuracy of multi node cooperative spectrum sensing is higher
Total Variation Minimization Based Compressive Wideband Spectrum Sensing for Cognitive Radios  [PDF]
Yipeng Liu,Qun Wan
Mathematics , 2011,
Abstract: Wideband spectrum sensing is a critical component of a functioning cognitive radio system. Its major challenge is the too high sampling rate requirement. Compressive sensing (CS) promises to be able to deal with it. Nearly all the current CS based compressive wideband spectrum sensing methods exploit only the frequency sparsity to perform. Motivated by the achievement of a fast and robust detection of the wideband spectrum change, total variation mnimization is incorporated to exploit the temporal and frequency structure information to enhance the sparse level. As a sparser vector is obtained, the spectrum sensing period would be shorten and sensing accuracy would be enhanced. Both theoretical evaluation and numerical experiments can demonstrate the performance improvement.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.