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

2009 International Conference of Soft Computing and Pattern Recognition最新文献

筛选
英文 中文
A Hierarchy-Based Method for Synthesizing Frequent Itemsets Extracted from Temporal Windows 基于层次的时间窗频繁项集合成方法
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.38
Y. Pitarch, Anne Laurent, P. Poncelet
{"title":"A Hierarchy-Based Method for Synthesizing Frequent Itemsets Extracted from Temporal Windows","authors":"Y. Pitarch, Anne Laurent, P. Poncelet","doi":"10.1109/SoCPaR.2009.38","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.38","url":null,"abstract":"With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stream history is unfeasible and providing a high-quality summary is required for decision makers. A practical and consistent summarization method is the extraction of the frequent itemsets over temporal windows. Nevertheless, this method suffers from a critical drawback: results pile up quickly making the analysis either uncomfortable or impossible for users. In this paper, we propose to unify these results thanks to a synthesis method for multidimensional frequent itemsets based on a graph structure and taking advantage of the data hierarchies. We overcome a major drawback of the Tilted Time Window (TTW) standard framework by taking into account the data distribution. Experiments conducted on both synthetic and real datasets show that our approach can be applied to data streams.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123135358","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
Image Based Analysis of Tomato Leaves to Determine the Number of Petioles 基于图像分析的番茄叶片叶柄数确定方法
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.69
A. Chakraborty, P. Sanyal, S. Mukherjee, S. Chatterjee, P. Hazra, S. Bandyopadhyay
{"title":"Image Based Analysis of Tomato Leaves to Determine the Number of Petioles","authors":"A. Chakraborty, P. Sanyal, S. Mukherjee, S. Chatterjee, P. Hazra, S. Bandyopadhyay","doi":"10.1109/SoCPaR.2009.69","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.69","url":null,"abstract":"The tomato (Lycopersicon esculentum) is an herbaceous, usually sprawling plant which belong to Solanaceae or nightshade family. Genetic evidence shows that the progenitors of tomatoes were herbaceous green plants with small green fruit. There are a great many (around 7500) tomato varieties grown for various purposes. Their identifications had been studied using various laboratory methods. The morphological and genetical characteristics were employed to classify different tomato cultivars. However, the presence of wide morphological varieties through evolution among various tomato cultivars made it more complex and difficult to classify them. Petioles plays a very crucial role in determining the characteristics of a tomato plant. The number of petioles present, their angle with the leaf stalk or their distance from the stalk represent genetical characteristics which differentiate various cultivars of tomato. This article proposed various methods to find the number of petioles present in a tomato leaf using an image analysis based approach.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"5 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932120","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
Integration of Visualization Techniques and Completion Strategy to Improve Learning in Computer Programming 可视化技术与完成策略的整合促进计算机程序设计学习
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.131
N. Hashim, S. Salam
{"title":"Integration of Visualization Techniques and Completion Strategy to Improve Learning in Computer Programming","authors":"N. Hashim, S. Salam","doi":"10.1109/SoCPaR.2009.131","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.131","url":null,"abstract":"Computer Programming is known as a difficult subject that requires complex cognitive task by the majority of students even for those who are taking Computer Science courses. It is normal for programming instructors to provide their students with alternative methods to help them in the learning process. When learning to program for the first time, students and lecturers usually are facing with difficulties in learning and teaching the subject. Mobile learning provides a great opportunity for learners to switch from rigid learning to fun learning using supported elements. The ability of mobile devices only is still not enough for learners to master in learning programming without the right options in techniques applied. This study will explore how Visualization Technique and Completion Strategy can be used to improve learning in a computer programming subject.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"350 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121700434","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
An Improved Discrete Particle Swarm Optimization in Evacuation Planning 疏散规划中一种改进的离散粒子群算法
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.22
M. Yusoff, J. Ariffin, A. Mohamed
{"title":"An Improved Discrete Particle Swarm Optimization in Evacuation Planning","authors":"M. Yusoff, J. Ariffin, A. Mohamed","doi":"10.1109/SoCPaR.2009.22","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.22","url":null,"abstract":"In any flash flood evacuation operation, vehicle assignment at the inundated areas is vital to help eliminate loss of life. Vehicles of various types and capacities are used to evacuate victims to relief centers. This paper examines combinatorial optimization approach with the objective function to assign a specified number of vehicles with maximum number of evacuees to the potential inundated areas. Discrete particle swarm optimization (DPSO) and improved DPSO are proposed and experimented on. Results are presented and compared. Improved DPSO with the proposed min-max approach yields better performance for all four testing categories. Experimenting on a large number of evacuees could further improve the performance of the DPSO.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131380243","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}
引用次数: 11
An Intelligent Real-Time Communication Assistant for the Disabled 残疾人智能实时通信助手
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.125
B. Lau, Tran Cao Thai, R. Chiong
{"title":"An Intelligent Real-Time Communication Assistant for the Disabled","authors":"B. Lau, Tran Cao Thai, R. Chiong","doi":"10.1109/SoCPaR.2009.125","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.125","url":null,"abstract":"This research focuses on developing a real-time communication assistant for the disabled utilizing the biometric information of their facial features. Our targeted community is that with communication disabilities. While communicating effectively is a problem for this community, they have facial expressions and incomprehensible speech that can be interpreted to associate with their needs or requests. Thus, we utilize the real-time face detection technique to capture their facial expressions. This paper focuses mainly on discussion of the performance of real-time biometric information detection in our prototype, the EmoCom. EmoCom can also serve as a monitoring system to track the activities of the disabled with limited physical mobility.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121784540","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
Parameter Study and Optimization of a Color-Based Object Classification System 基于颜色的目标分类系统参数研究与优化
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.19
Vinh Hong, D. Paulus
{"title":"Parameter Study and Optimization of a Color-Based Object Classification System","authors":"Vinh Hong, D. Paulus","doi":"10.1109/SoCPaR.2009.19","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.19","url":null,"abstract":"Typical computer vision systems usually include a set of components such as a preprocessor, a feature extractor, and a classifier that together represent an image processing pipeline. For each component there are different operators available. Each operator has a different number of parameters with individual parameter domains. The challenge in developing a computer vision system is the optimal choice of the available operators and their parameters to construct the appropriate pipeline for the problem at hand. The task of finding the optimal combination and setting depends strongly on the definition of the term optimal. Optimality can reach from minimal computational time to maximal recognition rate of a system. Using the example of the color-based object classification system, this contribution presents a comprehensive approach for finding an optimal system by defining the required image processing pipeline, defining the optimization problem for the classification and improving the optimization by taking parameter studies into consideration. This unique approach produces a color-based classification system with an illuminant independent structure.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134381342","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
AODV Routing Protocol with Selective Flooding 选择性泛洪的AODV路由协议
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.136
G. Tomar, M. Dixit, S. Verma
{"title":"AODV Routing Protocol with Selective Flooding","authors":"G. Tomar, M. Dixit, S. Verma","doi":"10.1109/SoCPaR.2009.136","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.136","url":null,"abstract":"Ad-hoc network is a self organizing and adaptive in nature. Since it is a dynamic multihop wireless network and established by a cluster of mobile nodes on a shared wireless channel. The transitive closure of the neighborhood of all the hosts or nodes in the set of mobiles under consideration forms network. Each node is potentially a router and it is possible to dynamically establish routes by changing together a sequence of neighboring hosts from a source to destination in the adhoc network. In this paper study compares the relative performance of existing protocols and evaluates them. It has been determined that under similar conditions AODV outperforms the other protocols. In this work we have proposed an algorithm to overcome flooding problem in the network. The proposed algorithm is selective flooding in place of broadcasting. It is proposed to lessen the number of packets within the network. This reduces the routing Packet overhead. The algorithm was incorporated in the AODV algorithm and simulated in the identical environment it has improved throughput in the network.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117173600","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
Face Detection Using Radial Basis Function Neural Networks with Variance Spread Value 基于方差扩展值的径向基函数神经网络人脸检测
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.84
K. Aziz, R. Ramlee, S. Abdullah, A. Jahari
{"title":"Face Detection Using Radial Basis Function Neural Networks with Variance Spread Value","authors":"K. Aziz, R. Ramlee, S. Abdullah, A. Jahari","doi":"10.1109/SoCPaR.2009.84","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.84","url":null,"abstract":"This paper present a face detection system using Radial Basis Function Neural Networks With Variance Spread Value. Face detection is the first step in face recognition system. The purpose is to localize and extract the face region from the background that will be fed into the face recognition system for identification. General preprocessing approach was used for normalizing the image and a Radial Basis Function (RBF) Neural Network was used to distinguish between face and non-face images. RBF Neural Networks offer several advantages compared to other neural network architecture such as they can be trained using fast two stages training algorithm and the network possesses the property of best approximation. The output of the network can be optimized by setting suitable values of the center and spread of the RBF. In this paper, variance spread value will be used for every cluster where the value of spread will be calculated using algorithm. The performance of the RBFNN face detection system will be based on the detection rate, False Acceptance Rate (FAR) and the False Rejection Rate (FRR) criteria.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115915662","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
A Study on TODO Task Management at Home 家庭TODO任务管理研究
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.75
Sayaka Ajikata, I. Kobayashi
{"title":"A Study on TODO Task Management at Home","authors":"Sayaka Ajikata, I. Kobayashi","doi":"10.1109/SoCPaR.2009.75","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.75","url":null,"abstract":"In the small community like a family, there exist several TODO tasks to be performed cooperatively by the members for making the community life easier. The TODO tasks have to be performed by someone in the community, therefore, it is preferable that the tasks should be done by the members without a big burden. In this context, we focus on TODO task management in a family, and propose a method to make a schedule in which the family members cooperate each other to achieve TODO tasks by taking account of multiple constraints, e.g., members' expert ability, schedules, etc. To make such a schedule, we use multi-objective genetic algorithm.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115440741","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
Integrated Feature Selection and Parameter Optimization for Evolving Spiking Neural Networks Using Quantum Inspired Particle Swarm Optimization 基于量子启发粒子群优化的进化脉冲神经网络特征选择与参数优化
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SOCPAR.2009.139
Haza Nuzly Abdul Hamed, N. Kasabov, S. Shamsuddin
{"title":"Integrated Feature Selection and Parameter Optimization for Evolving Spiking Neural Networks Using Quantum Inspired Particle Swarm Optimization","authors":"Haza Nuzly Abdul Hamed, N. Kasabov, S. Shamsuddin","doi":"10.1109/SOCPAR.2009.139","DOIUrl":"https://doi.org/10.1109/SOCPAR.2009.139","url":null,"abstract":"This paper proposes a novel method for optimizing features and parameters in the Evolving Spiking Neural Network (ESNN) using Quantum-inspired Particle Swarm Optimization (QiPSO). This study reveals the interesting concept of QiPSO in which information is represented as binary structures. The mechanism simultaneously optimizes the ESNN parameters and relevant features using wrapper approach. A synthetic dataset is used to evaluate the performance of the proposed method. The results show that QiPSO yields promising outcomes in obtaining the best combination of ESNN parameters as well as in identifying the most relevant features.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121907365","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}
引用次数: 23
首页 上一页 下一页 尾页
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学术官方微信