发布求助
文献互助 智能选刊 最新文献

2010 National Conference On Communications (NCC)最新文献

筛选
英文 中文
Vocal Tract Length Normalization factor based speaker-cluster UBM for speaker verification 基于声道长度归一化因子的说话人簇UBM
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430207
A. K. Sarkar, S. Rath, S. Umesh
{"title":"Vocal Tract Length Normalization factor based speaker-cluster UBM for speaker verification","authors":"A. K. Sarkar, S. Rath, S. Umesh","doi":"10.1109/NCC.2010.5430207","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430207","url":null,"abstract":"In speaker verification task requires some sort of background model for the system to make decision. Most of the cases, a speaker independent large Gaussian Universal Background Model (GMM-UBM) is used. In this paper, we propose to use a Speaker Cluster-wise UBM (SC-UBM) for a group of target speakers. In this method, the target speakers are clustered into group based on their similarity in Vocal Tract Length Normalization (VTLN) parameter. The VTLN parameter depends on the physiological structure of human speech production system. Hence, the group of speakers with same VTLN factor represent a speaker with unique characteristic. The SC-UBMs are derived from GMM-UBM with Maximum Likelihood Linear Regression (MLLR) by pooling data from the specific group of target speakers. The speaker dependent models are then adapted from their respective SC-UBM using Maximum a Posteriori (MAP) method. During verification, the log likelihood ratio for the claimant is calculated with respect to the corresponding group specific UBM. The comparative study are performed on NIST 2004 SRE in core condition. The SC-UBM system reduced equal error rate (EER) by 9% over the GMM-UBM system.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127642132","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
Simulation study of LDPC codes for nonuniform sources with side information in Slepian-Wolf coding slepin - wolf编码中带侧信息非均匀源LDPC码的仿真研究
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430241
R. K. Bhattar, K. Ramakrishnan, K. Dasgupta
{"title":"Simulation study of LDPC codes for nonuniform sources with side information in Slepian-Wolf coding","authors":"R. K. Bhattar, K. Ramakrishnan, K. Dasgupta","doi":"10.1109/NCC.2010.5430241","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430241","url":null,"abstract":"The principles of distributed source coding or Slepian-Wolf coding, primarily employed for compression of correlated sources with side information, can also be used for reducing the encoder complexity of a single source. This effectively shifts the encoder complexity to the decoder. This exchange of computational complexities has opened up the door for many applications in wireless video and image communications. Till now, most of the research efforts are concentrated around compression of correlated sources which are uniformly distributed. But nonuniform sources are not uncommon in real world. In this paper, we have studied and demonstrated the suitability and optimality of LDPC syndrome codes for distributed source coding of nonuniform sources using Monte-Carlo simulation. Our study reveals that several capacity approaching LDPC codes, indeed do approach the Slepian-Wolf bound for nonuniform sources as well. The Monte-Carlo simulation results show that, highly biased sources can be compressed to 0.049 bits/sample away from Slepian-Wolf bound for moderate block lengths.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114941932","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
Cyclostationary signals in multirate linear systems 多速率线性系统中的周期平稳信号
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430197
R. Dhuli, Brejesh Lall
{"title":"Cyclostationary signals in multirate linear systems","authors":"R. Dhuli, Brejesh Lall","doi":"10.1109/NCC.2010.5430197","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430197","url":null,"abstract":"This paper presents a systematic approach to use time frequency representation (TFR) for the analysis of cyclostationary signals in multirate linear systems. We exploit the ability of blocking operation to perform the analysis in a simple yet efficient manner. We illustrate the strength of TFR for performing such analysis. The basic idea is — TFR of a cyclostationary signal is directly related to the rows of the power spectrum matrix of its blocked version. We present examples including nonuniform filter bank to highlight the capabilities of the analysis.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117041697","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}
引用次数: 3
Network (tree) topology inference based on Prüfer sequence 基于属性序列的网络(树)拓扑推理
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430177
Vanniarajan Chellappan, K. Krithivasan
{"title":"Network (tree) topology inference based on Prüfer sequence","authors":"Vanniarajan Chellappan, K. Krithivasan","doi":"10.1109/NCC.2010.5430177","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430177","url":null,"abstract":"Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from the hop count metric (distance) between OD (Origin — Destination) pairs. The proposed method is based on Prüfer encoding and decoding techniques of trees using this metric. The method also has the potential to minimize and avoid reliance on ICMP.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117044416","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}
引用次数: 5
Speaker information from subband energies of Linear Prediction residual 从子带能量中提取说话人信息的线性预测残差
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430209
D. Pati, S. Prasanna
{"title":"Speaker information from subband energies of Linear Prediction residual","authors":"D. Pati, S. Prasanna","doi":"10.1109/NCC.2010.5430209","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430209","url":null,"abstract":"The objective of this work is to demonstrate the significant speaker information present in the subband energies of the Linear Prediction (LP) residual. The LP residual mostly contains the excitation source information. The subband energies extracted using the mel filterbank followed by cepstral analysis provides a compact representation. The resulting cepstral values are termed as Residual-mel Frequency Cepstral Coefficients (R-MFCC). The speaker identification studies conducted using R-MFCC as features and Gaussian mixture model (GMM) on a subset of 30 speakers from NIST-1999 provides 87% accuracy. The performance using MFCC extracted directly from speech provides 87% accuracy. Further, the combination of the two provides 90% accuracy indicating the different aspect of speaker information present in R-MFCC.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122137125","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}
引用次数: 25
No-zero-entry, square, single-symbol ML Decodable STBCs 无零输入，方形，单符号ML可解码的stbc
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430236
A. Pramanik, B. Rajan
{"title":"No-zero-entry, square, single-symbol ML Decodable STBCs","authors":"A. Pramanik, B. Rajan","doi":"10.1109/NCC.2010.5430236","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430236","url":null,"abstract":"Space-time block codes based on orthogonal designs (ODs) are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity along single-symbol maximum-likelihood decodability. Single-Symbol Decodable (SSD) codes which are not ODs can be constructed having slightly higher rate than ODs. Elegant constructions of SSD codes using Clifford algebras (Karmakar and Rajan, proceedings of IEEE ISIT, 2006) are known. But these codes, for transmitting antennas more than 4, have large number of zeros in it. Due to the zero entries in the design, the transmitting antenna need to be switched on and off imposing severe hardware constraints. This motivates the construction of SSD codes having no zero entries in the codeword matrices. In this paper we propose a technique for constructing SSD codes having no zero entries in it, having larger rate than the known constructions of the same.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117189843","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}
引用次数: 6
Internet activity analysis through proxy log 通过代理日志分析互联网活动
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430163
Kartik Bommepally, T. K. Glisa, J. Prakash, Sanasam Ranbir Singh, H. Murthy
{"title":"Internet activity analysis through proxy log","authors":"Kartik Bommepally, T. K. Glisa, J. Prakash, Sanasam Ranbir Singh, H. Murthy","doi":"10.1109/NCC.2010.5430163","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430163","url":null,"abstract":"The availability of the Internet at the click of a mouse brings with it a host of new problems. Although the World Wide Web was first started by physicists at CERN to enable collation and exchange of data, today, it is used for a wide range of applications. The requirements on bandwidth for each of the applications is also varied. An Internet Service Provider must ensure satisfaction across the entire spectrum of users. To ensure this, analysis of Internet usage becomes essential. Further, an administrator can keep a record of user's Internet activity and prevent unethical activities, since the Internet is also an excellent resource for providing anonymity. This analysis can also help in resource provisioning and monitoring. In this work, a web-based tool is first proposed to analyse the Internet activity. Next, data is collected from a proxy server at a campus-wide network. Traffic patterns of different types of users are studied. Finally, the paper concludes with strategies for monitoring and control of traffic.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125828530","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}
引用次数: 22
Robust syllable segmentation and its application to syllable-centric continuous speech recognition 鲁棒音节分割及其在以音节为中心的连续语音识别中的应用
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430189
Rajesh Janakiraman, J. Kumar, H. Murthy
{"title":"Robust syllable segmentation and its application to syllable-centric continuous speech recognition","authors":"Rajesh Janakiraman, J. Kumar, H. Murthy","doi":"10.1109/NCC.2010.5430189","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430189","url":null,"abstract":"The focus of this paper is two-fold: (a) to develop a knowledge-based robust syllable segmentation algorithm and (b) to establish the importance of accurate segmentation in both the training and testing phases of a speech recognition system. A robust segmentation algorithm for segmenting the speech signal into syllables is first developed. This uses a non-statistical technique that is based on group delay(GD) segmentation and Vowel Onset point(VOP) detection. The transcription corresponding to the utterance is syllabified using rules. This produces an annotation for the train data. The annotated train data is then used to train a syllable-based speech recognition system. The test signal is also segmented using the proposed algorithm. This segmentation information is then incorporated into the linguistic search space to reduce both computational complexity and word error rate(WER). WER's of 4.4% and 21.2% are reported on the TIMIT and NTIMIT databases respectively.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128586959","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}
引用次数: 23
Distributed route control schemes to load balance incoming traffic in multihomed stub networks 多宿主存根网络中负载均衡入站流量的分布式路由控制方案
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430175
A. Sairam, G. Barua
{"title":"Distributed route control schemes to load balance incoming traffic in multihomed stub networks","authors":"A. Sairam, G. Barua","doi":"10.1109/NCC.2010.5430175","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430175","url":null,"abstract":"Load balancing traffic of a multihomed stub network among its various egress links can significantly improve performance by allowing the network to route its traffic around congested paths. In [3], several centralized route control schemes to load balance traffic were proposed. It was shown that employing these route control schemes resulted in significant improvement in round-trip times. We carry this exploration further by developing distributed algorithms to load balance traffic. We show theoretically that the expected performance of the distributed version is the same as the centralized routing scheme. We further validate the schemes using both synthetic as well as actual traffic traces.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127393967","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
Neighbor oblivious link reversal over duty-cycled WSNs 占空比无线传感器网络的邻居无关链路反转
2010 National Conference On Communications (NCC) Pub Date : 2010-03-15 DOI: 10.1109/NCC.2010.5430167
Santosh Ramachandran, S. Anand, M. Hegde, Anurag Kumar, R. Sundaresan
{"title":"Neighbor oblivious link reversal over duty-cycled WSNs","authors":"Santosh Ramachandran, S. Anand, M. Hegde, Anurag Kumar, R. Sundaresan","doi":"10.1109/NCC.2010.5430167","DOIUrl":"https://doi.org/10.1109/NCC.2010.5430167","url":null,"abstract":"We propose partial and full link reversal algorithms to bypass voids during geographic routing over duty-cycled wireless sensor networks. We propose a distributed approach that is oblivious to one-hop neighbor information. Upon termination of the algorithm, the resulting network is guaranteed to be destination-oriented. Further, to reduce the delays incurred under reactive link reversal, we propose the use of ‘pseudo-events’, a preemptive link reversal strategy, that renders the network destination-oriented before the onset of a real event. A simulation study of the effectiveness of pseudo-events is also provided.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129293977","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学术官方微信