{"title":"Paraphrase detection on SMS messages in automobiles","authors":"Wei Wu, Y. Ju, Xiao Li, Ye-Yi Wang","doi":"10.1109/ICASSP.2010.5494959","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5494959","url":null,"abstract":"Voice search technology has been successfully applied to help drivers reply SMS messages in automobiles, in which a predefined SMS message template set is searched with ASR hypotheses to form the reply candidate list. In order to efficiently organize the SMS message template set and improve the quality of the reply candidate list, we proposed to apply n-gram translation model and logistic regression to detect paraphrase SMS messages. Both of the proposed algorithms outperform the edit distance based paraphrase detection baseline, brining 40.9% and 50.5% EER reduction (relative), respectively.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125718336","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}
Yu-Hui Chen, Chia-Chen Chou, Hung-yi Lee, Lin-Shan Lee
{"title":"An initial attempt to improve spoken term detection by learning optimal weights for different indexing features","authors":"Yu-Hui Chen, Chia-Chen Chou, Hung-yi Lee, Lin-Shan Lee","doi":"10.1109/ICASSP.2010.5494981","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5494981","url":null,"abstract":"Because different indexing features actually have different discriminative capabilities for spoken term detection and different levels of reliability in recognition, it is reasonable to weight the indexing features in the transcribed lattices differently during spoken term detection. In this paper, we present an initial attempt of using two weighting schemes, one context independent (fixed weight for each feature) and one context dependent(different weights for the same feature in different context). These weights can be learned by optimizing a desired spoken term detection performance measure over a training document set and a training query set. Encouraging initial results based on unigrams of Chinese characters and syllables for the corpus of Mandarin broadcast news were obtained from the preliminary experiments.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125780083","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}
{"title":"Flexible adaptive filtering by minimization of error entropy bound and its application to system identification","authors":"Xi-Lin Li, T. Adalı","doi":"10.1109/ICASSP.2010.5495347","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5495347","url":null,"abstract":"It has been shown that using minimum error entropy as the cost function leads to important performance gains in adaptive filtering, especially when the Gaussianity assumptions on the error distribution do not hold. In this paper, we show that by using the entropy bound rather than the entropy, we can derive an efficient algorithm for supervised training. We demonstrate its effectiveness by a system identification problem using a generalized Gaussian noise model.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115785417","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}
{"title":"Semi-blind locally optimum detection for spectrum sensing in cognitive radio","authors":"M. Cardenas-Juarez, M. Ghogho, A. Swami","doi":"10.1109/ICASSP.2010.5496136","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5496136","url":null,"abstract":"Spectrum sensing in cognitive radio becomes a challenging task when the signals received at the secondary users' transmitters exhibit low power. Locally optimum detectors (LOD) are therefore desirable thanks to their optimality in the low SNR regime. Here, we assume that the primary user transmits a training sequence, and propose a semi-blind LOD (SBLOD). In the case of BPSK signals, the test statistic of the proposed SBLOD is shown to be a weighted sum of the matched filter output, the energy and pseudo-energy. For higher size constellations, the SBLOD reduces to a linear combination of the matched filter and the energy detector. Although combining the matched filter and energy detector is a classical approach, our study provides a systematic and (locally) optimal way of combining these detectors. Simulations results show the merits of the proposed detector.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115831962","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}
{"title":"Unidirectional graph-based wavelet transforms for efficient data gathering in sensor networks","authors":"S. K. Narang, Godwin Shen, Antonio Ortega","doi":"10.1109/ICASSP.2010.5496172","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5496172","url":null,"abstract":"We design lifting-based wavelet transforms for any arbitrary communication graph in a wireless sensor network (WSN). Since transmitting raw data bits along the routing trees in WSN usually requires more bits than transmitting encoded data, we seek to minimize raw data transmissions in the network. We especially focus on unidirectional transforms which are computed as data is forwarded towards the sink on a routing tree. We formalize the problem of minimizing the number of raw data transmitting nodes as a weighted set cover problem and provide greedy approximations. We compare our method with existing distributed wavelet transforms on communication graphs. The results validate that our proposed transforms reduce the total energy consumption in the network with respect to existing designs.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115946092","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}
{"title":"An initial attempt for phoneme recognition using Structured Support Vector Machine (SVM)","authors":"Hao Tang, C. Meng, Lin-Shan Lee","doi":"10.1109/ICASSP.2010.5495097","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5495097","url":null,"abstract":"Structured Support Vector Machine (SVM) is a recently developed extension of the very successful SVM approach, which can efficiently classify structured pattern with maximized margin. This paper presents an initial attempt for phoneme recognition using structured SVM. We simply learn the basic framework of HMMs in configuring the structured SVM. In the preliminary experiments with TIMIT corpus, the proposed approach was able to offer an absolute performance improvement of 1.33% over HMMs even with a highly simplified initial approach, probably because of the concept of maximized margin of SVM. We see the potential of this approach because of the high generality, high flexibility, and high power of structured SVM.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115979403","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}
{"title":"Morphological and syntactic features for Arabic speech recognition","authors":"H. Kuo, L. Mangu, Ahmad Emami, I. Zitouni","doi":"10.1109/ICASSP.2010.5495010","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5495010","url":null,"abstract":"In this paper, we study the use of morphological and syntactic context features to improve speech recognition of a morphologically rich language like Arabic. We examine a variety of syntactic features, including part-of-speech tags, shallow parse tags, and exposed head words and their non-terminal labels both before and after the word to be predicted. Neural network LMs are used to model these features since they generalize better to unseen events by modeling words and other context features in continuous space. Using morphological and syntactic features, we can improve the word error rate (WER) significantly on various test sets, including EVAL'08U, the unsequestered portion of the DARPA GALE Phase 3 evaluation test set.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131970608","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}
{"title":"A robust morphological gradient estimator and edge detector for color images","authors":"E. Nezhadarya, R. Ward","doi":"10.1109/ICASSP.2010.5495336","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5495336","url":null,"abstract":"A new vector-wise scheme for the gradient estimation and edge detection in noisy color images is proposed. In color images, different types of noise may corrupt the image. To reduce the effects of noise in the gradient estimation, we introduce the RCMG-Median- Mean estimator. RCMG-Median-Mean is a combination of the robust color morphological gradient (RCMG), the median and the mean filters to accurately estimate both the gradient magnitude and the gradient direction at each pixel of a noisy color image. The simulation results show that the proposed method more accurately estimates the true gradient vector, has better corner detection and leads to better continuous edges with less computational complexity than the RCMG method.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132420645","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}
{"title":"Linear feature extraction using sufficient statistic","authors":"M. Mahanta, K. Plataniotis","doi":"10.1109/ICASSP.2010.5495765","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5495765","url":null,"abstract":"The objective in feature extraction is to compress the data while maintaining the same Bayes classification error as on the original data. This objective is achieved by a sufficient statistic with the minimum dimension. This paper derives a non-iterative linear feature extractor that approximates the minimal-dimension linear sufficient statistic operator for the classification of Gaussian distributions. This new framework alleviates the bias of an existing similar formulation towards the parameters of a reference class. Moreover, it is a heteroscedastic extension of linear discriminant analysis and captures the discriminative information in the first and second central moments of the data. The proposed method can improve the performance of the similar feature extractors while imposing equal, or even lower, computational complexity.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130198143","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}
{"title":"Bidirectional relaying in wireless networks-impact of degree of coordination","authors":"R. F. Wyrembelski, I. Bjelakovic, H. Boche","doi":"10.1109/ICASSP.2010.5496051","DOIUrl":"https://doi.org/10.1109/ICASSP.2010.5496051","url":null,"abstract":"The concept of bidirectional relaying is a key technique to improve the performance in wireless networks such as sensor, ad-hoc, and even cellular systems. It applies to three-node networks, where a relay node establishes a bidirectional communication between two other nodes using a decode-and-forward protocol. We assume that the communication is disturbed by unknown varying interference and analyze the impact of the degree of coordination. We show that the unknown variation of the interference has a dramatic impact on the communication. For traditional interference coordination it can lead to channels which completely prohibit any reliable communication. Anyhow, by allowing a relay-to-receivers coordination, communication can also be established in such situations where the traditional approach fails.","PeriodicalId":293333,"journal":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134208202","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}