2019 National Conference on Communications (NCC)最新文献

筛选
英文 中文
Comparison of low-dimension speech segment embeddings: Application to speaker diarization 低维语音片段嵌入的比较:在说话人拨号化中的应用
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732210
Srikanth Raj Chetupalli, T. Sreenivas, Anand Gopalakrishnan
{"title":"Comparison of low-dimension speech segment embeddings: Application to speaker diarization","authors":"Srikanth Raj Chetupalli, T. Sreenivas, Anand Gopalakrishnan","doi":"10.1109/NCC.2019.8732210","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732210","url":null,"abstract":"Segment clustering is a crucial step in unsupervised speaker diarization. Bottom-up approaches, such as, hierarchical agglomerative clustering technique are used traditionally for segment clustering. In this paper, we consider the top-down approach to clustering, in which a speaker sensitive, low-dimensional representation of segments (speaker space) is obtained first, followed by Gaussian mixture model (GMM) based clustering. We explore three methods of obtaining the low dimension segment representation: (i) multi-dimensional scaling (MDS) based on segment to segment stochastic distances; (ii) traditional principal component analysis (PCA), and (iii) factor analysis (i-vectors), of GMM mean super-vectors. We found that, MDS based embeddings result in better representation and hence result in better diarization performance compared to PCA and even i-vector embeddings.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"103 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89011293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Speaking-Rate Adaptation of Automatic Speech Recognition System through Fuzzy Classification based Time-Scale Modification 基于模糊分类时标修正的语音自动识别系统语速自适应
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732255
S. Shahnawazuddin, Waquar Ahmad, H. Kathania, Nagaraj Adiga, B. Sai
{"title":"Speaking-Rate Adaptation of Automatic Speech Recognition System through Fuzzy Classification based Time-Scale Modification","authors":"S. Shahnawazuddin, Waquar Ahmad, H. Kathania, Nagaraj Adiga, B. Sai","doi":"10.1109/NCC.2019.8732255","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732255","url":null,"abstract":"In this paper, we study the role of speaking-rate adaptation (SRA) of automatic speech recognition (ASR) systems. The performance of an ASR system is reported to degrade when the speaking-rate is either too fast or too slow. In order to simulate such a situation, an ASR system was trained on adults' speech and used for transcribing speech data from adult as well as child speakers. Earlier studies have shown that, speaking-rate is significantly lower in the case of children when compared to adults. Consequently, the recognition performance for children's speech was noted to be very poor in contrast to adults' speech. To improve the recognition performance with respect to children's speech, speaking-rate was explicitly changed using time-scale modification (TSM). A recently proposed TSM approach based on fuzzy classification of spectral bins has been explored in this regard. The fuzzy-classification-based TSM technique is reported to be superior to state-of-the-art approaches. Effectiveness of the said TSM technique has not been studied yet in the context of ASR. The experimental studies presented in this paper show that SRA based on fuzzy classification results in a relative improvement of 30% over the baseline.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"18 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90581015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Caching Partial Files for Content Delivery 为内容交付缓存部分文件
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732266
V. S. C. L. Narayana, Sambhav Jain, Sharayu Moharir
{"title":"Caching Partial Files for Content Delivery","authors":"V. S. C. L. Narayana, Sambhav Jain, Sharayu Moharir","doi":"10.1109/NCC.2019.8732266","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732266","url":null,"abstract":"Numerous empirical studies have shown that users of video-on-demand platforms do not always watch videos in their entirety. A direct consequence of this is that not all parts of a video are equally popular. Motivated by this, we explore the benefits of dividing files into smaller segments for caching. We treat incoming requests as requests for segments of files and propose a Markovian request model which captures the time-correlation in requests. We characterize the fundamental limit on the performance of caching policies which only cache full files. Next, we propose and analyze the performance of policies which cache partial files. Using this, we characterize the potential for improvement in performance due to caching partial files and analyze its dependence on various system parameters like cache size and the popularity profile of the files being cached.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"5 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87852588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Decision Support System for Liver Cancer Diagnosis using Focus Features in NSCT Domain 基于NSCT域焦点特征的肝癌诊断决策支持系统
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732219
Lakshmipriya Balagourouchetty, Jayanthi K. Pragatheeswaran, B. Pottakkat, R. Govindarajalou
{"title":"Decision Support System for Liver Cancer Diagnosis using Focus Features in NSCT Domain","authors":"Lakshmipriya Balagourouchetty, Jayanthi K. Pragatheeswaran, B. Pottakkat, R. Govindarajalou","doi":"10.1109/NCC.2019.8732219","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732219","url":null,"abstract":"Diagnosis of liver cancer by medical experts using imaging modalities is found to be sub-optimal as different lesions exhibit similar visual appearance in the spatial domain. Thus computer aided diagnostic tools play a significant role in providing a decision support system for radiologists to minimize the risk of false diagnosis. This paper proposes a different feature set using focus operators for classifying different classes of liver cancer. As computation of focus measure involves the local neighborhood of pixel, focus operator is believed to indirectly measure the intricate texture details of the image. This knowledge of focus operator is exploited in NSCT domain to capture the directional components as feature variables replacing the classic texture features. The results in terms of classification accuracy and kappa coefficient proclaim that the focus operators can be employed as feature variables for classification scenario as it outperforms the state-of-the art texture features.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"100 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88060486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Detection of Vowel-Like Speech Using Variance of Sample Magnitudes 基于样本幅度方差的类元音语音检测
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732268
N. Srinivas, G. Pradhan, P. Kumar
{"title":"Detection of Vowel-Like Speech Using Variance of Sample Magnitudes","authors":"N. Srinivas, G. Pradhan, P. Kumar","doi":"10.1109/NCC.2019.8732268","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732268","url":null,"abstract":"Vowel, semi vowel and diphthong sound units are collectively referred to as vowel-like speech (VLS). VLS are dominant voiced regions in a given speech signal. Consequently, within a short-analysis frame the variance of sample magnitudes (VSM) is significantly higher for VLS when compared with other speech regions. In this work, a signal processing approach is proposed to robustly extract the VSM within an analysis frame. The VSM at each time instant is then non-linearly mapped (NLM) using negative exponential function to suppress the fluctuations. The NLM-VSM values are nearly constant and significantly less in magnitude for VLS than other speech, silence and noise regions. The NLM-VSM is used as a front-end feature for detecting the VLS in a given speech signal. The experimental results presented in this paper show that, for clean as well as noisy speech signals, the proposed feature outperforms some of the earlier reported features for the task of detecting VLS and corresponding onset and offset points.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87218197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SSK Performance with SWIPT based Dual-Hop AF Relay over Rayleigh Fading 基于SWIPT的瑞利衰落双跳AF中继的SSK性能
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732187
H. Sahu, P. R. Sahu
{"title":"SSK Performance with SWIPT based Dual-Hop AF Relay over Rayleigh Fading","authors":"H. Sahu, P. R. Sahu","doi":"10.1109/NCC.2019.8732187","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732187","url":null,"abstract":"A cooperative communication system with space shift keying (SSK) modulation and simultaneous wireless information and power transfer (SWIPT) scheme is proposed. SWIPT can eliminate the need of external power supply at the relay whereas SSK modulation scheme reduces inter-channel interference, excludes inter antenna synchronization requirement and the number of radio frequency chains. An upper bound expression for the average bit error probability (ABEP) is obtained with multiple amplify-forward relays and a direct link from source node to destination node. Further, ABEP is analyzed for partial relay selection operation. Numerical and computer simulation results demonstrate performance improvement for SSK modulation combined with SWIPT.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"40 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84467730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Modelling and short term forecasting of flash floods in an urban environment 城市环境下山洪暴发的建模与短期预报
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732193
Suraj Ogale, S. Srivastava
{"title":"Modelling and short term forecasting of flash floods in an urban environment","authors":"Suraj Ogale, S. Srivastava","doi":"10.1109/NCC.2019.8732193","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732193","url":null,"abstract":"Rapid urbanization, climate change, and extreme rainfall have resulted in a growing number of cases of urban flash floods. It is important to predict the occurrence of a flood so that the aftermath of it can be minimized. As the name suggests, an urban flash flood occurs in an urban area in a very short span of time. To reduce the impact of these events, short-term forecasting or nowcasting is used for prediction of the very near future incident. In orthodox methods of flood forecasting, current weather conditions are examined using conventional methods such as the use of radar, satellite imaging and calculations involving complicated mathematical equations. However, recent developments in Information and Communication Technology (ICT) and Machine Learning (ML) has helped us to study this hydrological problem from a different perspective. The aim of this paper is to design a theoretical model considering the parameters causing the urban flash flood and predict the event beforehand. To test the soundness model, data syntheses is performed and the results are checked using the artificial neural network.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"28 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83719957","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
The HTTP/2 Server Push and Its Implications on Mobile Web Quality of Experience HTTP/2服务器推送及其对移动Web体验质量的影响
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732204
Hema Kumar Yarnagula, V. Tamarapalli
{"title":"The HTTP/2 Server Push and Its Implications on Mobile Web Quality of Experience","authors":"Hema Kumar Yarnagula, V. Tamarapalli","doi":"10.1109/NCC.2019.8732204","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732204","url":null,"abstract":"In recent years, an unprecedented growth in the usage of mobile devices for web browsing poses a challenge for the service providers to assure the user-perceived quality. In the context of web quality of experience (QoE), quality perception is mostly dominated by the page load time (PLT). HTTP/2 protocol, with the server push feature, promises to address the design limitations of HTTP/1.1 that inhibit optimal web performance. However, it remains largely unclear if HTTP/2 can really improve web QoE for mobile browsing. In this paper, we experimentally investigate the web QoE with HTTP/2. We assess the web QoE for several popular websites on a controlled testbed emulated with real 4G/LTE and 3G network traces. Our experiments investigate the impact of both network latency and packet loss ratio on the mobile web QoE. The results clearly show 24% improvement in the PLT, on an average, with HTTP/2 over mobile networks. However, we identify that HTTP/2 with server push is necessarily not the fail-safe solution for improving mobile web QoE under all conditions. We noticed that HTTP/2 loads the web pages slower than HTTP/1.1 when the network packet loss ratio is more than 2%. Our study could be used as the basis to derive a set of guidelines on the usage of the HTTP/2 server push to improve the end-user web QoE, especially in mobile devices.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"104 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87594444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Detection of Vowels in Speech Signals Degraded by Speech-Like Noise 类语音噪声退化语音信号中元音的检测
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732212
Avinash Kumar, S. Shahnawazuddin, Sarmila Garnaik, Ishwar Chandra Yadav, G. Pradhan
{"title":"Detection of Vowels in Speech Signals Degraded by Speech-Like Noise","authors":"Avinash Kumar, S. Shahnawazuddin, Sarmila Garnaik, Ishwar Chandra Yadav, G. Pradhan","doi":"10.1109/NCC.2019.8732212","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732212","url":null,"abstract":"Detecting vowels in a noisy speech signal is a very challenging task. The problem is further aggravated when the noise exhibits speech-like characteristics, e.g., babble noise. In this work, a novel front-end feature extraction technique exploiting variational mode decomposition (VMD) is proposed to improve the detection of vowels in speech data degraded by speech-like noise. Each short-time analysis frame of speech is first decomposed into a set of variational mode functions (VMFs) using VMD. The logarithmic energy present in each of the VMFs is then used as the front-end features for detecting vowels. A three-class classifier (vowel, non-vowel and silence) with acoustic modeling based on long short-term memory (LSTM) architecture is developed on the TIMIT database using the proposed features as well as mel-frequency cepstral coefficients (MFCC). Using the three-class classifier, frame-level time-alignments for a given speech utterance are obtained to detect the vowel regions. The proposed features result in significantly improved performance under noisy test conditions than the MFCC features. Further, the vowel regions detected using the proposed features are also quite different from those obtained through the MFCC. Exploiting the aforementioned differences, the evidences are combined to further improve the detection accuracy.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"66 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83927498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
General Compute and Forward for Virtual Full-Duplex Relaying 虚拟全双工中继的通用计算和转发
2019 National Conference on Communications (NCC) Pub Date : 2019-02-01 DOI: 10.1109/NCC.2019.8732252
Roshan S. Sam, Antony V. Mampilly, S. Bhashyam
{"title":"General Compute and Forward for Virtual Full-Duplex Relaying","authors":"Roshan S. Sam, Antony V. Mampilly, S. Bhashyam","doi":"10.1109/NCC.2019.8732252","DOIUrl":"https://doi.org/10.1109/NCC.2019.8732252","url":null,"abstract":"Motivated by the wireless backhaul application, multihop virtual full duplex relaying using a successive relaying protocol based on compute-and-forward (CoF) was proposed recently by Hong and Caire. The channel gain in each hop was assumed to be equal. In this paper, we consider multihop virtual full duplex relaying where the gain in the different hops can be unequal. We use the recently proposed general compute-and-forward (GCoF) scheme along with successive relaying. GCoF eliminates the non-integer penalty present in CoF or the CoF with simple power allocation used earlier. We determine the achievable rate of virtual full duplex relaying using GCoF for the multihop case and show that this rate is within a constant gap (also independent of the number of hops) of the cutset upper bound under some assumptions.","PeriodicalId":6870,"journal":{"name":"2019 National Conference on Communications (NCC)","volume":"41 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73481053","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信