Pepper berries classification has been performed manually by human vision. Hence the procedure consumes a lot of manpower and time. This research discusses an application of computer vision to classify the peppercorn samples. We propose the use of edge detection and template matching from the real time gray scale images taken from the peppercorn samples. Color images and color detection is applied in this research as they consume large volume of CPU memory and reduce the classification speed in real time (Reece et al. 1998, Zou et al. 2007). The paper discusses the background of peppercorn feature classifications, followed by the peppercorn recognition algorithm, evaluation and results of the recognition.
胡椒浆果的分类一直是由人类视觉手动完成的。因此，该过程消耗了大量的人力和时间。本研究探讨了计算机视觉在胡椒样品分类中的应用。我们提出使用边缘检测和模板匹配的实时灰度图像从胡椒样品。本研究采用彩色图像和颜色检测，因为它们消耗大量CPU内存，降低了实时分类速度(Reece et al. 1998, Zou et al. 2007)。本文讨论了胡椒特征分类的背景，然后介绍了胡椒特征识别算法、评价和识别结果。
{"title":"Automated Pepper Berries Classification with Edge Detection and Template Matching","authors":"B. Lau, T.K. Low","doi":"10.1109/AMS.2010.37","DOIUrl":"https://doi.org/10.1109/AMS.2010.37","url":null,"abstract":"Pepper berries classification has been performed manually by human vision. Hence the procedure consumes a lot of manpower and time. This research discusses an application of computer vision to classify the peppercorn samples. We propose the use of edge detection and template matching from the real time gray scale images taken from the peppercorn samples. Color images and color detection is applied in this research as they consume large volume of CPU memory and reduce the classification speed in real time (Reece et al. 1998, Zou et al. 2007). The paper discusses the background of peppercorn feature classifications, followed by the peppercorn recognition algorithm, evaluation and results of the recognition.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124581706","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}
A new method for image registration has been previously proposed by the authors, which the registration is based on physical forces. The registration parameters are translation and rotation. This method assumes images like charged materials that attract each other. In this case, one of the images moves in the same direction as the applied force while the other one is still. The movement of the image continues until the resultant force becomes zero. This approach estimates the registration parameters simultaneously and leading to a better optimized set of registration parameters. The previous work is presented for grayscale images, and in this paper we aim to develop this method for color images. The comparison of the results shows that the excess information which exists in color images can accelerate the registration process. Also, we find the optimum set of the parameters to improve the accuracy of the algorithm.
{"title":"Image Registration Method Based on Physical Forces for Color Images","authors":"Ali Ghayoor, Amin Sadri, A. Shirazi","doi":"10.1109/AMS.2010.77","DOIUrl":"https://doi.org/10.1109/AMS.2010.77","url":null,"abstract":"A new method for image registration has been previously proposed by the authors, which the registration is based on physical forces. The registration parameters are translation and rotation. This method assumes images like charged materials that attract each other. In this case, one of the images moves in the same direction as the applied force while the other one is still. The movement of the image continues until the resultant force becomes zero. This approach estimates the registration parameters simultaneously and leading to a better optimized set of registration parameters. The previous work is presented for grayscale images, and in this paper we aim to develop this method for color images. The comparison of the results shows that the excess information which exists in color images can accelerate the registration process. Also, we find the optimum set of the parameters to improve the accuracy of the algorithm.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124021003","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}
This paper presents the design and implementation of an internet-based smart remote control system for home automation, dedicated to power management that adapts power consumption to available power resources according to user comfort and cost criteria. Sensors and home appliances are connected to the designed and implemented control panel and then they are monitored and controlled from every corner of the world through the Internet cloud. The system is scalable and allows additional appliances to be added to it with no major changes to its core. New communication format is proposed to enable communication between the control panel and the server as well. To verify the principle operation of the design, some home applications are experimentally tested. Experimental results show the efficiency and accuracy of proposed intelligent control system in terms of energy saving and being user friendly.
{"title":"A New Intelligent Remote Control System for Home Automation and Reduce Energy Consumption","authors":"M. G. Golzar, HamidReza Tajozzakerin","doi":"10.1109/AMS.2010.46","DOIUrl":"https://doi.org/10.1109/AMS.2010.46","url":null,"abstract":"This paper presents the design and implementation of an internet-based smart remote control system for home automation, dedicated to power management that adapts power consumption to available power resources according to user comfort and cost criteria. Sensors and home appliances are connected to the designed and implemented control panel and then they are monitored and controlled from every corner of the world through the Internet cloud. The system is scalable and allows additional appliances to be added to it with no major changes to its core. New communication format is proposed to enable communication between the control panel and the server as well. To verify the principle operation of the design, some home applications are experimentally tested. Experimental results show the efficiency and accuracy of proposed intelligent control system in terms of energy saving and being user friendly.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115504628","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}
Conjugate Gradient is an iterative linear solver that is used in many scientific and engineering applications to solve a system of linear equations. However, Conjugate Gradient generates a heavy load of computation and therefore it slows the performance of the applications using it. In this paper, we conduct an empirical cost study of a parallel CG on our star-based network. We evaluate the communication overhead involved by a parallel CG. In particular, we derive network parameters; the Maximum Transfer Unit (MTU), that can contribute to the optimization of communication cost and to the reduction of the waiting overhead of the parallel algorithm.
共轭梯度是一种迭代线性求解器，在许多科学和工程应用中用于求解线性方程组。然而，共轭梯度产生了沉重的计算负荷，因此它降低了应用程序的性能。在本文中，我们对基于星型网络的并行CG的成本进行了实证研究。我们评估了并行CG所涉及的通信开销。特别地，我们推导了网络参数;最大传输单元(Maximum Transfer Unit, MTU)，这有助于优化通信成本，减少并行算法的等待开销。
{"title":"Empirical Study for Communication Cost of Parallel Conjugate Gradient on a Star-Based Network","authors":"L. Ismail, K. Shuaib","doi":"10.1109/AMS.2010.101","DOIUrl":"https://doi.org/10.1109/AMS.2010.101","url":null,"abstract":"Conjugate Gradient is an iterative linear solver that is used in many scientific and engineering applications to solve a system of linear equations. However, Conjugate Gradient generates a heavy load of computation and therefore it slows the performance of the applications using it. In this paper, we conduct an empirical cost study of a parallel CG on our star-based network. We evaluate the communication overhead involved by a parallel CG. In particular, we derive network parameters; the Maximum Transfer Unit (MTU), that can contribute to the optimization of communication cost and to the reduction of the waiting overhead of the parallel algorithm.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116860096","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}
In today’s distributed computing environment multiple parties compute some function of their private inputs. In such a scenario privacy preservation of such inputs is a matter of great concern because each party is also worried about the privacy of their inputs. This subject is evolved as Secure Multiparty Computation (SMC). The protocols proposed in this paper allow multiple parties to get maximum of their inputs without disclosing individual inputs to one another or even to any third party. We use a third party for computation that may not be trusted. The protocol uses binary countdown approach. In one of the protocols anonymizers are used to hide the identity of the party. The probabilistic analysis of the protocols is presented.
{"title":"Protocols for Getting Maximum Value for Multi-Party Computations","authors":"Rashid Sheikh, D. Mishra","doi":"10.1109/AMS.2010.120","DOIUrl":"https://doi.org/10.1109/AMS.2010.120","url":null,"abstract":"In today’s distributed computing environment multiple parties compute some function of their private inputs. In such a scenario privacy preservation of such inputs is a matter of great concern because each party is also worried about the privacy of their inputs. This subject is evolved as Secure Multiparty Computation (SMC). The protocols proposed in this paper allow multiple parties to get maximum of their inputs without disclosing individual inputs to one another or even to any third party. We use a third party for computation that may not be trusted. The protocol uses binary countdown approach. In one of the protocols anonymizers are used to hide the identity of the party. The probabilistic analysis of the protocols is presented.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123168025","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}
This paper presents a simulation of bipedal locomotion to control the stimulation pulses of functional electrical stimulation (FES) for activating muscles for paraplegic walking with spring brake orthosis (SBO). The work is a first effort towards restoring natural like swing phase in paraplegic gait through a new hybrid orthosis, referred to as spring brake orthosis (SBO). This mechanism simplifies the control task and results in smooth motion and more-natural like trajectory produced by the flexion reflex for gait in spinal cord injured subjects. The study is carried out with a model of humanoid with wheel walker using the Visual Nastran (Vn4D) dynamic simulation software. Stimulated muscle model of quadriceps is developed for knee extension. Proportional integral derivative (PID) control is developed in Matlab/Simulink to regulate the muscle stimulation pulse-width required to drive FES-assisted walking gait and the computed motion is visualised in graphic animation from Vn4D. The results show that SBO can reduce torque and stimulation pulses required for FES-assisted paraplegic walking with wheel walker and PID control is found to be appropriate controller for the leg extension.
{"title":"PID Control of Knee Extension for FES-Assisted Walking with Spring Brake Orthosis","authors":"R. Jailani, M. Tokhi, S. Gharooni, Z. Hussain","doi":"10.1109/AMS.2010.59","DOIUrl":"https://doi.org/10.1109/AMS.2010.59","url":null,"abstract":"This paper presents a simulation of bipedal locomotion to control the stimulation pulses of functional electrical stimulation (FES) for activating muscles for paraplegic walking with spring brake orthosis (SBO). The work is a first effort towards restoring natural like swing phase in paraplegic gait through a new hybrid orthosis, referred to as spring brake orthosis (SBO). This mechanism simplifies the control task and results in smooth motion and more-natural like trajectory produced by the flexion reflex for gait in spinal cord injured subjects. The study is carried out with a model of humanoid with wheel walker using the Visual Nastran (Vn4D) dynamic simulation software. Stimulated muscle model of quadriceps is developed for knee extension. Proportional integral derivative (PID) control is developed in Matlab/Simulink to regulate the muscle stimulation pulse-width required to drive FES-assisted walking gait and the computed motion is visualised in graphic animation from Vn4D. The results show that SBO can reduce torque and stimulation pulses required for FES-assisted paraplegic walking with wheel walker and PID control is found to be appropriate controller for the leg extension.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115646483","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}
Artificial Neural Network (ANN) is a popular computational intelligence technique in many applications. However, the performance depends on appropriate structure design and considered as a difficult task. Until now, there is no standard procedure in designing an optimal ANN. Two important issues in designing ANN are the selection of significant input subset and hidden nodes size. In this paper, binary coded Genetic Algorithm (GA) has been used to simultaneously select the significant input to ANN and automatically determine the optimal number of hidden nodes. The goal is to obtain optimal ANN design in term of prediction accuracy and complexity. The performances with and without input selection are compared. The proposed method is applied on the prediction of benchmark sunspot time series.
{"title":"Simultaneous Input Selection and Hidden Nodes Optimization for Sunspot Time Series Prediction","authors":"F. Ahmad, N. A. Mat-Isa, Z. Hussain","doi":"10.1109/AMS.2010.24","DOIUrl":"https://doi.org/10.1109/AMS.2010.24","url":null,"abstract":"Artificial Neural Network (ANN) is a popular computational intelligence technique in many applications. However, the performance depends on appropriate structure design and considered as a difficult task. Until now, there is no standard procedure in designing an optimal ANN. Two important issues in designing ANN are the selection of significant input subset and hidden nodes size. In this paper, binary coded Genetic Algorithm (GA) has been used to simultaneously select the significant input to ANN and automatically determine the optimal number of hidden nodes. The goal is to obtain optimal ANN design in term of prediction accuracy and complexity. The performances with and without input selection are compared. The proposed method is applied on the prediction of benchmark sunspot time series.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124899595","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}
A. Shah, W. Shah, S. Soomro, A. Memon, A. Bouk, Mushtaque Ahmed Korai
Evaluation of flow time and service process of a queuing systems is a very special and powerful concept to analyze the flow time of any arriving data packet at any point of the system. In this paper, we construct and demonstrate the flow process and service process transition diagram to determine the flow time of a data packet in an early arrival finite discrete-time queueing system where arriving data packets are hypogeometrically distributed. We compute the probabilities of all starting states where a data packet can possibly enters and its flow process begins. We validated the obtained analytical results, for probability mass function of each starting state and total probability mass function, with simulation results.
{"title":"Flow Time Analysis of an Early Arrival System Using Discrete-Time Hypogeometrical Distribution","authors":"A. Shah, W. Shah, S. Soomro, A. Memon, A. Bouk, Mushtaque Ahmed Korai","doi":"10.1109/AMS.2010.116","DOIUrl":"https://doi.org/10.1109/AMS.2010.116","url":null,"abstract":"Evaluation of flow time and service process of a queuing systems is a very special and powerful concept to analyze the flow time of any arriving data packet at any point of the system. In this paper, we construct and demonstrate the flow process and service process transition diagram to determine the flow time of a data packet in an early arrival finite discrete-time queueing system where arriving data packets are hypogeometrically distributed. We compute the probabilities of all starting states where a data packet can possibly enters and its flow process begins. We validated the obtained analytical results, for probability mass function of each starting state and total probability mass function, with simulation results.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351236","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}
Abstract—Synchronous Drive Robots (SDR) are seeing increasing use as service robots in dynamic environments. Due to the changing scenery in dynamic environments, the accuracy of proprioceptive sensors such as odometry is of greater importance. This paper proposes a generic kinematic model for the translational systematic odometry error in an n-wheeled SDR (n¸3). An unexpected behaviour of SDR is the curved path when commanded to translate, which varies with wheel orientation (which changes when commanded to rotate.) This is caused by the traction force of each wheel around the centre of mass of the robot acting as a moment. There is a further odometry error due to wheel misalignment, which does not affect the path curvature, but creates a yaw. Compared to existing works, the proposed model is explicitly validated in the instance of a 3-wheeled SDR.
{"title":"A Generic Model, and its Validation, for the Translational Systematic Errors in Synchronous Drive Robots","authors":"Munir Zaman, I. Liao","doi":"10.1109/AMS.2010.34","DOIUrl":"https://doi.org/10.1109/AMS.2010.34","url":null,"abstract":"Abstract—Synchronous Drive Robots (SDR) are seeing increasing use as service robots in dynamic environments. Due to the changing scenery in dynamic environments, the accuracy of proprioceptive sensors such as odometry is of greater importance. This paper proposes a generic kinematic model for the translational systematic odometry error in an n-wheeled SDR (n¸3). An unexpected behaviour of SDR is the curved path when commanded to translate, which varies with wheel orientation (which changes when commanded to rotate.) This is caused by the traction force of each wheel around the centre of mass of the robot acting as a moment. There is a further odometry error due to wheel misalignment, which does not affect the path curvature, but creates a yaw. Compared to existing works, the proposed model is explicitly validated in the instance of a 3-wheeled SDR.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122570820","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}
Fingerprint recognition is one of the most important challenging tasks of the biometrics identification due to the fact that they are easy to obtain and most importantly they are reliable. A number of pattern recognition methods have been used to perform fingerprint matching. Among such methods fingerprint matching based on minutia features is one of the researched problems. So we proposed effective fingerprint matching algorithm based on feature extraction. Also we have presented a novel fingerprint recognition technique for minutia extraction and a minutia matching. For minutia marking we considered one special false minutiae removal method and for minutiae matching we considered alignment based method. Experimental results show that this method achieves a much better matching performance.
{"title":"A Novel Approach for Fingerprint Matching Using Minutiae","authors":"Ashwini R. Patil, M. Zaveri","doi":"10.1109/AMS.2010.70","DOIUrl":"https://doi.org/10.1109/AMS.2010.70","url":null,"abstract":"Fingerprint recognition is one of the most important challenging tasks of the biometrics identification due to the fact that they are easy to obtain and most importantly they are reliable. A number of pattern recognition methods have been used to perform fingerprint matching. Among such methods fingerprint matching based on minutia features is one of the researched problems. So we proposed effective fingerprint matching algorithm based on feature extraction. Also we have presented a novel fingerprint recognition technique for minutia extraction and a minutia matching. For minutia marking we considered one special false minutiae removal method and for minutiae matching we considered alignment based method. Experimental results show that this method achieves a much better matching performance.","PeriodicalId":437153,"journal":{"name":"2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126783582","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：