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

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reconstruction of Compressive Sensing Signal using Orthogonal Matching Pursuit Algorithm

This paper represents the reconstruction of sampled signal in CS by using OMP algorithm. We have used the concept of compressive sensing for sub Nyquist sampling of sparse signal. Compressive sensing reconstruction methods have complex algorithms of l1 optimisation to reconstruct a signal sampled at sub nyquist rate. But out of those algorithm OMP algorithm is fast and computationally efficient...

متن کامل

Quantized Compressive Sensing Measurement Based on Improved Subspace Pursuit Algorithm

Recent research results in compressive sensing have shown that sparse signals can be recovered from a small number of random measurements. Whether quantized compressive measurements can provide an efficient representation of sparse signals in information-theoretic needs discuss. In this paper, the distortion rate functions are used as a tool to research the quantizing compressive sensing measur...

متن کامل

BRDF Reconstruction Using Compressive Sensing

Compressive sensing is a technique for efficiently acquiring and reconstructing the data. This technique takes advantage of sparseness or compressibility of the data, allowing the entire measured data to be recovered from relatively few measurements. Considering the fact that the BRDF data often can be highly sparse, we propose to employ the compressive sensing technique for an efficient recons...

متن کامل

Block-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients

Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...

متن کامل

Robust Subspace Recovery via Bi-Sparsity Pursuit

Successful applications of sparse models in computer vision and machine learning [3][2][5] imply that in many real-world applications, high dimensional data is distributed in a union of low dimensional subspaces. Nevertheless, the underlying structure may be affected by sparse errors and/or outliers. In this paper, we propose a dual sparse model as a framework to analyze this problem and provid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mechanical Engineering

سال: 2018

ISSN: 1687-8140,1687-8140

DOI: 10.1177/1687814018790877