This paper presents an efficient and real time novel approach for hand region segmentation with an aim to achieve hand gesture recognition under varying illumination. The overall methodology is a two step process: (a) to achieve the segmentation of the hand from the complex background and (b) to recognize the hand gesture efficiently and accurately. Hand segmentation is achieved using block based picture information ratio and recognition is done using Principal Component Analysis (PCA). In the experimental results four basic hand gestures have been considered which were recognized consistently in complex but near constant background and varying illumination. The prototype has been developed in X86, tested with live videos captured by low cost web cams . It performs with 98% accuracy in real time.
{"title":"Information Measure Ratio Based Real Time Approach for Hand Region Segmentation with a Focus on Gesture Recognition","authors":"A. Chaki, Pragya Jain, Rohit Kumar Gupta","doi":"10.1109/ISMS.2011.36","DOIUrl":"https://doi.org/10.1109/ISMS.2011.36","url":null,"abstract":"This paper presents an efficient and real time novel approach for hand region segmentation with an aim to achieve hand gesture recognition under varying illumination. The overall methodology is a two step process: (a) to achieve the segmentation of the hand from the complex background and (b) to recognize the hand gesture efficiently and accurately. Hand segmentation is achieved using block based picture information ratio and recognition is done using Principal Component Analysis (PCA). In the experimental results four basic hand gestures have been considered which were recognized consistently in complex but near constant background and varying illumination. The prototype has been developed in X86, tested with live videos captured by low cost web cams . It performs with 98% accuracy in real time.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114337569","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}
Target tracking is one of the most important and energy killer applications in wireless sensor networks (WSNs). Fault tolerance to any failure is an essential in this context. Hence, we introduce a novel approach toward Base Station (BS) oriented clustering and tracking in WSNs. Proposed method overlooks ad-hoc ability of WSNs to earn energy efficiency and fault tolerance. BS is a powerful energy and computational resource, therefore, we burden BS with major part of clustering and tracking operations. We used 3-D cubic antenna to enable our sensors to receive BS packets from long distance. Also, BS has a good knowledge of nodes energy level, as a result, BS rotates activated nodes and CH to avoid load balancing problem. To the best of our knowledge, this is the first time that BS is employed in tracking application. According to simulations, the proposed algorithm is highly energy efficient and robust against target loss.
{"title":"Fault-Tolerant Base Station Based Target Tracking in WSNs","authors":"Rahim Pasha Khajei, A. Haghighat, J. Karimpour","doi":"10.1109/ISMS.2011.62","DOIUrl":"https://doi.org/10.1109/ISMS.2011.62","url":null,"abstract":"Target tracking is one of the most important and energy killer applications in wireless sensor networks (WSNs). Fault tolerance to any failure is an essential in this context. Hence, we introduce a novel approach toward Base Station (BS) oriented clustering and tracking in WSNs. Proposed method overlooks ad-hoc ability of WSNs to earn energy efficiency and fault tolerance. BS is a powerful energy and computational resource, therefore, we burden BS with major part of clustering and tracking operations. We used 3-D cubic antenna to enable our sensors to receive BS packets from long distance. Also, BS has a good knowledge of nodes energy level, as a result, BS rotates activated nodes and CH to avoid load balancing problem. To the best of our knowledge, this is the first time that BS is employed in tracking application. According to simulations, the proposed algorithm is highly energy efficient and robust against target loss.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121615985","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}
Wang Wusheng, Liao Weiping, Wu Zhonghai, Chu Weijie, Mo Tong
One of the most important points in context-aware computing is to build a reasonable context model. Currently, many models were not built in a common structure. It is hard to build other models depending on the existing ones. In this paper, we build a common ontology-based context model with Web Ontology Language (OWL), which provides an efficient and convenient way of ontology-building by adding domain-specific concepts into this common model. We show the structure of the model and explain the main concepts of it. With the common model, we propose our solutions to solve the problems of position and context history that may exist in the process of modeling a specific domain. Finally, we show a context model of Beijing Capital International Airport (BCIA), which was built on the common model. A simple reasoning test is run on the BCIA model with Semantic Web Rule Language (SWRL).
{"title":"An Ontology-Based Context Model for Building Context-Aware Services","authors":"Wang Wusheng, Liao Weiping, Wu Zhonghai, Chu Weijie, Mo Tong","doi":"10.1109/ISMS.2011.52","DOIUrl":"https://doi.org/10.1109/ISMS.2011.52","url":null,"abstract":"One of the most important points in context-aware computing is to build a reasonable context model. Currently, many models were not built in a common structure. It is hard to build other models depending on the existing ones. In this paper, we build a common ontology-based context model with Web Ontology Language (OWL), which provides an efficient and convenient way of ontology-building by adding domain-specific concepts into this common model. We show the structure of the model and explain the main concepts of it. With the common model, we propose our solutions to solve the problems of position and context history that may exist in the process of modeling a specific domain. Finally, we show a context model of Beijing Capital International Airport (BCIA), which was built on the common model. A simple reasoning test is run on the BCIA model with Semantic Web Rule Language (SWRL).","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127828311","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}
Simulated Annealing is one of the important evolutionary algorithms which can be used in many applications especially in optimization problems. Simulated Annealing has two main phases, the first one is annealing schedule and the second is acceptance probability function. I proposed three annealing schedule methods and one acceptance probability function. The idea of adding momentum terms was used to improve speed and accuracy of annealing schedulers and prevent extreme changes in values of acceptance probability function. Some of my proposed methods show a good accuracy and the others make significant improvement in the speed of simulated Annealing algorithms than the original functions which have been used in the original simulated annealing algorithm.
{"title":"Improved Simulated Annealing Using Momentum Terms","authors":"M. Keikha","doi":"10.1109/ISMS.2011.18","DOIUrl":"https://doi.org/10.1109/ISMS.2011.18","url":null,"abstract":"Simulated Annealing is one of the important evolutionary algorithms which can be used in many applications especially in optimization problems. Simulated Annealing has two main phases, the first one is annealing schedule and the second is acceptance probability function. I proposed three annealing schedule methods and one acceptance probability function. The idea of adding momentum terms was used to improve speed and accuracy of annealing schedulers and prevent extreme changes in values of acceptance probability function. Some of my proposed methods show a good accuracy and the others make significant improvement in the speed of simulated Annealing algorithms than the original functions which have been used in the original simulated annealing algorithm.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128603569","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 describes some experimental study on Monte Carlo Localization (MCL) approach of a mobile robot. The proposed method uses ultrasonic range data for localization. Ultrasonic signal is generated and radiated from a beacon whose location is given a priori. The receiver located on board a robot detects the range from the beacon using the received ultrasonic signal. The research proposes a sensor model for the range sensing based on statistical analysis of the sensor output. In the experiments, commercialized beacons and detectors are used. Through the experiments, the performance of the proposed method is verified and compared under various conditions. The experiments show the performance of the method in case of kidnapping. Especially, analysis on how the number of available beacons affects the localization performance is provided. The localization performance is investigated for the case of stationary robot and moving robot. Also, it presents the localization performance in the case where the wheels of the robot slip on the floor. Through the experiments and analysis, it is demonstrated that the method works in the cases of kidnapping, wheel slip, and possibly with only two sensor data available.
{"title":"Experiments and Analysis of MCL Based Localization for Mobile Robot Navigation","authors":"Tae Gyun Kim, N. Ko, Kwang-Jin Kim","doi":"10.1109/ISMS.2011.43","DOIUrl":"https://doi.org/10.1109/ISMS.2011.43","url":null,"abstract":"This paper describes some experimental study on Monte Carlo Localization (MCL) approach of a mobile robot. The proposed method uses ultrasonic range data for localization. Ultrasonic signal is generated and radiated from a beacon whose location is given a priori. The receiver located on board a robot detects the range from the beacon using the received ultrasonic signal. The research proposes a sensor model for the range sensing based on statistical analysis of the sensor output. In the experiments, commercialized beacons and detectors are used. Through the experiments, the performance of the proposed method is verified and compared under various conditions. The experiments show the performance of the method in case of kidnapping. Especially, analysis on how the number of available beacons affects the localization performance is provided. The localization performance is investigated for the case of stationary robot and moving robot. Also, it presents the localization performance in the case where the wheels of the robot slip on the floor. Through the experiments and analysis, it is demonstrated that the method works in the cases of kidnapping, wheel slip, and possibly with only two sensor data available.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124492283","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 new approach for hiding message in digital image in spatial domain. In this method two bits of message is embedded in a pixel in a way that not only the least significant bit of pixel is allowed to change but also the second bit plane and fourth bit plane are allowed to be manipulated, But the point is in each embedding process only one alternation in one bit plane is allowed to happen. As it is compared by the method LSB-Matching, the results shows this method has an acceptable capacity of embedding data and hardly is detectable for steganalysis algorithm.
{"title":"A More Secure Steganography Method in Spatial Domain","authors":"A. Daneshkhah, H. Aghaeinia, S. H. Seyedi","doi":"10.1109/ISMS.2011.39","DOIUrl":"https://doi.org/10.1109/ISMS.2011.39","url":null,"abstract":"This paper presents a new approach for hiding message in digital image in spatial domain. In this method two bits of message is embedded in a pixel in a way that not only the least significant bit of pixel is allowed to change but also the second bit plane and fourth bit plane are allowed to be manipulated, But the point is in each embedding process only one alternation in one bit plane is allowed to happen. As it is compared by the method LSB-Matching, the results shows this method has an acceptable capacity of embedding data and hardly is detectable for steganalysis algorithm.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127208242","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}
Most data infrastructure tend to focus on data access and not particularly spatial aspects of data and services especially data relating to natural resource management. This project will conceptualise and implement a geospatial information infrastructure to facilitate conservation and management of wetlands in Ghana, where a scalable, accessible and robust solution is urgently needed. Critically, rather than relying on governmental agency as a sole means of continued and current data provision, the approach will link technical advances in mobile telephone services, global positioning systems and concepts of citizen science with advanced developments in semantics and interoperability to formalise a spatial infrastructure system capable of weighing assertion and achieving authority. This paper attempts to propose the use of the following technology in developing a Ghana Wetland Information System: remote sensed imagery plus scripting and database, e-Governance frameworks and Protégé OWL for the management of semantics.
{"title":"Integrating Geo-spatial Information Infrastructure into Conservation and Management of Wetlands in Ghana","authors":"W. Owusu-Banahene, I. Nti, P. Sallis","doi":"10.1109/ISMS.2011.24","DOIUrl":"https://doi.org/10.1109/ISMS.2011.24","url":null,"abstract":"Most data infrastructure tend to focus on data access and not particularly spatial aspects of data and services especially data relating to natural resource management. This project will conceptualise and implement a geospatial information infrastructure to facilitate conservation and management of wetlands in Ghana, where a scalable, accessible and robust solution is urgently needed. Critically, rather than relying on governmental agency as a sole means of continued and current data provision, the approach will link technical advances in mobile telephone services, global positioning systems and concepts of citizen science with advanced developments in semantics and interoperability to formalise a spatial infrastructure system capable of weighing assertion and achieving authority. This paper attempts to propose the use of the following technology in developing a Ghana Wetland Information System: remote sensed imagery plus scripting and database, e-Governance frameworks and Protégé OWL for the management of semantics.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115543551","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}
Masarat Ayat, M. Masrom, S. Sahibuddin, Mohammad Sharifi
Nowadays, almost all the enterprises in the world fall in Small Medium Enterprises (SMEs) category even though SMEs has different definitions in different countries. At the same time, there is no exemplar standard and /or framework for information technology (IT) governance for SMEs. This paper presents the main issues in implementing IT governance in SMEs. Firstly, it explains the definition of SMEs and their characteristics, secondly it discusses IT governance definition and its framework. Finally, some issues and approaches for ITG implementation in SMEs are described, and end with conclusion and future work.
{"title":"Issues in Implementing IT Governance in Small and Medium Enterprises","authors":"Masarat Ayat, M. Masrom, S. Sahibuddin, Mohammad Sharifi","doi":"10.1109/ISMS.2011.40","DOIUrl":"https://doi.org/10.1109/ISMS.2011.40","url":null,"abstract":"Nowadays, almost all the enterprises in the world fall in Small Medium Enterprises (SMEs) category even though SMEs has different definitions in different countries. At the same time, there is no exemplar standard and /or framework for information technology (IT) governance for SMEs. This paper presents the main issues in implementing IT governance in SMEs. Firstly, it explains the definition of SMEs and their characteristics, secondly it discusses IT governance definition and its framework. Finally, some issues and approaches for ITG implementation in SMEs are described, and end with conclusion and future work.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122150335","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}
Web Services is an upcoming technology in the current Internet revolution. Web Services have a potential to enhance Business to Business collaboration by composing compatible services to a service of higher dimension. Two services are composable only if there is a matching between their conversation protocol. For modeling and matching of conversations, the usability of formal structure like Finite State Machine (FSM) is well studied. However, we are in a opinion that storing, matchmaking and retrieving FSMs using graph structure is not scalable for representing conversation protocol for thousands of web services that will soon be available on web. In order to cope up with the challenge we propose relational model to store FSMs and a query system to retrieve services that are matching to a given service.
{"title":"RDBMS for Service Repository and Matchmaking","authors":"D. Chenthati, H. Mohanty, A. Damodaram","doi":"10.1109/ISMS.2011.53","DOIUrl":"https://doi.org/10.1109/ISMS.2011.53","url":null,"abstract":"Web Services is an upcoming technology in the current Internet revolution. Web Services have a potential to enhance Business to Business collaboration by composing compatible services to a service of higher dimension. Two services are composable only if there is a matching between their conversation protocol. For modeling and matching of conversations, the usability of formal structure like Finite State Machine (FSM) is well studied. However, we are in a opinion that storing, matchmaking and retrieving FSMs using graph structure is not scalable for representing conversation protocol for thousands of web services that will soon be available on web. In order to cope up with the challenge we propose relational model to store FSMs and a query system to retrieve services that are matching to a given service.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125524535","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}
Sara Sharifi Sedeh, M. Nematbakhsh, Faria Nassiri Mofakham
Combinatorial auctions are auctions in which bidders bid on combinations of items, bundles, instead of on individual items. In these auctions, bidders always tend to construct and bid on the most beneficial bundles of items, while facing a substantial number of items. Since there are a huge number of items available in a combinatorial auction, deciding on which items to put in bundles is a challenge for bidders. In combinatorial auctions, bundling of items and bidding on the best possible bundles are of great importance and developing an efficient bidding strategy can increase quality of the auctions considerably. In this paper, we have proposed an efficient bidding strategy. Performance of the proposed strategy in various markets has been simulated and compared with the bidding strategies already available in the literature. The obtained results show that in comparison with the previously available bidding strategies, the proposed strategy is more beneficial to both bidders and auctioneer, especially in markets where there is a considerable difference between values of items.
{"title":"A Bidding Strategy in Combinatorial Auctions","authors":"Sara Sharifi Sedeh, M. Nematbakhsh, Faria Nassiri Mofakham","doi":"10.1109/ISMS.2011.69","DOIUrl":"https://doi.org/10.1109/ISMS.2011.69","url":null,"abstract":"Combinatorial auctions are auctions in which bidders bid on combinations of items, bundles, instead of on individual items. In these auctions, bidders always tend to construct and bid on the most beneficial bundles of items, while facing a substantial number of items. Since there are a huge number of items available in a combinatorial auction, deciding on which items to put in bundles is a challenge for bidders. In combinatorial auctions, bundling of items and bidding on the best possible bundles are of great importance and developing an efficient bidding strategy can increase quality of the auctions considerably. In this paper, we have proposed an efficient bidding strategy. Performance of the proposed strategy in various markets has been simulated and compared with the bidding strategies already available in the literature. The obtained results show that in comparison with the previously available bidding strategies, the proposed strategy is more beneficial to both bidders and auctioneer, especially in markets where there is a considerable difference between values of items.","PeriodicalId":193599,"journal":{"name":"2011 Second International Conference on Intelligent Systems, Modelling and Simulation","volume":"368 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125696579","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
扫码关注我们
求助内容：
应助结果提醒方式：