A New VAD Algorithm using Sparse Representation in Spectro-Temporal Domain

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.

Eshaghi Mohadese; RAZZAZI FARBOD; BEHRAD ALIREZA

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

Journal Paper

Paper Information

Journal: Journal of Information Systems and Telecommunication Year:2019 | Volume:7 | Issue:1 Page(s): 74-87

Download Full-Text

View:

221

Download:

122

Cites:

Information Journal Paper

Title

A New VAD Algorithm using Sparse Representation in Spectro-Temporal Domain

Author(s)

Eshaghi Mohadese | RAZZAZI FARBOD | BEHRAD ALIREZA | Issue Writer Certificate

Keywords

Speech Processing

Voice Activity Detector

VAD

Spectro-Temporal Domain Representation

Sparse Representation

NMF

K-SVD

Abstract

This paper proposes two algorithms for Voice Activity Detection (VAD) based on Sparse Representation in spectro-temporal domain. Spectral-temporal components which, in addition to the frequency and time dimensions, have two other dimensions of the scale and rate. Scale means spectral modulation and the rate means temporal modulation. On the other hand, using Sparse Representation in learning dictionaries of speech and noise, separate the speech and noise segment to be better separated. The first algorithm was made using two-dimensional STRF (Spectro-Temporal Response Field) space based on Sparse Representation. Dictionaries with different atomic sizes and two dictionary learning methods: NMF (non-negative matrix factorization) and the K-SVD (k-means clustering method), were investigated in this approach. This algorithm revealed good results at high SNRs (signal-to-noise ratio). The second algorithm, whose approach is more complicated, suggests a speech detector using the Sparse Representation in four-dimensional STRF space. Due to the large volume of STRF's four-dimensional space, this space was divided into cubes, with dictionaries made for each cube separately by NMF (non-negative matrix factorization) learning algorithm. Simulation results were presented to illustrate the effectiveness of our new VAD algorithms. The results revealed that the achieved performance was 90. 11% and 91. 75% under-5 dB SNR in white and car noise respectively, outperforming most of the state-of-the-art VAD algorithms.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Eshaghi, Mohadese, RAZZAZI, FARBOD, & BEHRAD, ALIREZA. (2019). A New VAD Algorithm using Sparse Representation in Spectro-Temporal Domain. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), 7(1), 74-87. SID. https://sid.ir/paper/332764/en

Vancouver: Copy

Eshaghi Mohadese, RAZZAZI FARBOD, BEHRAD ALIREZA. A New VAD Algorithm using Sparse Representation in Spectro-Temporal Domain. JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST)[Internet]. 2019;7(1):74-87. Available from: https://sid.ir/paper/332764/en

IEEE: Copy

Mohadese Eshaghi, FARBOD RAZZAZI, and ALIREZA BEHRAD, “A New VAD Algorithm using Sparse Representation in Spectro-Temporal Domain,” JOURNAL OF INFORMATION SYSTEMS AND TELECOMMUNICATION (JIST), vol. 7, no. 1, pp. 74–87, 2019, [Online]. Available: https://sid.ir/paper/332764/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops