Performance analysis of compressive sensing and reconstruction by LASSO and OMP for audio signal processing applications
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2023.14.1.28Keywords:
Orthogonal Matching Pursuit, Sparse approximation, Audio Signal Processing, Least Square Method, Compressive sensing, IoT node, LASSODimensions Badge
Issue
Section
Audio signal processing is used in acoustic IoT sensor nodes which have limitations in data storage, computation speed, hardware size and power. In most audio signal processing systems, the recovered data constitutes far less fraction of the sampled data providing scope for compressive sensing (CS) as an efficient way for sampling and signal recovery. Compressive sensing is a signal processing technique in which a sparse approximated signal is reconstructed at the receiving node by a signal recovery algorithm, using fewer samples compared to traditional sampling methods. It has two main stages: sparse approximation to convert the signal into a sparse domain and reconstruction through sparse signal recovery algorithms. Recovery algorithms involve complex matrix multiplication and linear equations in sampling and reconstruction, increasing the computational complexity and leading to highly resourceful hardware implementations. This work reconstructs the sparse audio signal using LASSO and orthogonal matching pursuit (OMP) algorithm. OMP is an iterative greedy algorithm involving least square method that takes a compressed signal as input and recovers it from the sparse approximation, while LASSO is L1 norm based with a controlled L2 penalty. The paper reviews the reconstruction and study of sparsity and error obtained for reconstructing an audio signal by OMP and LASSO.Abstract
How to Cite
Downloads
Similar Articles
- P. Susai Raj, A. Edward William Benjamin, Evaluating the effectiveness of academic resilience intervention for at-risk students at higher secondary level , The Scientific Temper: Vol. 15 No. 04 (2024): The Scientific Temper
- Gautam Nayak, Parthivkumar Patel, Developing speaking skills through task-based learning in English as a foreign language classroom , The Scientific Temper: Vol. 15 No. 04 (2024): The Scientific Temper
- Manikannan Palanivel, Alaudeen A, Pandiyan K. S, Sivaprakasam P, Hybrid fuzzy and fire fly algorithm-based MPPT controller for PV system using super lift boost converter , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- Amala Deepa V., T. Lucia Agnes Beena, Enhancing data imputation in complex datasets using Lagrange polynomial interpolation and hot-deck fusion , The Scientific Temper: Vol. 16 No. 02 (2025): The Scientific Temper
- S. Gomathi, C. Radhika, A secure messaging application using steganography and AES encryption a dual-layer secure messaging system , The Scientific Temper: Vol. 16 No. 02 (2025): The Scientific Temper
- T. Kanimozhi, V. Rajeswari, R. Suguna, J. Nirmaladevi, P. Prema, B. Janani, R. Gomathi, RWHO: A hybrid of CNN architecture and optimization algorithm to predict basal cell carcinoma skin cancer in dermoscopic images , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
- L. Amudavalli, K. Muthuramalingam, Energy-efficient location-based routing protocol for wireless sensor networks using teaching-learning soccer league optimization (TLSLO) , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- Harshaben Raghubhai Pankuta, Kusum R. Yadav, Assessing students’ perception of the academic features of the Gyankunj Project , The Scientific Temper: Vol. 16 No. Spl-1 (2025): The Scientific Temper
- Avdhesh Kumar, Manoj Agarwal, Studies on challenges and opportunities for foreign direct investment in the automobile industry in India , The Scientific Temper: Vol. 14 No. 02 (2023): The Scientific Temper
- C. Muruganandam, V. Maniraj, A Self-driven dual reinforcement model with meta heuristic framework to conquer the iot based clustering to enhance agriculture production , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
<< < 8 9 10 11 12 13 14 15 16 17 > >>
You may also start an advanced similarity search for this article.

