Speech Enhancement using Greedy Dictionary Learning and Sparse Recovery

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Srinivas K.N.H.; Prabha I. Santhi; Rao M. Venugopala

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF INFORMATION TECHNOLOGY MANAGEMENT Year:2023 | Volume:15 | Issue:Special Issue Page(s): 120-132

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Speech Enhancement using Greedy Dictionary Learning and Sparse Recovery

Author(s)

Srinivas K.N.H. | Prabha I. Santhi | Rao M. Venugopala | Issue Writer Certificate

Keywords

Sparse Representation

Greedy Dictionary Learning

Singular Value Decomposition

Orthogonal Matching Pursuit

Quantization

Abstract

Most real-time speech signals are frequently disrupted by noise such as traffic, babbling, and background noises, among other things. The goal of speech denoising is to extract the clean speech signal from as many distorted components as possible. For speech denoising, many researchers worked on sparse representation and dictionary learning algorithms. These algorithms, however, have many disadvantages, including being overcomplete, computationally expensive, and susceptible to orthogonality restrictions, as well as a lack of arithmetic precision due to the usage of double-precision. We propose a greedy technique for dictionary learning with sparse representation to overcome these concerns. In this technique, the input signal's singular value decomposition is used to exploit orthogonality, and here the ℓ1-ℓ2 norm is employed to obtain sparsity to learn the dictionary. It improves dictionary learning by overcoming the orthogonality constraint, the three-sigma rule-based number of iterations, and the overcomplete nature. And this technique has resulted in improved performance as well as reduced computing complexity. With a bit-precision of Q7 fixed-point arithmetic, this approach is also used in resource-constrained embedded systems, and the performance is considerably better than other algorithms. The greedy approach outperforms the other two in terms of SNR, Short-Time Objective Intelligibility, and computing time.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans