Compressive Sensing in Speech Processing: A Survey Based on Sparsity and Sensing Matrix

نویسنده

  • Siddhi Desai
چکیده

Compressive sampling is an emerging technique that promises to effectively recover a sparse signal from far fewer measurements than its dimension. The compressive sampling theory assures almost an exact recovery of a sparse signal if the signal is sensed randomly where the number of the measurements taken is proportional to the sparsity level and a log factor of the signal dimension. Encouraged by this emerging technique, this paper briefly reviews the application of Compressive sampling in speech processing. It comprises the basic study of two necessary condition of compressive sensing theory: sparsity and incoherence. In this paper, various sparsity domain and sensing matrix for speech signal and different pairs that satisfy incoherence condition has been compiled.

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

ثبت نام

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

منابع مشابه

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...

متن کامل

Compressive Sensing and Signal Subspace Methods for Inverse Scattering including Multiple Scattering

Compressive sensing is a new field in signal processing and applied mathematics. It allows one to simultaneously sample and compress signals which are known to have a sparse representation in a known basis or dictionary along with the subsequent recovery by linear programming (requiring polynomial (P) time) of the original signals with low or no error [1, 2, 3]. In a discrete setting, sparsity ...

متن کامل

Nearly Linear-Time Model-Based Compressive Sensing

Compressive sensing is a method for recording a k-sparse signal x ∈ R with (possibly noisy) linear measurements of the form y = Ax, where A ∈ Rm×n describes the measurement process. Seminal results in compressive sensing show that it is possible to recover the signal x from m = O(k log n k ) measurements and that this is tight. The model-based compressive sensing framework overcomes this lower ...

متن کامل

Compressive Sensing-based Mrireconstruction in Fractional Fourier Domain

Compressive sensing is an emerging field in digital signal processing. It introduce a new technique to image reconstruction from less amount of data. This methodology reduces imaging time in MRI. Compressive sensing exploit the sparsity of the signal. In this paper Fractional Fourier is used as sparsifying transform and signal sampled by random sampling . Run length encoding is applied to code ...

متن کامل

STCS-GAF: Spatio-Temporal Compressive Sensing in Wireless Sensor Networks- A GAF-Based Approach

Routing and data aggregation are two important techniques for reducing communication cost of wireless sensor networks (WSNs). To minimize communication cost, routing methods can be merged with data aggregation techniques. Compressive sensing (CS) is one of the effective techniques for aggregating network data, which can reduce the cost of communication by reducing the amount of routed data to t...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013