{"title":"Design and Development of a Closed Room Monitoring System","authors":"Mohd Zahari Puteh, A. Shukor, M. H. Jamaluddin","doi":"10.1109/SoCPaR.2009.147","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.147","url":null,"abstract":"This paper discusses a method for implementing a closed room monitoring system. It forms the basics of a home/building security system. The research focuses on the controller design, the devices used and visual interface seen from the Personal Computer (PC). In addition, the system incorporates a data-logging feature of the sensors used. This is useful, because it involves memory card storage. Even if the system is off-line from the PC, the state of the sensors can still be monitored via memory card.","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":"130844142","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}
{"title":"A New Parallel Asynchronous Cellular Genetic Algorithm for de Novo Genomic Sequencing","authors":"F. Pinel, B. Dorronsoro, P. Bouvry","doi":"10.1109/SoCPaR.2009.45","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.45","url":null,"abstract":"This work proposes a new parallel asynchronous cellular genetic algorithm model for multi-core processors. The algorithm has been used for solving the DNA fragment assembly problem with the aim of finding highly accurate solutions in short computation times. This NP-Complete problem lies in reconstructing a DNA chain from multiple fragments that have previously been sequenced in a laboratory. The considered problem is a critical step in any genomic project, since the resulting chains are the basis for the entire work. Therefore, the quality of these chains is a major aspect for the correct development of the project. The proposed algorithm is able to find highly accurate results much faster than the other algorithms in the literature. Additionally, since it is parallel, it could be scalable to much larger problem instances, for which the methods typically used usually encounter difficulties. Finally, several new local search methods have been designed, and their influence on the performance of the algorithm has been analyzed.","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":"128701386","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}
{"title":"Fast 4x4 Tchebichef Moment Image Compression","authors":"Siaw Lang Wong, Nur Azman Abu, Hidayah Rahmalan","doi":"10.1109/SoCPaR.2009.66","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.66","url":null,"abstract":"This paper proposes a new approach based on 4x4 discrete orthogonal Tchebichef Moment for fast and efficient image compression. The method incorporates a simplified mathematical framework technique using matrices, as well as a block-wise reconstruction technique to eliminate possible occurrences of numerical instabilities at higher moment orders. The comparison between 4x4 Tchebichef Moment Transform and Discrete Cosine Transform has been done. The results show significant advantages for 4x4 Tchebichef Moment in terms of its error reconstruction and average bit-length of Huffman codes.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"16 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":"131141462","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}
{"title":"A Real Time Vibrotactile Biofeedback System for Improving Lower Extremity Kinematic Motion during Sports Training","authors":"A. U. Alahakone, S. M. N. Arosha Senanayake","doi":"10.1109/SoCPaR.2009.120","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.120","url":null,"abstract":"In sports applications, the use of real time motion monitoring and biofeedback is vital for efficient training, technique improvements and reduce the risk of injuries. This paper proposes a novel approach for monitoring and improving jump landing technique based on lower extremity kinematics. The system consists of wearable inertial sensors, a custom developed software for data processing and a wireless biofeedback unit including skin stimulation devices for vibration feedback. Biofeedback is provided for knee angular measurements obtained with respect to defined target thresholds. The applicability and effectiveness of the system were tested using a Drop Vertical Jump (DVJ) to improve knee flexion and abduction/adduction during landing. The results confirm the accuracy of the system for real time applications and the impact of vibrotactile biofeedback for motor augmentation and injury prevention in sports applications.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"2013 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":"127338654","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}
N. Yusof, Nur Ariffin Mohd Zin, Noraniah Mohd Yassin, Paridah Samsuri
{"title":"Evaluation of Student's Performance and Learning Efficiency Based on ANFIS","authors":"N. Yusof, Nur Ariffin Mohd Zin, Noraniah Mohd Yassin, Paridah Samsuri","doi":"10.1109/SoCPaR.2009.95","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.95","url":null,"abstract":"This work focuses on a systematic approach in assessing and reasoning the student’s performance and efficiency level in Programming Technique course. There are four criteria required to indicate the student’s performance and efficiency level which are scores earned, time spent, number of attempts and help needed. A fuzzy rule base model that has been proposed in previous work is found to be insufficient in deciding all possible conditions. To deal with this problem, this work focuses on the Adaptive Neuro-Fuzzy Inference System (ANFIS) approach in determining the possible conditions in order to form a fuzzy rule based system of a student model. The back- propagation is utilized as the learning mechanism for the neural network to solve the incompleteness in the decision made by human experts. By training the neural network with 18 human decisions that are certain, the neural network has successfully derived other decisions to form a complete fuzzy rule base and able to adjust its parameter by learning mechanism. However, some of the decisions are found illogically classified.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"119 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113935043","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}
{"title":"Freeman Chain Code Extraction Using Differential Evolution (DE) and Particle Swarm Optimization (PSO)","authors":"H. Hasan, H. Haron, S. Hashim","doi":"10.1109/SoCPaR.2009.27","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.27","url":null,"abstract":"This paper is focusing on extracting chain codes of a thinned binary image using two soft computing approaches, i.e. Differential Evolution (DE) and Particle Swarm Optimization (PSO). The problem is to find a continuous route which covers all of the nodes of the image. The motivation is that finding such a route is complicated when it has many branches. Literature review shows that these approaches have not been used for solving such problem. In addition, the result shows that the proposed PSO has a better performance than the proposed DE for solving the problem.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"290 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":"114608887","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}
Broderick Crawford, Mauricio Montecinos, Carlos Castro, É. Monfroy
{"title":"A Choice Function to Dynamic Selection of Enumeration Strategies Solving Constraint Satisfaction Problems","authors":"Broderick Crawford, Mauricio Montecinos, Carlos Castro, É. Monfroy","doi":"10.1109/SoCPaR.2009.54","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.54","url":null,"abstract":"In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. The main novelty of our approach is that we reconfigure the searching or search process based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"34 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":"114792645","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}
{"title":"Feature Extraction for Traditional Malay Musical Instruments Classification System","authors":"N. Senan, R. Ibrahim, Nazri M. Nawi, M. Mokji","doi":"10.1109/SoCPaR.2009.94","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.94","url":null,"abstract":"Automatic musical instrument classification system deals with a large number of sound database and various types of features schemes. With the lack of data pre-processing, it might become invaluable asset that can impact the whole classification tasks. In handling an effective classification system, finding the best data sets with the best features schemes often a vital step in the data representation and feature extraction process. Thus, this study is conducted in order to investigate the impact of several factors that might affecting the classification accuracy such as audio length, segmented frame size and data sets size (for training and testing) towards Traditional Malay musical instruments sounds classification system. The perception-based and MFCC features schemes with total of 37 features was utilized in this study. Meanwhile, Multi-Layered Perceptrons classifier is employed to evaluate the modified data sets and extracted features schemes in terms of their classification performance. Results show that the highest accuracy of 99.57% was obtained from the best data sets with the combination of full features. It is also revealed that the identified factors had a significant role to the performance of classification accuracy. Hence, this study suggest that further feature analysis research is necessary for better solution in Traditional Malay musical instruments sounds classification system problem.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"221 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":"121466797","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}
{"title":"A New Solution Approach for Grouping Problems Based on Evolution Strategies","authors":"A. H. Kashan, M. Jenabi, Mina Husseinzadeh Kashan","doi":"10.1109/SoCPaR.2009.29","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.29","url":null,"abstract":"Since its foundation in 1994, the grouping genetic algorithm (GGA) is the only evolutionary algorithm heavily modified to suit the structure of grouping problems. In this paper we design the grouping version of evolution strategies (ES). It is well-known that ES maintains a Gaussian mutation, recombination and a selection operator for optimizing non-linear continuous functions. Therefore, the development of grouping evolution strategies (GES) for solving grouping problems that are discrete in nature, calls for developing operators having the major characteristics of the original ones and being respondent to the structure of grouping problems. We propose a mutation operator analogous to the original one that works with groups instead of scalars and use it in a two phase procedure to generate the new solution. We implement (1+Lambda)-GES and evaluate its performance versus GGA on some of hard benchmarked instances of the bin packing problem. Computational results testify that our approach is efficient and can be regarded as a promising solver for the wide class of grouping problems.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"176 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":"117175967","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}
{"title":"BiSim: A Simple and Efficient Biclustering Algorithm","authors":"Nighat Noureen, M. Qadir","doi":"10.1109/SoCPaR.2009.14","DOIUrl":"https://doi.org/10.1109/SoCPaR.2009.14","url":null,"abstract":"Analysis of gene expression data includes classification of the data into groups and subgroups based on similar expression patterns. Standard clustering methods for the analysis of gene expression data only identifies the global models while missing the local expression patterns. In order to identify the missed patterns biclustering approach has been introduced. Various biclustering algorithms have been proposed by scientists. Among them Binary Inclusion maximal algorithm (BiMax) forms biclusters when applied on a gene expression data through divide and conquer approach. The worst-case running-time complexity of BiMax for matrices containing disjoint biclusters is O(nmb) and for arbitrary matrices is of order O(nmb min{n, m}) where b is the number of all inclusion-maximal biclusters in matrix. In this paper we present an improved algorithm, BiSim, for biclustering which is easy and avoids complex computations as in BiMax. The complexity of our approach is O(n*m) for n genes and m conditions, i.e, a matrix of size n*m. Also it avoids extra computations within the same complexity class and avoids missing of any biclusters.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"7 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":"115486010","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}