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

筛选
英文 中文
Towards dictionary learning from images with non Gaussian noise 基于非高斯噪声图像的字典学习
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349731
P. Chainais
{"title":"Towards dictionary learning from images with non Gaussian noise","authors":"P. Chainais","doi":"10.1109/MLSP.2012.6349731","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349731","url":null,"abstract":"We address the problem of image dictionary learning from noisy images with non Gaussian noise. This problem is difficult. As a first step, we consider the extreme sparse code given by vector quantization, i.e. each pixel is finally associated to 1 single atom. For Gaussian noise, the natural solution is K-means clustering using the sum of the squares of differences between gray levels as the dissimilarity measure between patches. For non Gaussian noises (Poisson, Gamma,...), a new measure of dissimilarity between noisy patches is necessary. We study the use of the generalized likelihood ratios (GLR) recently introduced by Deledalle et al. in [1] to compare non Gaussian noisy patches. We propose a K-medoids algorithm generalizing the usual Linde-Buzo-Gray K-means using the GLR based dissimilarity measure. We obtain a vector quantization which provides a dictionary that can be very large and redundant. We illustrate our approach by dictionaries learnt from images featuring non Gaussian noise, and present preliminary denoising results.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117277229","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
Identifying modular relations in complex brain networks 识别复杂大脑网络中的模块关系
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349739
Kasper Winther Andersen, Morten Mørup, H. Siebner, Kristoffer Hougaard Madsen, L. K. Hansen
{"title":"Identifying modular relations in complex brain networks","authors":"Kasper Winther Andersen, Morten Mørup, H. Siebner, Kristoffer Hougaard Madsen, L. K. Hansen","doi":"10.1109/MLSP.2012.6349739","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349739","url":null,"abstract":"We evaluate the infinite relational model (IRM) against two simpler alternative nonparametric Bayesian models for identifying structures in multi subject brain networks. The models are evaluated for their ability to predict new data and infer reproducible structures. Prediction and reproducibility are measured within the data driven NPAIRS split-half framework. Using synthetic data drawn from each of the generative models we show that the IRM model outperforms the two competing models when data contain relational structure. For data drawn from the other two simpler models the IRM does not overfit and obtains comparable reproducibility and predictability. For resting state functional magnetic resonance imaging data from 30 healthy controls the IRM model is also superior to the two simpler alternatives, suggesting that brain networks indeed exhibit universal complex relational structure in the population.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122777863","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}
引用次数: 13
The eighth annual MLSP competition: Overview 第八届年度MLSP竞赛:概述
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349769
Ken Montanez, Weifeng Liu, V. Calhoun, Catherine Huang, K. Hild
{"title":"The eighth annual MLSP competition: Overview","authors":"Ken Montanez, Weifeng Liu, V. Calhoun, Catherine Huang, K. Hild","doi":"10.1109/MLSP.2012.6349769","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349769","url":null,"abstract":"This marks the eighth year the Machine Learning for Signal Processing (MLSP) Technical Committee has hosted a data analysis competition, which is held in conjunction with the annual MLSP workshop. For this year's competition, which was sponsored by Amazon Corporation, entrants were asked to write an algorithm that attempts to automatically provision an employee's access to company resources in an optimal manner. In this paper, we (the organizers of the competition) briefly describe the application, the data, the rules, and the outcomes of the competition. A total of 4 teams entered the contest. We provided real (declassified) training data to the entrants and tested the algorithms using disjoint test data. The two teams with the best performing entries describe the approach they used in two separate companion papers, both of which appear in this year's conference proceedings.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122648513","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}
引用次数: 10
Online learning for quality-driven unequal protection of scalable video 以质量为导向的在线学习对可扩展视频的不平等保护
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349781
A. Khalek, C. Caramanis, R. Heath
{"title":"Online learning for quality-driven unequal protection of scalable video","authors":"A. Khalek, C. Caramanis, R. Heath","doi":"10.1109/MLSP.2012.6349781","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349781","url":null,"abstract":"Video packet losses affect perceived video quality non-uniformly due to several factors related to video encoding such as inter-frame coding and motion compensation as well as due to psycho-visual perception of natural scenes with unequal motion. This motivates protecting video packets unequally based on their loss visibility. This paper proposes an adaptive online algorithm for unequal error protection driven by two key motivations: On one hand, for real-time video, where a video sequence is not pre-encoded, an offline approach is infeasible and determining the unequal protection levels to maintain a target video quality level must be performed online. On the other hand, an online approach enables adapting to scene changes as well as changes in video temporal and spatial characteristics. The proposed online algorithm uses local linear regression to learn the mapping between packet losses from each scalable video layer and quality degradation without assuming an underlying statistical model. The notion of locality captures the similarity in video scene characteristics as well as proximity in time. The algorithm provably guarantees an average target video quality level and converges rapidly to a stable solution. Furthermore, it provides a bias/variance tradeoff between factual estimation of loss visibility and fine adaptation to the changing video temporal characteristics.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116847385","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
Haussdorff and hellinger for colorimetric sensor array classification
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349724
T. S. Alstrøm, B. S. Jensen, Mikkel N. Schmidt, N. Kostesha, J. Larsen
{"title":"Haussdorff and hellinger for colorimetric sensor array classification","authors":"T. S. Alstrøm, B. S. Jensen, Mikkel N. Schmidt, N. Kostesha, J. Larsen","doi":"10.1109/MLSP.2012.6349724","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349724","url":null,"abstract":"Development of sensors and systems for detection of chemical compounds is an important challenge with applications in areas such as anti-terrorism, demining, and environmental monitoring. A newly developed colorimetric sensor array is able to detect explosives and volatile organic compounds; however, each sensor reading consists of hundreds of pixel values, and methods for combining these readings from multiple sensors must be developed to make a classification system. In this work we examine two distance based classification methods, K-Nearest Neighbor (KNN) and Gaussian process (GP) classification, which both rely on a suitable distance metric. We evaluate a range of different distance measures and propose a method for sensor fusion in the GP classifier. Our results indicate that the best choice of distance measure depends on the sensor and the chemical of interest.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123208638","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
Simultaneous and proportional control of 2D wrist movements with myoelectric signals 用肌电信号同时和比例控制二维手腕运动
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349712
J. Hahne, Hubertus Rehbaum, F. Biessmann, F. Meinecke, K. Müller, N. Jiang, D. Farina, L. Parra
{"title":"Simultaneous and proportional control of 2D wrist movements with myoelectric signals","authors":"J. Hahne, Hubertus Rehbaum, F. Biessmann, F. Meinecke, K. Müller, N. Jiang, D. Farina, L. Parra","doi":"10.1109/MLSP.2012.6349712","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349712","url":null,"abstract":"Previous approaches for extracting real-time proportional control information simultaneously for multiple degree of Freedom(DoF) from the electromyogram (EMG) often used non-linear methods such as the multilayer perceptron (MLP). In this pilot study we show that robust control is also possible with conventional linear regression if EMG power measures are available for a large number of electrodes. In particular, we show that it is possible to linearize the problem with simple nonlinear transformations of band-pass power. Because of its simplicity the method scales well to high dimensions, is easily regularized when insufficient training data is available, and is particularly well suited for real-time control as well as on-line optimization.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128017751","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}
引用次数: 34
Helicopter vibration sensor selection using data visualisation 利用数据可视化选择直升机振动传感器
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349808
W. S. Gill, I. Nabney, D. Wells
{"title":"Helicopter vibration sensor selection using data visualisation","authors":"W. S. Gill, I. Nabney, D. Wells","doi":"10.1109/MLSP.2012.6349808","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349808","url":null,"abstract":"The main objective of the project† is to enhance the already effective health-monitoring system (HUMS) for helicopters by analysing structural vibrations to recognise different flight conditions directly from sensor information. The goal of this paper is to develop a new method to select those sensors and frequency bands that are best for detecting changes in flight conditions. We projected frequency information to a 2-dimensional space in order to visualise flight-condition transitions using the Generative Topographic Mapping (GTM) and a variant which supports simultaneous feature selection. We created an objective measure of the separation between different flight conditions in the visualisation space by calculating the Kullback-Leibler (KL) divergence between Gaussian mixture models (GMMs) fitted to each class: the higher the KL-divergence, the better the interclass separation. To find the optimal combination of sensors, they were considered in pairs, triples and groups of four sensors. The sensor triples provided the best result in terms of KL-divergence. We also found that the use of a variational training algorithm for the GMMs gave more reliable results.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133073670","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 SIFT-point distribution-based method for head pose estimation 基于sift点分布的头部姿态估计方法
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349751
Nastaran Ghadarghadar, E. Cansizoglu, Peng Zhang, Deniz Erdoğmuş
{"title":"A SIFT-point distribution-based method for head pose estimation","authors":"Nastaran Ghadarghadar, E. Cansizoglu, Peng Zhang, Deniz Erdoğmuş","doi":"10.1109/MLSP.2012.6349751","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349751","url":null,"abstract":"Estimating the head pose of a person in a video or image sequence is a challenging problem in computer vision. In this paper, we present a new technique on how to estimate the human face pose from a video sequence, by creating a probabilistic model based on the scale invariant features of the face. This method consists of four major steps: (1) the face is detected using the basic CAMSHIFT algorithm, (2) a training dataset is created for each face pose, (3) the distinctive invariant features of the training and test face image sets are extracted using the scale-invariant feature transform (SIFT) algorithm, (4) a kernel density estimate (KDE) of SIFT points on each image is generated. Pose classification is achieved by nearest-neighbor search using a KDE overlap measure. Results indicate that the proposed method is robust, accurate, not computationally expensive, and can successfully be used for pose estimation.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131417029","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
Local linear approximation of principal curve projections 主曲线投影的局部线性逼近
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349764
Peng Zhang, E. Cansizoglu, Deniz Erdoğmuş
{"title":"Local linear approximation of principal curve projections","authors":"Peng Zhang, E. Cansizoglu, Deniz Erdoğmuş","doi":"10.1109/MLSP.2012.6349764","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349764","url":null,"abstract":"In previous work we introduced principal surfaces as hyperridges of probability distributions in a differential geometrical sense. Specifically, given an n-dimensional probability distribution over real-valued random vectors, a point on the d-dimensional principal surface is a local maximizer of the distribution in the subspace orthogonal to the principal surface at that point. For twice continuously differentiable distributions, the surface is characterized by the gradient and the Hessian of the distribution. Furthermore, the nonlinear projections of data points to the principal surface for dimension reduction is ideally given by the solution trajectories of differential equations that are initialized at the data point and whose tangent vectors are determined by the Hessian eigenvectors. In practice, data dimension reduction using numerical integration based differential equation solvers are found to be computationally expensive for most machine learning applications. Consequently, in this paper, we propose a local linear approximation to achieve this dimension reduction without significant loss of accuracy while reducing computational complexity. The proposed method is demonstrated on synthetic datasets.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122017117","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
Nonlinear data description with Principal Polynomial Analysis 基于主多项式分析的非线性数据描述
2012 IEEE International Workshop on Machine Learning for Signal Processing Pub Date : 2012-11-12 DOI: 10.1109/MLSP.2012.6349786
Valero Laparra, D. Tuia, S. Jiménez, Gustau Camps-Valls, J. Malo
{"title":"Nonlinear data description with Principal Polynomial Analysis","authors":"Valero Laparra, D. Tuia, S. Jiménez, Gustau Camps-Valls, J. Malo","doi":"10.1109/MLSP.2012.6349786","DOIUrl":"https://doi.org/10.1109/MLSP.2012.6349786","url":null,"abstract":"Principal Component Analysis (PCA) has been widely used for manifold description and dimensionality reduction. Performance of PCA is however hampered when data exhibits nonlinear feature relations. In this work, we propose a new framework for manifold learning based on the use of a sequence of Principal Polynomials that capture the eventually nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) is shown to generalize PCA. Unlike recently proposed nonlinear methods (e.g. spectral/kernel methods and projection pursuit techniques, neural networks), PPA features are easily interpretable and the method leads to a fully invertible transform, which is a desirable property to evaluate performance in dimensionality reduction. Successful performance of the proposed PPA is illustrated in dimensionality reduction, in compact representation of non-Gaussian image textures, and multispectral image classification.","PeriodicalId":262601,"journal":{"name":"2012 IEEE International Workshop on Machine Learning for Signal Processing","volume":"13 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120839862","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}
引用次数: 10
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学术官方微信