Searcharxiv⌕ Search

arXiv subjects

Mahesh Chandra Govil

Publications and source records attributed to Mahesh Chandra Govil.

3 recordsLinked to original sources

Zero-Shot KWS for Children's Speech using Layer-Wise Features from SSL Models

Numerous methods have been proposed to enhance Keyword Spotting (KWS) in adult speech, but children's speech presents unique challenges for KWS systems due to its distinct acoustic and linguistic characteristics. This paper introduces a zero-shot KWS approach that leverages state-of-the-art self-supervised learning (SSL) models, including Wav2Vec2, HuBERT and Data2Vec. Features are extracted layer-wise from these SSL models and used to train a Kaldi-based DNN KWS system. The WSJCAM0 adult speech dataset was used for training, while the PFSTAR children's speech dataset was used for testing, demonstrating the zero-shot capability of our method. Our approach achieved state-of-the-art results across all keyword sets for children's speech. Notably, the Wav2Vec2 model, particularly layer 22, performed the best, delivering an ATWV score of 0.691, a MTWV score of 0.7003 and probability of false alarm and probability of miss of 0.0164 and 0.0547 respectively, for a set of 30 keywords. Furthermore, age-specific performance evaluation confirmed the system's effectiveness across different age groups of children. To assess the system's robustness against noise, additional experiments were conducted using the best-performing layer of the best-performing Wav2Vec2 model. The results demonstrated a significant improvement over traditional MFCC-based baseline, emphasizing the potential of SSL embeddings even in noisy conditions. To further generalize the KWS framework, the experiments were repeated for an additional CMU dataset. Overall the results highlight the significant contribution of SSL features in enhancing Zero-Shot KWS performance for children's speech, effectively addressing the challenges associated with the distinct characteristics of child speakers.

eess.AS↗

On Stability Problems of Omega and 3-Disjoint Paths Omega Multi-stage Interconnection Networks

The research paper emphasizes that the Stable Matching problems are the same as the problems of stable configurations of Multi-stage Interconnection Networks (MIN). We have discusses the Stability Problems of Existing Regular Omega Multi-stage Interconnection Network (OMIN) and Proposed 3-Disjoint Paths Omega Multi-stage Interconnection Network (3DON) using the approaches and solutions provided by the Stable Matching Problem. Specifically, Stable Marriage Problem is used as an example of Stable Matching. On application of the concept of the Stable Marriage over the MINs states that OMIN is highly stable in comparison to 3DON.

cs.DC↗

Disjoint Paths Multi-stage Interconnection Networks Stability Problem

This research paper emphasizes that the Stable Matching problems are the same as the problems of stable configurations of Multi-stage Interconnection Networks (MIN). The authors have solved the Stability Problem of Existing Regular Gamma Multi-stage Interconnection Network (GMIN), 3-Disjoint Gamma Multi-stage Interconnection Network (3DGMIN) and 3-Disjoint Path Cyclic Gamma Multi-stage Interconnection Network (3DCGMIN) using the approaches and solutions provided by the Stable Matching Problem. Specifically Stable Marriage Problem is used as an example of Stable Matching. For MINs to prove Stable two existing algorithms are used:-the first algorithm generates the MINs Preferences List in time and second algorithm produces a set of most Optimal Pairs of the Switching Elements (SEs) (derived from the MINs Preferences List) in time. Moreover, the paper also solves the problem of Ties that occurs between the Optimal Pairs. The results are promising as the comparison of the MINs based on their stability shows that the ASEN, ABN, CLN, GMIN, 3DCGMIN are highly stable in comparison to HZTN, QTN, DGMIN. However, on comparing the irregular and regular MINs in totality upon their stability the regular MINs comes out to be more stable than the irregular MINs.

cs.DC↗