paper-with-me

홈 › Papers

Significance of the levels of spectral valleys with application to front/back distinction of vowel sounds

2015-06-16 · T. V. Ananthapadmanabha, A. G. Ramakrishnan, Shubham Sharma

An objective critical distance (OCD) has been defined as that spacing between adjacent formants, when the level of the valley between them reaches the mean spectral level. The measured OCD lies in the same range (viz., 3-3.5 bark) as the critical distance determined by subjective experiments for similar experimental conditions. The level of spectral valley serves a purpose similar to that of the spacing between the formants with an added advantage that it can be measured from the spectral envelope without an explicit knowledge of formant frequencies. Based on the relative spacing of formant frequencies, the level of the spectral valley, VI (between F1 and F2) is much higher than the level of VII (spectral valley between F2 and F3) for back vowels and vice-versa for front vowels. Classification of vowels into front/back distinction with the difference (VI-VII) as an acoustic feature, tested using TIMIT, NTIMIT, Tamil and Kannada language databases gives, on the average, an accuracy of about 95%, which is comparable to the accuracy (90.6%) obtained using a neural network classifier trained and tested using MFCC as the feature vector for TIMIT database. The acoustic feature (VI-VII) has also been tested for its robustness on the TIMIT database for additive white and babble noise and an accuracy of about 95% has been obtained for SNRs down to 25 dB for both types of noise.

📄 PDF Abstract BibTeX arXiv:1506.04828

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Spurious Valleys in Two-layer Neural Network Optimization Landscapes

2018-02-18 · Luca Venturi, Afonso S. Bandeira, Joan Bruna

Neural networks provide a rich class of high-dimensional, non-convex optimization problems. Despite their non-convexity, gradient-descent methods often successfully optimize these models. This has motivated a recent spur…

Vocal Bursts Valence Prediction

What Makes Looped Transformers Perform Better Than Non-Recursive Ones

2025-10-11 · Zixuan Gong, Yong Liu, Jiaye Teng arxiv

While looped transformers (termed as Looped-Attn) often outperform standard transformers (termed as Single-Attn) on complex reasoning tasks, the mechanism for this advantage remains underexplored. In this paper, we expla…

On the Landscape of One-hidden-layer Sparse Networks and Beyond

2020-09-16 · Dachao Lin, Ruoyu Sun, Zhihua Zhang

Sparse neural networks have received increasing interest due to their small size compared to dense networks. Nevertheless, most existing works on neural network theory have focused on dense neural networks, and the under…

Network Pruning

T3former: Temporal Graph Classification with Topological Machine Learning

2025-10-15 · Md. Joshem Uddin, Soham Changani, Baris Coskunuzer arxiv

Temporal graph classification plays a critical role in applications such as cybersecurity, brain connectivity analysis, social dynamics, and traffic monitoring. Despite its significance, this problem remains underexplore…

Graph ClassificationLink PredictionGraph Learning

Towards Sampling from Nondirected Probabilistic Graphical models using a D-Wave Quantum Annealer

2019-05-01 · Yaroslav Koshka, M. A. Novotny

A D-Wave quantum annealer (QA) having a 2048 qubit lattice, with no missing qubits and couplings, allowed embedding of a complete graph of a Restricted Boltzmann Machine (RBM). A handwritten digit OptDigits data set havi…

General ClassificationMissing LabelsPlaying the Game of 2048