2008 IEEE Workshop on Machine Learning for Signal Processing最新文献

筛选
英文 中文
A Dirichlet process mixture of dirichlet distributions for classification and prediction 用于分类和预测的狄利克雷分布混合过程
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685496
N. Bouguila, D. Ziou
{"title":"A Dirichlet process mixture of dirichlet distributions for classification and prediction","authors":"N. Bouguila, D. Ziou","doi":"10.1109/MLSP.2008.4685496","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685496","url":null,"abstract":"A significant problem in clustering is the determination of the number of classes which best describes the data. This paper proposes a learning approach based on both Dirichlet process and Dirichlet distribution which provide flexible nonparametric Bayesian framework for non-Gaussian data clustering. Our approach is Bayesian and relies on the estimation of the posterior distribution of clusterings using Gibbs sampler. The experimental results involve data classification and image models prediction, and show the merits of our approach.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133111137","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}
引用次数: 58
Comparing measures of sparsity 比较稀疏度的度量
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685455
Niall P. Hurley, S. Rickard
{"title":"Comparing measures of sparsity","authors":"Niall P. Hurley, S. Rickard","doi":"10.1109/MLSP.2008.4685455","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685455","url":null,"abstract":"Sparsity is a recurrent theme in machine learning and is used to improve performance of algorithms such as non-negative matrix factorization and the LOST algorithm. Our aim in this paper is to compare several commonly-used sparsity measures according to intuitive attributes that a sparsity measure should have. Sparsity of representations of signals in fields such as blind source separation, compression, sampling and signal analysis has proved not just to be useful but a key factor in the success of algorithms in these areas. Intuitively, a sparse representation is one in which a small number of coefficients contain a large proportion of the energy. In this paper we discuss six properties (robin hood, scaling, rising tide, cloning, bill gates and babies) that we believe a sparsity measure should have. The main contribution of this paper is a table which classifies commonly-used sparsity measures based on whether or not they satisfy these six propositions. Only one of these measures satisfies all six: the Gini index.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133857171","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
Multi-feature audio-visual person recognition 多特征视听人物识别
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685484
A. Das, O. K. Manyam, Makarand Tapaswi
{"title":"Multi-feature audio-visual person recognition","authors":"A. Das, O. K. Manyam, Makarand Tapaswi","doi":"10.1109/MLSP.2008.4685484","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685484","url":null,"abstract":"We propose a high-performance low-complexity audio-visual person recognition framework suitable for on-line user authentication for various web-applications which delivers robustness against various types of imposter attacks by capturing face and speech dynamics from the video of the user. Instead of using the traditional frontal-face image, a set of compressed face profile vectors are extracted from multiple poses of the person. Similarly, multiple user-selected passwords are used to create robustness against imposter attacks. A novel FGRAM-CFD speech feature is proposed which captures the identity of the user from the speech dynamics contained in the password. The novel signal processing methods proposed here for speech and face feature-extraction led to high discriminative power of the combined audio-visual features. This allowed the classifier to remain simple, yet delivering a reasonably high performance at significantly low complexity as demonstrated by our trials on a 210-user audio-visual biometric database created for this research.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114811002","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
DS/CDMA linear receiver based on Krylov-proportionate adaptive filtering technique—an extension to complex-valued signals 基于krylov比例自适应滤波技术的DS/CDMA线性接收机——复值信号的扩展
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685474
Masahiro Yukawa
{"title":"DS/CDMA linear receiver based on Krylov-proportionate adaptive filtering technique—an extension to complex-valued signals","authors":"Masahiro Yukawa","doi":"10.1109/MLSP.2008.4685474","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685474","url":null,"abstract":"This paper presents a novel training-based adaptive linear receiver to suppress the multiple access interference, which has been one of the central issues in DS/CDMA wireless communication systems. The proposed receiver is derived by extending the Krylov-proportionate normalized least-mean-square (KPNLMS) algorithm to complex-valued signals. The key idea of KPNLMS is (a) sparse representation of the minimum mean square error (MMSE) receiver based on a certain Krylov subspace, (b) use of the dasiasparsitypsila for fast convergence, and (c) simplification to keep linear complexity per iteration. To clarify the convergence properties of the proposed receiver, its derivation from the variable-metric version of the adaptive projected subgradient method (V-APSM) is presented. The simulation results demonstrate the efficacy of the proposed receiver.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132516136","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
Comparison of a distance-based likelihood ratio test and k-nearest neighbor classification methods 基于距离的似然比检验和k近邻分类方法的比较
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685507
J. Remus, K. Morton, P. Torrione, S. Tantum, L. Collins
{"title":"Comparison of a distance-based likelihood ratio test and k-nearest neighbor classification methods","authors":"J. Remus, K. Morton, P. Torrione, S. Tantum, L. Collins","doi":"10.1109/MLSP.2008.4685507","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685507","url":null,"abstract":"Several studies of the k-nearest neighbor (KNN) classifier have proposed the use of non-uniform weighting on the k neighbors. It has been suggested that the distance to each neighbor can be used to calculate the individual weights in a weighted KNN approach; however, a consensus has not yet been reached on the best method or framework for calculating weights using the distances. In this paper, a distance likelihood ratio test was discussed and evaluated using simulated data. The distance likelihood ratio test (DLRT) shares several characteristics with the distance-weighted k-nearest neighbor methods but approaches the use of distance from a different perspective. Results illustrate the ability of the distance likelihood ratio test to approximate the likelihood ratio and compare the DLRT to two other k-neighborhood classification rules that utilize distance-weighting. The DLRT performs favorably in comparisons of the classification performance using the simulated data and provides an alternative non-parametric classification method for consideration when designing a distance-weighted KNN classification rule.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132611847","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}
引用次数: 19
Human body modeling with partial self occlusion from monocular camera 单目相机局部自遮挡人体建模
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685478
Chih-Chang Yu, Hsu-Yung Cheng, Jenq-Neng Hwang, Kuo-Chin Fan
{"title":"Human body modeling with partial self occlusion from monocular camera","authors":"Chih-Chang Yu, Hsu-Yung Cheng, Jenq-Neng Hwang, Kuo-Chin Fan","doi":"10.1109/MLSP.2008.4685478","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685478","url":null,"abstract":"Automated human body modeling from monocular video sequences is a challenging task because humans may possess very sophisticated postures with various types of motions. The self-occlusion problem often makes body parts invisible in a period of time. In this paper, we propose an automated contour-based 2D human modeling system which is able to deal with partial self-occlusion problem. The 2D human silhouette is decomposed into several essential parts with a step-by-step approach starting with head extraction, torso extraction, and followed by probabilistic limb configuration estimation. The modeling mechanism only uses basic human kinematic constraints and no predefined motion models are required. In this paper, without loss of generality, we demonstrate two types of human motion in the experiments and show that our approach can successfully extract 2D human body parts with partial occlusions and unpredictable torso orientation under a monocular view. The successful development of this framework can eventually be applied to all kinds of human centric event detection and behavior understanding.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134430208","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
A new least squares adaptation scheme for the affine combination of two adaptive filters 两个自适应滤波器仿射组合的一种新的最小二乘自适应方案
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685501
L. A. Azpicueta-Ruiz, A. Figueiras-Vidal, J. Arenas-García
{"title":"A new least squares adaptation scheme for the affine combination of two adaptive filters","authors":"L. A. Azpicueta-Ruiz, A. Figueiras-Vidal, J. Arenas-García","doi":"10.1109/MLSP.2008.4685501","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685501","url":null,"abstract":"Adaptive combinations of adaptive filters are an efficient approach to alleviate the different tradeoffs to which adaptive filters are subject. The basic idea is to mix the outputs of two adaptive filters with complementary capabilities, so that the combination is able to retain the best properties of each component. In previous works, we proposed to use a convex combination, applying weights lambda(n) and 1-lambda(n), with lambda(n) isin (0,1), to the filter components, where the mixing parameter lambda(n) was updated to minimize the overall square error using stochastic gradient descent rules. In this paper, we present a new adaptation scheme for lambda(n) based on the solution to a least-squares (LS) problem, where the mixing parameter is allowed to lie outside range [0,1]. Such affine combinations have recently been shown to provide additional gains. Unlike some previous proposals, the new LS combination scheme does not require any explicit knowledge about the component filters. The ability of the LS scheme to achieve optimal values of the mixing parameter is illustrated with several experiments in both stationary and tracking situations.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"300 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133843311","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}
引用次数: 20
Reduction of non-stationary noise using a non-negative latent variable decomposition 使用非负潜变量分解减少非平稳噪声
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685528
Mikkel N. Schmidt, J. Larsen
{"title":"Reduction of non-stationary noise using a non-negative latent variable decomposition","authors":"Mikkel N. Schmidt, J. Larsen","doi":"10.1109/MLSP.2008.4685528","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685528","url":null,"abstract":"We present a method for suppression of non-stationary noise in single channel recordings of speech. The method is based on a non-negative latent variable decomposition model for the speech and noise signals, learned directly from a noisy mixture. In non-speech regions an over complete basis is learned for the noise that is then used to jointly estimate the speech and the noise from the mixture. We compare the method to the classical spectral subtraction approach, where the noise spectrum is estimated as the average over non-speech frames. The proposed method significantly outperforms the classic approach, especially when the noise is highly non-stationary and at low signal-to-noise ratios.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116107651","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}
引用次数: 29
Generalization performance analysis of flow-based peer-to-peer traffic identification 基于流量的点对点流量识别泛化性能分析
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685491
Yi-Hsien Wang, V. Gau, T. Bosaw, Jenq-Neng Hwang, A. Lippman, D. Lieberman, I-Chen Wu
{"title":"Generalization performance analysis of flow-based peer-to-peer traffic identification","authors":"Yi-Hsien Wang, V. Gau, T. Bosaw, Jenq-Neng Hwang, A. Lippman, D. Lieberman, I-Chen Wu","doi":"10.1109/MLSP.2008.4685491","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685491","url":null,"abstract":"In this paper, we develop a peer-to-peer (P2P) traffic identifier to facilitate quality of service (QoS) control in edge routers. Currently, since P2P applications consume a great percentage of Internet bandwidth, certain network optimization strategies are needed to improve the network performance. Traffic identification is the most important component that could be adopted in these optimization strategies. In this paper, we focus on developing a machine learning strategy to perform quick identification, and continuous tracking of flows associated with various P2P media streaming and file sharing applications. With the use of Random Forests (RF) and evaluated by using 10-fold cross validation, our method achieves greater than 98% accuracy rate and 89% precision rate of identifying the P2P flows, with less than 1% false positive rate. With the help of winner-take-all strategy, the generalization performance of using the RF built with data collected from one network to classify flows in other networks can achieve accuracy of being over 97%, with the precision being over 81% and the FP rate being below 2%.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125487509","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
Constrained adaptive learning in Reproducing Kernel Hilbert Spaces: The beamforming paradigm 核希尔伯特空间再现中的约束自适应学习:波束形成范式
2008 IEEE Workshop on Machine Learning for Signal Processing Pub Date : 2008-11-21 DOI: 10.1109/MLSP.2008.4685451
K. Slavakis, S. Theodoridis, I. Yamada
{"title":"Constrained adaptive learning in Reproducing Kernel Hilbert Spaces: The beamforming paradigm","authors":"K. Slavakis, S. Theodoridis, I. Yamada","doi":"10.1109/MLSP.2008.4685451","DOIUrl":"https://doi.org/10.1109/MLSP.2008.4685451","url":null,"abstract":"This paper presents a novel framework for constrained adaptive learning in reproducing kernel Hilbert spaces (RKHS). A low complexity algorithmic solution is established. Constraints that encode a-priori information and several design specifications take the form of multiple intersecting closed convex sets. A cost function and the training data stream create a sequence of closed convex sets in the RKHS. The resulting recursive solution generates a sequence of estimates which converges to such an infinite intersection of closed convex sets. A time-adaptive beamforming task in an RKHS, rich in constraints, is also established. The numerical results show that the proposed method exhibits a significant improvement in resolution, when compared to the classical linear solution, and outperforms a recently unconstrained online kernel-based regression technique.","PeriodicalId":447191,"journal":{"name":"2008 IEEE Workshop on Machine Learning for Signal Processing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114730380","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学术官方微信
小红书