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

2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)最新文献

筛选
英文 中文
Generalized antisymmetric filters for edge detection 边缘检测的广义反对称滤波器
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054137
N. Madrid, C. López-Molina, B. Baets
{"title":"Generalized antisymmetric filters for edge detection","authors":"N. Madrid, C. López-Molina, B. Baets","doi":"10.1109/SOCPAR.2013.7054137","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054137","url":null,"abstract":"A large number of filters has been proposed to compute local gradients in grayscale images, usually having as goal the adequate characterization of edges. A significant portion of such filters are antisymmetric with respect to the origin. In this work we propose to generalize those filters by incorporating an explicit evaluation of the tonal difference. More specifically, we propose to apply restricted dissimilarity functions to appropriately measure the tonal differences. We present the mathematical developments, as well as quantitative experiments that indicate that our proposal offers a clear option to improve the performance of classical edge detection filters.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117336032","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
Improved personal identification method for guide robots using dress color information via KINECT 基于KINECT的引导机器人服装颜色信息识别方法的改进
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054111
Seiji Sugiyama, T. Wada
{"title":"Improved personal identification method for guide robots using dress color information via KINECT","authors":"Seiji Sugiyama, T. Wada","doi":"10.1109/SOCPAR.2013.7054111","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054111","url":null,"abstract":"In this paper, a Simple Personal Identification (SPI) method using Dress Color Information (DCI) for guide robots is proposed. The DCI is a small number of color information that is only calculated at narrow areas around a user's (guided person's) joint positions obtained via KINECT on a mobile robot. The SPI method includes not only the person's skeletal information but also the DCI. This method can identify the specific user in real time. As a result, even if the mobile robot loses the user temporarily when there are many people present, it can find the user properly and promptly. Our previous research had four problems as follows: 1) there is a position error between skeletal joint positions and pixel positions in RGBA camera image, 2) the narrow areas around joint positions often overflows from the dress areas, 3) changing lighting environments causes wrong results, and 4) the personal conformity is unstable. To cope with these difficulties, an improved calculating method using correction functions and color information of all joint points as a vector different from previous method is proposed in this research. The experimental results show the accuracy of our new method.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115393923","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
Object tracking simulates babysitter vision robot using GMM 利用GMM对保姆视觉机器人进行对象跟踪仿真
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054101
Hanan Aljuaid, D. Mohamad
{"title":"Object tracking simulates babysitter vision robot using GMM","authors":"Hanan Aljuaid, D. Mohamad","doi":"10.1109/SOCPAR.2013.7054101","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054101","url":null,"abstract":"Numerous image-processing technologies are essential in order to recognize an object. Object detection depends on the time-sequence of the video frames. Furthermore, manifold object tracking should be done in the line of the computer's vision. To simulate a babysitter's vision, our application was developed to track objects in a scene with the main goal of creating a reliable and operative moving child-object detection system. The aim of this paper is to explore novel algorithms to track a child-object in an indoor and outdoor background video. It focuses on tracking a whole child-object while simultaneously tracking the body parts of that object to produce a positive system. This effort suggests an approach for labeling three body sections, i.e., the head, upper, and lower sections, and then for detecting a specific area within the three sections, and tracking this section using a Gaussian mixture model (GMM) algorithm according to the labeling technique. The system is applied in three situations: child-object walking, crawling, and seated moving. During system experimentation, walking object tracking provided the best performance, achieving 91.932% for body-part tracking and 96.235% for whole-object tracking. Crawling object tracking achieved 90.832% for body-part tracking and 96.231% for whole-object tracking. Finally, seated-moving-object tracking achieved 89.7% for body-part tracking and 93.4% for whole-object tracking.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128858177","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
A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem 基于动态规划的混合遗传算法求解旅行商问题综述
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054102
Pham Dinh Thanh, Huynh Thi Thanh Binh, L. Bui
{"title":"A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem","authors":"Pham Dinh Thanh, Huynh Thi Thanh Binh, L. Bui","doi":"10.1109/SOCPAR.2013.7054102","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054102","url":null,"abstract":"Traveling Salesman Problem (TSP) is a well-known NP-hard problem. Many algorithms were developed to solve this problem and gave the nearly optimal solutions within reasonable time. This paper presents a survey about the combination Genetic Algorithm (GA) with Dynamic Programming (DP) for solving TSP. We also setup a combination between GA and DP for this problem and experimented on 7 Euclidean instances derived from TSP-lib. Experimental results are reported to show the efficiency of the experimented algorithm comparing to the genetic algorithm.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129823936","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}
引用次数: 14
Document clustering using mixture model of von Mises-Fisher distributions on document manifold 文档流形上von Mises-Fisher分布混合模型的文档聚类
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054116
N. K. Anh, Tam The Nguyen, Ngo Van Linh
{"title":"Document clustering using mixture model of von Mises-Fisher distributions on document manifold","authors":"N. K. Anh, Tam The Nguyen, Ngo Van Linh","doi":"10.1109/SOCPAR.2013.7054116","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054116","url":null,"abstract":"Document clustering has become an increasingly important technique for unsupervised document organization, automatic topic extraction, and fast information retrieval or filtering. The generative model for document clustering based on the von Mises-Fisher (vMF) distribution generally produces better clustering results than other generative models. However, in fact, it is more natural and reasonable to assume that the document space is a manifold and the probability distribution that generates the data is supported on a document manifold. In this paper, we propose a regularized probabilistic model based on manifold structure for data clustering, called Laplacian regularized vMF Mixture Model (LapvMFs), which explicitly considers the manifold structure. We have developed a generalized mean-field variational inference algorithm for the LapvMFs. Extensive experimental results on a large number of high dimensional text datasets demonstrate that our approach outperforms the three state-of-the-art clustering algorithms.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125522775","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
An application of fuzzy geographically clustering for solving the Cold-Start problem in recommender systems 模糊地理聚类在推荐系统冷启动问题中的应用
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054096
Le Hoang Son, Khuat Manh Cuong, N. Minh, N. Canh
{"title":"An application of fuzzy geographically clustering for solving the Cold-Start problem in recommender systems","authors":"Le Hoang Son, Khuat Manh Cuong, N. Minh, N. Canh","doi":"10.1109/SOCPAR.2013.7054096","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054096","url":null,"abstract":"In this paper, we present a novel method based on fuzzy geographically clustering to solve the Cold-Start problem in Recommender Systems occurring when a new user is migrated into the system. The proposed method can handle the issues of selected demographic attributes, the similarities between items and missing ratings that existed in relevant demographic-based algorithms. Numerical examples are given to illustrate the proposed method. Experimental results show that the new method has better accuracy than other relevant ones.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126158402","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}
引用次数: 14
Intuitionistic type-2 fuzzy set approach to image thresholding 直观的2型模糊集图像阈值分割方法
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054128
Tarn Van Nghiem, D. Nguyen, L. Ngo
{"title":"Intuitionistic type-2 fuzzy set approach to image thresholding","authors":"Tarn Van Nghiem, D. Nguyen, L. Ngo","doi":"10.1109/SOCPAR.2013.7054128","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054128","url":null,"abstract":"In this paper, an image thresholding method based on Intuitionistic Type-2 Fuzzy Sets (InT2FS) method is introduced for the segmentation problems. Besides, intuitionistic type-2 fuzzy set has been formed as an extension of intuitionistic fuzzy set for handling uncertainty. As we know, the image data which usually contains noises or uncertainty so then utilizing the advantages of the InT2FS, we have introduced a thresholding algorithm using InT2FS for image thresholding. Experimental results with different types of images show that the proposed algorithm is better than the traditional thresholding algorithms especially with noisy images.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"65 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120896053","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
Evolutionary approaches for pooling classifier ensembles: Performance evaluation 池化分类器集成的进化方法:性能评估
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054149
C. Stefano, A. D. Cioppa, A. Marcelli
{"title":"Evolutionary approaches for pooling classifier ensembles: Performance evaluation","authors":"C. Stefano, A. D. Cioppa, A. Marcelli","doi":"10.1109/SOCPAR.2013.7054149","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054149","url":null,"abstract":"We introduce a multiple classifier system that incorporates an Evolutionary Algorithm for dynamically selecting the set of classifiers to be included in the pool. The proposed technique is applicable when the classifiers provide both the class assigned to the input sample and a measure of thereliability of the classification. For each sample, the experts selected for participating in the voting rule are those whose reliability is larger than a given threshold. There are as many thresholds as the number of classifiers by the number of classes. The problem of finding the values of the thresholds aimed at selecting the best set of classifier for each input sample has been reformulated as an optimization task, approached by using the Breeder Genetic Algorithm and the Differential Evolution. A set of experiments on three well-known and widely adopetd datasets have been designed and performed to compare the performance provided by the two competing approaches.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127813769","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
Context-aware and voice interactive search 上下文感知和语音交互搜索
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054105
Tran Lam Quan, Phan Dang Hung, Nguyen Hoang Ann, Dinh Anh Tuan, Phi Tung Lam, V. Thang
{"title":"Context-aware and voice interactive search","authors":"Tran Lam Quan, Phan Dang Hung, Nguyen Hoang Ann, Dinh Anh Tuan, Phi Tung Lam, V. Thang","doi":"10.1109/SOCPAR.2013.7054105","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054105","url":null,"abstract":"In this paper, we present data mining techniques (context-aware technique) into the search engine. As an option for search engine, this paper presents the integration of identifying and synthesizing Vietnamese languge into search engine to query and returns the result through voice interaction between users and Search Engine.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130471222","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
Stroke segmentation of online handwritten word using the busy zone concept 基于忙区概念的在线手写体笔画分割
2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR) Pub Date : 2013-12-01 DOI: 10.1109/SOCPAR.2013.7054100
Rajib Ghosh
{"title":"Stroke segmentation of online handwritten word using the busy zone concept","authors":"Rajib Ghosh","doi":"10.1109/SOCPAR.2013.7054100","DOIUrl":"https://doi.org/10.1109/SOCPAR.2013.7054100","url":null,"abstract":"To take care of variability involved in the writing style of different individuals a novel approach has been proposed in this article to segment unconstrained handwritten Bangla words into characters. Online handwriting recognition refers to the problem of interpretation of handwriting input captured as a stream of pen positions using a digitizer or other pen position sensor. For online recognition of word the proper segmentation of word into basic strokes is very much important. For word segmentation, at first the busy zone of the whole word is calculated and then an estimated headline is imagined just above the starting point of the busy zone. Remove all the pixels crossing the estimated headline by checking their distance. Finally the segmentation is done. The system has been tested on 5500 Bangla word data and obtained around 94.9% of correct segmentation on word data from the proposed system.","PeriodicalId":315126,"journal":{"name":"2013 International Conference on Soft Computing and Pattern Recognition (SoCPaR)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134206680","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
首页 上一页 下一页 尾页
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学术官方微信