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

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

筛选
英文 中文
A Function Principle Approach to Jaccard Ranking Fuzzy Numbers Jaccard模糊数排序的函数原理方法
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.71
N. Ramli, D. Mohamad
{"title":"A Function Principle Approach to Jaccard Ranking Fuzzy Numbers","authors":"N. Ramli, D. Mohamad","doi":"10.1109/SoCPaR.2009.71","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.71","url":null,"abstract":"Ranking of fuzzy numbers plays an important role in practical use and has become a prerequisite procedure for decision-making problem in fuzzy environment. Various techniques of ranking fuzzy numbers have been developed and one of them is based on the similarity measure technique. Jaccard index similarity measure has been introduced in ranking the fuzzy numbers where the fuzzy maximum and fuzzy minimum are obtained by using the extension principle. However, this approach is only applicable to normal fuzzy numbers and therefore, fails to rank the non-normal fuzzy numbers. Besides that the extension principle does not preserve the type of membership function of the fuzzy numbers and also involves laborious mathematical operations. In this paper, a simple vertex fuzzy arithmetic operation namely function principle is applied in the Jaccard ranking index. This method is capable to rank both normal and non-normal fuzzy numbers in a simpler manner. It has also improved the ranking results by the original Jaccard ranking method and some of the existing ranking methods.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"51 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":"130995786","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}
引用次数: 6
The Effect of Using Different Thermodynamic Models with Harmony Search Algorithm in the Accuracy of RNA Secondary Structure Prediction 不同热力学模型与和谐搜索算法对RNA二级结构预测精度的影响
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.102
A. Mohsen, A. Khader, Abdullatif Ghallab
{"title":"The Effect of Using Different Thermodynamic Models with Harmony Search Algorithm in the Accuracy of RNA Secondary Structure Prediction","authors":"A. Mohsen, A. Khader, Abdullatif Ghallab","doi":"10.1109/SoCPaR.2009.102","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.102","url":null,"abstract":"Ribonucleic acid (RNA) is a nucleic acid composed of a group of the nucleotides. RNA molecule is essential to all biological systems. The RNA strand folds back into itself during the folding process via hydrogen bonds to build the secondary and tertiary structures. Understanding the biological function of a given RNA molecule is critical to determining its structure. Since the structure of RNA molecules is a key to their function, algorithms for the prediction of RNA structure are promising. This paper discusses the effect of applying different thermodynamic models to HSRNAFold an RNA secondary structure prediction algorithm based on Harmony search (HS). The experiments were performed on twelve individual known structures from four RNA classes (5S rRNA, Group I intron 23S rRNA, Group I intron 16S rRNA and 16S rRNA). The data demonstrate that the results obtained via RNAeval are better than those of enf2 in terms of prediction accuracy. In addition, the time needed by RNAeval is less than the time needed by enf2 for the same number of iterations.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"20 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":"125627490","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
Face Sketch Multiple Features Detection Using Simultaneously Shape and Landmark Movement 基于形状和地标运动的人脸素描多特征检测
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.81
M. Hariadi, A. Muntasa, M. Purnomo
{"title":"Face Sketch Multiple Features Detection Using Simultaneously Shape and Landmark Movement","authors":"M. Hariadi, A. Muntasa, M. Purnomo","doi":"10.1109/SoCPaR.2009.81","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.81","url":null,"abstract":"Nowadays, retrieving a person identity using a photograph from the face image database is a crucial job especially in police investigations. Unfortunately in many cases, the photo image of a suspect is not available. Only a face sketch drawing based on the recollection of an eyewitness is available. Usually, there are two kind of face sketches employed in police investigations i.e. halftone face sketches. In this paper, we propose a modified line gradient method called Maximum Line Gradient Method to detect multiple features from halftone face sketches by using simultaneously moving shapes and landmarks. Our proposed method is divided into four stages: training, create image gradient, shape initialization, and multiple features detection processes. The last stage is started by searching the maximum line gradient value between two landmarks. Thus, by using the Similarity Transformation Equation, the set of landmarks (shape) will be simultaneously moved. The position of new landmark is enhanced by using simultaneously landmark movements on each shape. In the experiment, we employ 50 halftone face sketches which being examined by using 7 features with 38 landmarks. Our propose method demonstrates that the detection accuracy is 92.16%.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"10 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":"121177124","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
Cat Swarm Optimization for Clustering 聚类的Cat群优化
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.23
B. Santosa, Mirsa Kencana Ningrum
{"title":"Cat Swarm Optimization for Clustering","authors":"B. Santosa, Mirsa Kencana Ningrum","doi":"10.1109/SoCPaR.2009.23","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.23","url":null,"abstract":"Cat Swarm Optimization (CSO) is one of the new heuristic optimization algorithm which based on swarm intelligence. Previous research shows that this algorithm has better performance compared to the other heuristic optimization algorithms: Particle Swarm Optimization (PSO) and weighted-PSO in the cases of function minimization. In this research a new CSO algorithm for clustering problem is proposed. The new CSO clustering algorithm was tested on four different datasets. The modification is made on the CSO formula to obtain better results. Then, the accuracy level of poposed algorith was compared to those of K-means and PSO clustering. The modification of CSO formula can improve the performance of CSO Clustering. The comparison indicates that CSO clustering can be considered as a sufficiently accurate clustering method","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":"128468630","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}
引用次数: 121
Chemical Field Effect Transistor Response with Post Processing Supervised Neural Network 基于后处理监督神经网络的化学场效应晶体管响应
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.58
W. Abdullah, M. Othman, Mohd Alaudin Mohd Ali
{"title":"Chemical Field Effect Transistor Response with Post Processing Supervised Neural Network","authors":"W. Abdullah, M. Othman, Mohd Alaudin Mohd Ali","doi":"10.1109/SoCPaR.2009.58","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.58","url":null,"abstract":"This work presents the classification of potassium ion concentration in the presence of interfering ammonium ions from Chemical Field-Effect Transistor (CHEMFET) sensors involving neural network post-processing stage. Data collection for the purpose of supervised learning training data is obtained from sample solutions prepared by keeping the main ion concentration constant while the activity of the interfering ions based on the fixed interference method. The measurement setup includes a readout interface circuit that ensures constant-current constant-voltage across the drain-source for isothermal point operation. The training algorithm is back-propagation with generalized delta rule on a multilayer feed-forward network. Activation function based on the MOSFET drain current equation in the linear region is attempted in the hidden layer. Using function fitting approach, the network aims to find the potassium ion concentration despite the presence of interfering ion, without having to estimate device and chemically related parameters that would otherwise require further experiments.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"65 3 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":"116380617","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
Investigation on Image Processing Techniques for Diagnosing Paddy Diseases 水稻病害诊断的图像处理技术研究
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.62
Nunik Noviana Kurniawati, S. N. H. S. Abdullah, S. Abdullah, Saad Abdullah
{"title":"Investigation on Image Processing Techniques for Diagnosing Paddy Diseases","authors":"Nunik Noviana Kurniawati, S. N. H. S. Abdullah, S. Abdullah, Saad Abdullah","doi":"10.1109/SoCPaR.2009.62","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.62","url":null,"abstract":"The main objective of this research is to develop a prototype system for diagnosing paddy diseases, which are Blast Disease (BD), Brown-Spot Disease (BSD), and Narrow Brown-Spot Disease (NBSD). This paper concentrates on extracting paddy features through off-line image. The methodology involves image acquisition, converting the RGB images into a binary image using automatic thresholding based on local entropy threshold and Otsu method. A morphological algorithm is used to remove noises by using region filling technique. Then, the image characteristics consisting of lesion type, boundary colour, spot colour, and broken paddy leaf colour are extracted from paddy leaf images. Consequently, by employing production rule technique, the paddy diseases are recognized about 94.7 percent of accuracy rates. This prototype has a very great potential to be further improved in the future.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"13 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":"117156125","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}
引用次数: 78
Disaster Management in Malaysia: An Application Framework of Integrated Routing Application for Emergency Response Management System 马来西亚灾害管理:应急响应管理系统综合路由应用的应用框架
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.144
S. K. Baharin, A. S. Shibghatullah, Zahriah Othman
{"title":"Disaster Management in Malaysia: An Application Framework of Integrated Routing Application for Emergency Response Management System","authors":"S. K. Baharin, A. S. Shibghatullah, Zahriah Othman","doi":"10.1109/SoCPaR.2009.144","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.144","url":null,"abstract":"Malaysia has experienced various disasters either natural or manmade disaster. One of the critical phases in Disaster Management System life cycle is response phase. In this phase, connectivity analysis such as a navigation service to help emergency rescue (ER) units reach at disaster area on time is necessary. Nowadays, commercial navigation system seems not appropriate to be used by ER units as they have different preferences. In addition, location information that is vital was not fully utilized in disaster management, especially in doing multi-task analysis. Thus, the real potential of GIS technology in managing spatial data including real-time (moving objects) data of ER units may influence the quality of the service. However, the services should be supported by a good data model. In order to eliminate inappropriate information, incomplete data, and overloaded information from Database Management System (DBMS) sent to the user, this paper will present the framework of integrated routing application for emergency response units embedded with context-aware.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"11 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":"114304080","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}
引用次数: 27
Contour Based Path Planning for Unmanned Aerial Vehicles (UAVs) over Hostile Terrain 基于等高线的恶劣地形上无人机路径规划
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SOCPAR.2009.148
K. May, D. V. Khanh, Tan Chiew Seng, Y. S. Ping, H. Sien
{"title":"Contour Based Path Planning for Unmanned Aerial Vehicles (UAVs) over Hostile Terrain","authors":"K. May, D. V. Khanh, Tan Chiew Seng, Y. S. Ping, H. Sien","doi":"10.1109/SOCPAR.2009.148","DOIUrl":"https://doi.org/10.1109/SOCPAR.2009.148","url":null,"abstract":"In this paper, we present a contour based path planner for Unmanned Aerial Vehicles (UAVs).We make use of efficient algorithm to compute a stealthy path line with desired attributes in radar prone environments. The algorithm is employed to estimate the risk cost of the navigational space and generate an optimized path based on the user-specified threshold altitude value. Thus the generated path is represented with a set of low-radar risk waypoints being the coordinates of its control points. The offline path planner is then approximated using cubic B-splines by considering the least radar risk to the destination. Simulated results are presented, illustrating the potential benefits of such algorithms.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"20 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":"115302657","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
Initial Result of Clustering Strategy to Euclidean TSP 欧氏TSP聚类策略的初步结果
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.16
Abdulah Fajar, N. A. Abu, N. Suryana
{"title":"Initial Result of Clustering Strategy to Euclidean TSP","authors":"Abdulah Fajar, N. A. Abu, N. Suryana","doi":"10.1109/SoCPaR.2009.16","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.16","url":null,"abstract":"There has been growing interest in studying combinatorial optimization problems by clustering strategy, with a special emphasis on the traveling salesman problem (TSP). Since TSP naturally arises as a sub problem in many transportation, manufacturing and various logistics application, this problem has caught much attention of mathematicians and computer scientists. A clustering strategy will decompose TSP into subgraph and form clusters, so it may reduce the TSP graph to smaller problem. The primary objective of this research is to produce a better clustering strategy that fit into Euclidean TSP. General approach for this research is to produce an algorithm for generating clusters and able to handle large size cluster. The next step is to produce Hamilton path algorithm and followed by inter cluster connection algorithm to form global tour. The significant of this research is solution result error less than 10% compare to best known solution (TSPLIB) and there is an improvement to a hierarchical clustering strategy in order to fit in such the Euclidean TSP method.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"57 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":"124818346","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
Development of Kernel Fisher Discriminant Model Using the Cross-Entropy Method 用交叉熵方法建立核Fisher判别模型
2009 International Conference of Soft Computing and Pattern Recognition Pub Date : 2009-12-04 DOI: 10.1109/SoCPaR.2009.138
B. Santosa, Andiek Sunarto
{"title":"Development of Kernel Fisher Discriminant Model Using the Cross-Entropy Method","authors":"B. Santosa, Andiek Sunarto","doi":"10.1109/SoCPaR.2009.138","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.138","url":null,"abstract":"In this paper, the cross-entropy (CE) method is proposed to solve non-linear discriminant analysis or Kernel Fisher discriminant (CE-KFD) analysis. CE through certain steps can find the optimal or near optimal solution with a fast rate of convergence for optimization problem. While, KFD is to solve problem of Fisher’s linear discriminant in a kernel feature space F by maximizing between class variance and minimizing within class variance. Through the numerical experiments, we found that CE-KFD demonstrates the high accuracy of the results compared to the traditional methods, Fisher LDA and kernel Fisher (KFD) with eigen decomposition method.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"13 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":"124478383","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学术官方微信