2011 10th International Conference on Machine Learning and Applications and Workshops最新文献

筛选
英文 中文
Estimation of PSF for a Shaking Blurred Image Using GA 用遗传算法估计抖动模糊图像的PSF
Takumi Shimomukai, M. Yoshioka, H. Yanagimoto
{"title":"Estimation of PSF for a Shaking Blurred Image Using GA","authors":"Takumi Shimomukai, M. Yoshioka, H. Yanagimoto","doi":"10.1109/ICMLA.2011.165","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.165","url":null,"abstract":"Development of downsized digital cameras causes a lot of undesirable shaking blurred images. In order to restore these images, we need to estimate the PSF (Point Spread Function) from them. It has been proposed to estimate the PSF using cepstrum images. There are the PSF features in the cepstrum images of blurred images. We can estimate the PSF by searching pixels in the cepstrum images. However, cepstrum images also show features of ground truth images which don't have effects from shaking, so we can't estimate the PSF accurately. We propose an estimation method of the PSF by using GA.We adopt the cepstrum images as a fitness function,thus the estimation results aren't affected by other features in cepstrum images.We have just confirmed the effectiveness of our proposed method by using some simulations.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117258359","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
Multiple Nonlinear Subspace Methods Using Subspace-based Support Vector Machines 基于子空间支持向量机的多非线性子空间方法
Takuya Kitamura, S. Abe, Yusuke Tanaka
{"title":"Multiple Nonlinear Subspace Methods Using Subspace-based Support Vector Machines","authors":"Takuya Kitamura, S. Abe, Yusuke Tanaka","doi":"10.1109/ICMLA.2011.100","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.100","url":null,"abstract":"In this paper, we propose multiple nonlinear subspace methods (MNSMs), in which each class consists of several subspaces with different kernel parameters. For each class and each candidate kernel parameter, we generate the subspace by KPCA, and obtain the projection length of an input vector onto each subspace. Then, for each class, we define the discriminant function by the sum of the weighted lengths. These weights in the discriminant function are optimized by subspace-based support vector machines (SS-SVMs) so that the margin between classes is maximized while minimizing the classification error. Thus, we can weight the subspaces for each class from the standpoint of class separability. Then, the computational cost of the model selection of MNSMs is lower than that of SS-SVMs because for SS-SVMs two hyper-parameters, which are the kernel parameter and the margin parameter, must be chosen before training. We show the advantages of the proposed method by computer experiments with benchmark data sets.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123071556","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
Combining Visual and Acoustic Features for Music Genre Classification 结合视觉与听觉特征的音乐类型分类
Ming-Ju Wu, Zhi-Sheng Chen, J. Jang, Jia-Min Ren, Yi-Hsung Li, Chun-Hung Lu
{"title":"Combining Visual and Acoustic Features for Music Genre Classification","authors":"Ming-Ju Wu, Zhi-Sheng Chen, J. Jang, Jia-Min Ren, Yi-Hsung Li, Chun-Hung Lu","doi":"10.1109/ICMLA.2011.48","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.48","url":null,"abstract":"Music genre classification is a challenging task in the field of music information retrieval. Existing approaches usually attempt to extract features only from acoustic aspect. However, spectrogram also provides useful information because it describes the temporal change of energy distribution over frequency bins. In this paper, we propose the use of Gabor filters to generate effective visual features that can capture the characteristics of a spectrogram¡¦s texture patterns. On the other hand, acoustic features are extracted using universal background model and maximum a posteriori adaptation. Based on these two types of features, we then employ SVM to perform the final classification task. Experimental results demonstrate that combining visual and acoustic features can achieve satisfactory classification accuracy on two widely used datasets.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124651080","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}
引用次数: 65
Using Genre Interest of Users to Detect Profile Injection Attacks in Movie Recommender Systems 利用用户类型兴趣检测电影推荐系统中的配置文件注入攻击
Ghazaleh Aghili, M. Shajari, Shahram Khadivi, M. Morid
{"title":"Using Genre Interest of Users to Detect Profile Injection Attacks in Movie Recommender Systems","authors":"Ghazaleh Aghili, M. Shajari, Shahram Khadivi, M. Morid","doi":"10.1109/ICMLA.2011.151","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.151","url":null,"abstract":"While the popularity of recommender systems is growing rapidly in e-commerce services, profile injection attacks are a great threat to their robustness and trustworthiness. Such attacks can be easily produced and inserted in recommender systems to alter the recommendation results. In such systems, attackers intentionally insert attack profiles to change the systems output to their advantage. This paper presents the idea of utilizing a set of genre attributes in order to discriminate between attack and genuine profiles in a movie recommender system. Since attackers typically assign random ratings to the movies in attack profiles, the genre interest of attackers and genuine users who rate movies based on their preferences are different. Based on this idea, we build a system using genre attributes as inputs to a feed forward neural network in order to detect attackers. The performance of our proposed approach is presented and compared to other detection approaches. The results declare superiority of our proposed approach from precision and recall point of view.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122257885","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
Efficient Approximate Semi-supervised Support Vector Machines through Submodular Optimization 基于次模优化的高效近似半监督支持向量机
Wael Emara, M. Kantardzic
{"title":"Efficient Approximate Semi-supervised Support Vector Machines through Submodular Optimization","authors":"Wael Emara, M. Kantardzic","doi":"10.1109/ICMLA.2011.62","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.62","url":null,"abstract":"In this work we present a quadratic programming approximation of the Semi-Supervised Support Vector Machine (S3VM) problem, namely approximate QP-S3VM, that can be efficiently solved using off the shelf optimization packages. We prove that this approximate formulation establishes a relation between the low density separation and the graph-based models of semi-supervised learning (SSL) which is important to develop a unifying framework for semi-supervised learning methods. Furthermore, we propose the novel idea of representing SSL problems as sub modular set functions and use efficient sub-modular optimization algorithms to solve them. Using this new idea we develop a representation of the approximate QP-S3VM as a maximization of a sub modular set function which makes it possible to optimize using efficient greedy algorithms. We demonstrate that the proposed methods are accurate and provide significant improvement in time complexity over the state of the art in the literature.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122345418","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
Predicting Patients Likely to Overstay in Hospitals 预测病人可能在医院逾期居留
R. Vivanco, D. Roberts
{"title":"Predicting Patients Likely to Overstay in Hospitals","authors":"R. Vivanco, D. Roberts","doi":"10.1109/ICMLA.2011.115","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.115","url":null,"abstract":"Patients that remain in the hospital system longer than necessary (overstay patients) represent a sizeable operational cost and contribute to hospital waiting times and bed shortages. Patient data from four hospitals were analyzed in order to build a classifier that would identity patients that are likely to overstay. The patients that overstay often require special assistance, such as nursing home placement or home care arrangements, and need to be identified early in admission so as to schedule a timely discharge from the hospital. Age, co-morbidity and activities of daily living scores (such as ability to dress and feed oneself) were the major factors in determining if a patient is likely to overstay while waiting special dispensation. The aim of the research is to develop a decision support system using machine learning strategies. A decision tree classifier achieved F-Measure of 0.826 identifying overstay patients from a tertiary teaching hospital and an F-Measure of 0.784 at a community hospital.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126712877","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
Active Batch Selection for Fuzzy Classification in Facial Expression Recognition 面部表情识别中模糊分类的主动批选择
Shayok Chakraborty, Hemanth Venkateswara, V. Balasubramanian, S. Panchanathan
{"title":"Active Batch Selection for Fuzzy Classification in Facial Expression Recognition","authors":"Shayok Chakraborty, Hemanth Venkateswara, V. Balasubramanian, S. Panchanathan","doi":"10.1109/ICMLA.2011.22","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.22","url":null,"abstract":"Automated recognition of facial expressions is an important problem in computer vision applications. Due to the vagueness in class definitions, expression recognition is often conceived as a fuzzy label problem. Annotating a data point in such a problem involves significant manual effort. Active learning techniques are effective in reducing human labeling effort to induce a classification model as they automatically select the salient and exemplar instances from vast amounts of unlabeled data. Further, to address the high redundancy in data such as image or video sequences as well as to account for the presence of multiple labeling agents, there have been recent attempts towards a batch mode form of active learning where a batch of data points is selected simultaneously from an unlabeled set. In this paper, we propose a novel optimization-based batch mode active learning technique for fuzzy label classification problems. To the best of our knowledge, this is the first effort to develop such a scheme primarily intended for the fuzzy label context. The proposed algorithm is computationally simple, easy to implement and has provable performance bounds. Our results on facial expression datasets corroborate the efficacy of the framework in reducing human annotation effort in real world recognition applications involving fuzzy labels.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126342380","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
Automatic Dishware Inspection: Applications and Comparisons of Two New Methods 自动餐具检测:两种新方法的应用与比较
Trung H. Duong, Mohsen Emami, L. L. Hoberock
{"title":"Automatic Dishware Inspection: Applications and Comparisons of Two New Methods","authors":"Trung H. Duong, Mohsen Emami, L. L. Hoberock","doi":"10.1109/ICMLA.2011.40","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.40","url":null,"abstract":"Commercial dishwashing systems currently involve human loading, sorting, inspecting, and unloading dishes and silverware pieces before and after washing in hot and humid environments. In such difficult working conditions, leading to high turn-over of low-paid employees, automation is desirable, especially in large-scale kitchens of hospitals, navy ships, schools, hotels and other dining facilities. Our project is a part of developing an integrated machine vision sorting and inspecting system for mixed dish pieces and silverware exiting a flight-type commercial dishwashing machine, coupled with automatic loading and unloading. We propose two new methods for automatically inspecting dish cleanliness, namely adaptive thresholding and maximum saliency map. On the first method, a new technique using partitioning and adaptive thresholding, combined with global thresholding are introduced. On the second method, we propose a new normalization technique. Both algorithms are fast, simple, and produce results invariant with lighting conditions and dish rotation about the camera-dish axis. Algorithms are written and tested by MatlabÒ R14 and Image Processing Toolbox V5.0 to 110 dish images taken in different lighting condition using different position of 51 separate dishes (either clean or dirty) of our dish set, in which 77 images are from dirty dishes with 799 dirty points in these dishes. The adaptive thresholding method produces 95.0% and 96.5% accuracies in discriminating clean from dirty dishes and dirty spot detection, respectively. While the maximum saliency map method produces 100% accuracies in discriminating clean from dirty dishes and 93.5% accuracies in and dirty spot detection.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127926368","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
Dynamic Testing and Calibration of Gaussian Processes for Vehicle Attitude Estimation 车辆姿态估计高斯过程的动态测试与标定
J. Britt, D. Broderick, D. Bevly, J. Hung
{"title":"Dynamic Testing and Calibration of Gaussian Processes for Vehicle Attitude Estimation","authors":"J. Britt, D. Broderick, D. Bevly, J. Hung","doi":"10.1109/ICMLA.2011.61","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.61","url":null,"abstract":"A method of estimating a vehicle's attitude in relation to the road surface using only light detection and ranging (lidar) measurements is presented. Gaussian processes, a machine learning technique, is used to relate the measurements of the road surface to the pitch and roll of the vehicle. Testing was performed under normal driving conditions on a test track as well as under high dynamic maneuvers on a skid-pad to assess performance of the algorithm. On-vehicle results show that the attitude calculations are capable of being implemented in a real-time system and have been compared against a multi-antenna GPS attitude measurement for accuracy.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122232995","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
Error Bounds for Online Predictions of Linear-Chain Conditional Random Fields: Application to Activity Recognition for Users of Rolling Walkers 线性链条件随机场在线预测的误差界:在滚动助行器用户活动识别中的应用
M. Sinn, P. Poupart
{"title":"Error Bounds for Online Predictions of Linear-Chain Conditional Random Fields: Application to Activity Recognition for Users of Rolling Walkers","authors":"M. Sinn, P. Poupart","doi":"10.1109/ICMLA.2011.64","DOIUrl":"https://doi.org/10.1109/ICMLA.2011.64","url":null,"abstract":"Linear-Chain Conditional Random Fields (L-CRFs) are a versatile class of models for the distribution of a sequence of hidden states (\"labels\") conditional on a sequence of observable variables. In general, the exact conditional marginal distributions of the labels can be computed only after the complete sequence of observations has been obtained, which forbids the prediction of labels in an online fashion. This paper considers approximations of the marginal distributions which only take into account past observations and a small number of observations in the future. Based on these approximations, labels can be predicted close to real-time. We establish rigorous bounds for the marginal distributions which can be used to assess the approximation error at runtime. We apply the results to an L-CRF which recognizes the activity of rolling walker users from a stream of sensor data. It turns out that if we allow for a prediction delay of half of a second, the online predictions achieve almost the same accuracy as the offline predictions based on the complete observation sequences.","PeriodicalId":439926,"journal":{"name":"2011 10th International Conference on Machine Learning and Applications and Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133209774","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
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学术文献互助群
群 号:481959085
Book学术官方微信