scholarly journals An analog hardware solution for compressive sensing reconstruction using gradient-based method

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Irena Orović ◽  
Nedjeljko Lekić ◽  
Marko Beko ◽  
Srdjan Stanković
Keyword(s):  
Compressive Sensing ◽  
Signal Reconstruction ◽  
Optimal Choice ◽  
Sparse Signals ◽  
Reconstruction Algorithms ◽  
Hardware Implementations ◽  
Nested Iterations ◽  
Gradient Based ◽  
Analog Implementation ◽  
Lower Complexity

AbstractThis work proposes an analog implementation of gradient-based algorithm for compressive sensing signal reconstruction. Compressive sensing has appeared as a promising technique for efficient acquisition and reconstruction of sparse signals in many real-world applications. It starts from the assumption that sparse signals can be exactly reconstructed using far less samples than in standard signal processing. In this paper, we consider the gradient-based algorithm as the optimal choice that provides lower complexity and competitive accuracy compared with existing methods. Since the efficient hardware implementations of reconstruction algorithms are still an emerging topic, this work is focused on the design of hardware that will provide fast parallel algorithm execution for real-time applications, overcoming the limitations imposed by the large number of nested iterations during the signal reconstruction. The proposed implementation is simple and fast, executing 400 iterations in 1 ms which is sufficient to obtain highly accurate reconstruction results.

scholarly journals On a Gradient-Based Algorithm for Sparse Signal Reconstruction in the Signal/Measurements Domain

2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Ljubiša Stanković ◽  
Miloš Daković
Keyword(s):  
Compressive Sensing ◽  
Statistical Study ◽  
Signal Reconstruction ◽  
Sparse Signals ◽  
Step Size ◽  
Gradient Algorithms ◽  
Gradient Based ◽  
Complete Set ◽  
The Time Domain ◽  
Adaptive Step

Sparse signals can be recovered from a reduced set of samples by using compressive sensing algorithms. In common compressive sensing methods the signal is recovered in the sparsity domain. A method for the reconstruction of sparse signals which reconstructs the missing/unavailable samples/measurements is recently proposed. This method can be efficiently used in signal processing applications where a complete set of signal samples exists. The missing samples are considered as the minimization variables, while the available samples are fixed. Reconstruction of the unavailable signal samples/measurements is preformed using a gradient-based algorithm in the time domain, with an adaptive step. Performance of this algorithm with respect to the step-size and convergence are analyzed and a criterion for the step-size adaptation is proposed in this paper. The step adaptation is based on the gradient direction angles. Illustrative examples and statistical study are presented. Computational efficiency of this algorithm is compared with other two commonly used gradient algorithms that reconstruct signal in the sparsity domain. Uniqueness of the recovered signal is checked using a recently introduced theorem. The algorithm application to the reconstruction of highly corrupted images is presented as well.

scholarly journals Noises in randomly sampled sparse signals

2014 ◽  
Vol 27 (3) ◽  
pp. 359-373 ◽  
Author(s):  
Ljubisa Stankovic
Keyword(s):  
Compressive Sensing ◽  
Random Sampling ◽  
Domain Analysis ◽  
External Noise ◽  
Sampling Theorem ◽  
Sparse Signals ◽  
Gradient Based

Sparse signals can be recovered from a reduced set of randomly positioned samples by using compressive sensing algorithms. Two main reconstruction directions are in the sparse transformation domain analysis of signals and the gradient based algorithms. In the transformation domain analysis, that will be considered here, the estimation of nonzero signal coefficients is based on the signal transform calculated using available samples only. The missing samples manifest themselves as a noise. This kind of noise is analyzed in the case of random sampling, when the sampling instants do not coincide with the sampling theorem instants. Analysis of the external noise influence to the results, with randomly sampled sparse signals, is done as well. Theory is illustrated and checked on statistical examples.

scholarly journals Fractional Differential Equation-Based Instantaneous Frequency Estimation for Signal Reconstruction

2021 ◽  
Vol 5 (3) ◽  
pp. 83
Author(s):  
Bilgi Görkem Yazgaç ◽  
Mürvet Kırcı
Keyword(s):  
Differential Equation ◽  
Fractional Differential Equation ◽  
Frequency Estimation ◽  
Signal Reconstruction ◽  
Reconstruction Method ◽  
Reconstruction Algorithms ◽  
Instantaneous Frequency Estimation ◽  
Proposed Model ◽  
Fractional Differential ◽  
Instantaneous Frequencies

In this paper, we propose a fractional differential equation (FDE)-based approach for the estimation of instantaneous frequencies for windowed signals as a part of signal reconstruction. This approach is based on modeling bandpass filter results around the peaks of a windowed signal as fractional differential equations and linking differ-integrator parameters, thereby determining the long-range dependence on estimated instantaneous frequencies. We investigated the performance of the proposed approach with two evaluation measures and compared it to a benchmark noniterative signal reconstruction method (SPSI). The comparison was provided with different overlap parameters to investigate the performance of the proposed model concerning resolution. An additional comparison was provided by applying the proposed method and benchmark method outputs to iterative signal reconstruction algorithms. The proposed FDE method received better evaluation results in high resolution for the noniterative case and comparable results with SPSI with an increasing iteration number of iterative methods, regardless of the overlap parameter.

scholarly journals Compressive Sensing in Signal Processing: Algorithms and Transform Domain Formulations

2016 ◽  
Vol 2016 ◽  
pp. 1-16 ◽  
Author(s):  
Irena Orović ◽  
Vladan Papić ◽  
Cornel Ioana ◽  
Xiumei Li ◽  
Srdjan Stanković
Keyword(s):  
Signal Processing ◽  
Fourier Transform ◽  
Compressive Sensing ◽  
Signal Reconstruction ◽  
Signal Acquisition ◽  
Transform Domain ◽  
Hermite Transform ◽  
Time Frequency ◽  
Reconstruction Methods ◽  
Fourier Transform Domain

Compressive sensing has emerged as an area that opens new perspectives in signal acquisition and processing. It appears as an alternative to the traditional sampling theory, endeavoring to reduce the required number of samples for successful signal reconstruction. In practice, compressive sensing aims to provide saving in sensing resources, transmission, and storage capacities and to facilitate signal processing in the circumstances when certain data are unavailable. To that end, compressive sensing relies on the mathematical algorithms solving the problem of data reconstruction from a greatly reduced number of measurements by exploring the properties of sparsity and incoherence. Therefore, this concept includes the optimization procedures aiming to provide the sparsest solution in a suitable representation domain. This work, therefore, offers a survey of the compressive sensing idea and prerequisites, together with the commonly used reconstruction methods. Moreover, the compressive sensing problem formulation is considered in signal processing applications assuming some of the commonly used transformation domains, namely, the Fourier transform domain, the polynomial Fourier transform domain, Hermite transform domain, and combined time-frequency domain.

Bayesian feature learning for seismic compressive sensing and denoising

Geophysics ◽  
2017 ◽  
Vol 82 (6) ◽  
pp. O91-O104 ◽  
Author(s):  
Georgios Pilikos ◽  
A. C. Faul
Keyword(s):  
Compressive Sensing ◽  
State Of The Art ◽  
Feature Learning ◽  
Seismic Signal ◽  
Basis Functions ◽  
Sparse Signals ◽  
Seismic Signals ◽  
Process Factor ◽  
Learned Features ◽  
Fixed Basis

Extracting the maximum possible information from the available measurements is a challenging task but is required when sensing seismic signals in inaccessible locations. Compressive sensing (CS) is a framework that allows reconstruction of sparse signals from fewer measurements than conventional sampling rates. In seismic CS, the use of sparse transforms has some success; however, defining fixed basis functions is not trivial given the plethora of possibilities. Furthermore, the assumption that every instance of a seismic signal is sparse in any acquisition domain under the same transformation is limiting. We use beta process factor analysis (BPFA) to learn sparse transforms for seismic signals in the time slice and shot record domains from available data, and we use them as dictionaries for CS and denoising. Algorithms that use predefined basis functions are compared against BPFA, with BPFA obtaining state-of-the-art reconstructions, illustrating the importance of decomposing seismic signals into learned features.

scholarly journals Compressive sensing-based vibration signal reconstruction using sparsity adaptive subspace pursuit

2018 ◽  
Vol 10 (8) ◽  
pp. 168781401879087 ◽  
Author(s):  
Lin Zhou ◽  
Qianxiang Yu ◽  
Daozhi Liu ◽  
Ming Li ◽  
Shukai Chi ◽  
...  
Keyword(s):  
Compressive Sensing ◽  
Data Storage ◽  
Wireless Sensors ◽  
Signal Reconstruction ◽  
Estimation Method ◽  
Vibration Signal ◽  
Estimation Accuracy ◽  
Offshore Structure ◽  
Vibration Signals ◽  
Reconstructed Signal

Wireless sensors produce large amounts of data in long-term online monitoring following the Shannon–Nyquist theorem, leading to a heavy burden on wireless communications and data storage. To address this problem, compressive sensing which allows wireless sensors to sample at a much lower rate than the Nyquist frequency has been considered. However, the lower rate sacrifices the integrity of the signal. Therefore, reconstruction from low-dimension measurement samples is necessary. Generally, the reconstruction needs the information of signal sparsity in advance, whereas it is usually unknown in practical applications. To address this issue, a sparsity adaptive subspace pursuit compressive sensing algorithm is deployed in this article. In order to balance the computational speed and estimation accuracy, a half-fold sparsity estimation method is proposed. To verify the effectiveness of this algorithm, several simulation tests were performed. First, the feasibility of subspace pursuit algorithm is verified using random sparse signals with five different sparsities. Second, the synthesized vibration signals for four different compression rates are reconstructed. The corresponding reconstruction correlation coefficient and root mean square error are demonstrated. The high correlation and low error result mean that the proposed algorithm can be applied in the vibration signal process. Third, implementation of the proposed approach for a practical vibration signal from an offshore structure is carried out. To reduce the effect of signal noise, the wavelet de-noising technique is used. Considering the randomness of the sampling, many reconstruction tests were carried out. Finally, to validate the reliability of the reconstructed signal, the structure modal parameters are calculated by the Eigensystem realization algorithm, and the result is only slightly different between original and reconstructed signal, which means that the proposed method can successfully save the modal information of vibration signals.

Sign in / Sign up

Export Citation Format

Share Document