Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7333980
Kajornvut Ounjai, B. Kaewkamnerdpong, Chailerd Pichitpornchai
Dynamic Causal Modeling (DCM) for fMRI was first proposed to estimate brain connectivity from fMRI data. However, the parameter estimation with Expectation Maximization (EM) method in DCM is prone to local optima. To improve the performance of parameter estimation, this study proposed a hybrid method that integrates the concept of Artificial Bee Colony (ABC) optimization with generic EM used in DCM. From the investigation on real fMRI dataset, the results can indicate that the proposed method could provide higher opportunity to avoid local optimal solution and obtain better final outputs when compared with generic EM. ABC-EM has shown the potential to be a candidate algorithm for DCM estimate brain connectivity for complex experimental tasks involving large number of brain regions and stimuli. Even though the computation time may be concerned, the design of ABC-EM can support parallel computing. The use of ABC-EM on parallel computing system could reduce the computation time.
{"title":"Improving parameter estimation in Dynamic Casual Modeling with Artificial Bee Colony optimization","authors":"Kajornvut Ounjai, B. Kaewkamnerdpong, Chailerd Pichitpornchai","doi":"10.1109/ICIEV.2015.7333980","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7333980","url":null,"abstract":"Dynamic Causal Modeling (DCM) for fMRI was first proposed to estimate brain connectivity from fMRI data. However, the parameter estimation with Expectation Maximization (EM) method in DCM is prone to local optima. To improve the performance of parameter estimation, this study proposed a hybrid method that integrates the concept of Artificial Bee Colony (ABC) optimization with generic EM used in DCM. From the investigation on real fMRI dataset, the results can indicate that the proposed method could provide higher opportunity to avoid local optimal solution and obtain better final outputs when compared with generic EM. ABC-EM has shown the potential to be a candidate algorithm for DCM estimate brain connectivity for complex experimental tasks involving large number of brain regions and stimuli. Even though the computation time may be concerned, the design of ABC-EM can support parallel computing. The use of ABC-EM on parallel computing system could reduce the computation time.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127513909","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7334068
A. Jha, Ayush Kumar, G. Schaefer, Md Atiqur Rahman Ahad
In this paper, we propose a new image interpolation method using adaptive weights based on inverse gradients and distances from the pixels used in prediction. Since the weights are based on different spatial locations of the pixels, this allows preservation of important edge information and hence to prevent extensive blurring across edges in the upsampling process. Experimental results on a large test image set show that the proposed algorithm gives better performance compared to conventional algorithms.
{"title":"An adaptive distance-based edge preserving interpolation algorithm for natural images","authors":"A. Jha, Ayush Kumar, G. Schaefer, Md Atiqur Rahman Ahad","doi":"10.1109/ICIEV.2015.7334068","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7334068","url":null,"abstract":"In this paper, we propose a new image interpolation method using adaptive weights based on inverse gradients and distances from the pixels used in prediction. Since the weights are based on different spatial locations of the pixels, this allows preservation of important edge information and hence to prevent extensive blurring across edges in the upsampling process. Experimental results on a large test image set show that the proposed algorithm gives better performance compared to conventional algorithms.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125716714","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7334057
Katsuhiro Honda, S. Ubukata, A. Notsu, Norimitsu Takahashi, Yutaka Ishikawa
Semi-supervised clustering is an efficient scheme for utilizing data with partial class information, where unsupervised data distributions are estimated under some supports of partial supervised class information. In this paper, a novel framework for performing fuzzy co-clustering of cooccurrence information with partial supervision is proposed, which is induced by multinomial mixture concept. Co-clustering is useful for extracting object-item pair-wise clusters from cooccurrence information and has been utilized in various applications such as document-keyword analysis and customer-products purchase history data analysis. Several experimental results including a twitter data analysis demonstrate the ability of improving the classification quality of the fuzzified co-cluster structural knowledge. Then, the proposed semi-supervised framework is expected to be a powerful tool in Big Data analysis with huge volumes of data but partial supervisions only.
{"title":"A semi-supervised fuzzy co-clustering framework and application to twitter data analysis","authors":"Katsuhiro Honda, S. Ubukata, A. Notsu, Norimitsu Takahashi, Yutaka Ishikawa","doi":"10.1109/ICIEV.2015.7334057","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7334057","url":null,"abstract":"Semi-supervised clustering is an efficient scheme for utilizing data with partial class information, where unsupervised data distributions are estimated under some supports of partial supervised class information. In this paper, a novel framework for performing fuzzy co-clustering of cooccurrence information with partial supervision is proposed, which is induced by multinomial mixture concept. Co-clustering is useful for extracting object-item pair-wise clusters from cooccurrence information and has been utilized in various applications such as document-keyword analysis and customer-products purchase history data analysis. Several experimental results including a twitter data analysis demonstrate the ability of improving the classification quality of the fuzzified co-cluster structural knowledge. Then, the proposed semi-supervised framework is expected to be a powerful tool in Big Data analysis with huge volumes of data but partial supervisions only.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123028661","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7334024
W. Budiharto, P. Rumondor, Meiliana, Ferdianto
This paper presents the development of Android-based framework for improving marriage satisfaction without having to spend time and money for the marriage counselor. Classic research in psychology found that stability of marriage is based on the ability to create and maintain a positive interaction ratio 5 times more than negative interactions. Based on that, we propose a method to record information of daily positive behaviors (joking, showing affection) of couples that using our application. We propose a method where the apps can determine users' marital satisfaction level and also can help the users to increasing their marriage satisfaction based on the assessment of the results of questionnaire and the assessment of user's behaviors to their partners using fuzzy logic. The experimental results are presented and shown the application is running well on mobile devices based on Android platform.
{"title":"Android-based framework for increasing marriage satisfaction based on psychological aspects","authors":"W. Budiharto, P. Rumondor, Meiliana, Ferdianto","doi":"10.1109/ICIEV.2015.7334024","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7334024","url":null,"abstract":"This paper presents the development of Android-based framework for improving marriage satisfaction without having to spend time and money for the marriage counselor. Classic research in psychology found that stability of marriage is based on the ability to create and maintain a positive interaction ratio 5 times more than negative interactions. Based on that, we propose a method to record information of daily positive behaviors (joking, showing affection) of couples that using our application. We propose a method where the apps can determine users' marital satisfaction level and also can help the users to increasing their marriage satisfaction based on the assessment of the results of questionnaire and the assessment of user's behaviors to their partners using fuzzy logic. The experimental results are presented and shown the application is running well on mobile devices based on Android platform.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123969429","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7333979
Maria del Pilar Angeles, Luis Fernando Perez-Franco
The present research is aimed to help users to identify which encoding functions are more effective than others in terms of data matching quality. Therefore, we have carried out an evaluation of data matching considering Soundex Daitch-Mokotoff [1], Fuzzy Soundex [2] and Modified Soundex [3] in terms of precision-recall and f-measure. As far as we know such comparison against these encoding functions has not been presented before in such terms. The Daitch Mokotoff Soundex function has a better performance during string comparison. However, its execution time is greater than Fuzzy Soundex and Modified Soundex. This is justificable since the Daitch-Mokotoff Soundex algorithm is more complex and meticulous.
{"title":"Analysis of string encoding functions during de-duplication process","authors":"Maria del Pilar Angeles, Luis Fernando Perez-Franco","doi":"10.1109/ICIEV.2015.7333979","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7333979","url":null,"abstract":"The present research is aimed to help users to identify which encoding functions are more effective than others in terms of data matching quality. Therefore, we have carried out an evaluation of data matching considering Soundex Daitch-Mokotoff [1], Fuzzy Soundex [2] and Modified Soundex [3] in terms of precision-recall and f-measure. As far as we know such comparison against these encoding functions has not been presented before in such terms. The Daitch Mokotoff Soundex function has a better performance during string comparison. However, its execution time is greater than Fuzzy Soundex and Modified Soundex. This is justificable since the Daitch-Mokotoff Soundex algorithm is more complex and meticulous.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127902636","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7334049
A. Jalal, S. Kamal, Adnan Farooq, Daijin Kim
Video and image analysis technologies have made human action recognition as an interesting field and used in many practical application systems such as visual surveillance systems, healthcare monitoring systems, 3D games and smart home. In this paper, we address the challenges of automatic tracking, detection and recognition of three-dimensional human pose-based actions from sequences of depth maps. Specifically, we have designed our proposed idea into a probabilistic framework: (1) dividing each action into meaningful ordered temporal segments, (2) using pixel-neighboring intensity difference approach to identify human shape region from the confused scenes, (3) introducing a robust spatiotemporal features to extract 3D joints information via local distance features and depth human shape information to get motion variation features and (4) finally these sets of features are merged together and their feature vectors are further reduced and discriminated to get optimal vectors for real-world applications. Next, the augmented features are enhanced and symbolized by Linde-Buzo-Gray clustering algorithm for better action recognition. With these symbols, each action hidden Markov model (HMM) is trained and tested for action recognition. The experimental results demonstrated our proposed approach on three challenging depth video datasets: IM-DepthActions, MSRAction3D and MSRDailyActivity3D, producing significantly improved results over the state-of-the-art methods: especially for those actions that are not easily discernible by the existing methods.
{"title":"A spatiotemporal motion variation features extraction approach for human tracking and pose-based action recognition","authors":"A. Jalal, S. Kamal, Adnan Farooq, Daijin Kim","doi":"10.1109/ICIEV.2015.7334049","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7334049","url":null,"abstract":"Video and image analysis technologies have made human action recognition as an interesting field and used in many practical application systems such as visual surveillance systems, healthcare monitoring systems, 3D games and smart home. In this paper, we address the challenges of automatic tracking, detection and recognition of three-dimensional human pose-based actions from sequences of depth maps. Specifically, we have designed our proposed idea into a probabilistic framework: (1) dividing each action into meaningful ordered temporal segments, (2) using pixel-neighboring intensity difference approach to identify human shape region from the confused scenes, (3) introducing a robust spatiotemporal features to extract 3D joints information via local distance features and depth human shape information to get motion variation features and (4) finally these sets of features are merged together and their feature vectors are further reduced and discriminated to get optimal vectors for real-world applications. Next, the augmented features are enhanced and symbolized by Linde-Buzo-Gray clustering algorithm for better action recognition. With these symbols, each action hidden Markov model (HMM) is trained and tested for action recognition. The experimental results demonstrated our proposed approach on three challenging depth video datasets: IM-DepthActions, MSRAction3D and MSRDailyActivity3D, producing significantly improved results over the state-of-the-art methods: especially for those actions that are not easily discernible by the existing methods.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121371546","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7333993
Jun Lu, Jian-guo Yang, Y. Ma, R. Ren
Resulting in the ripple of electromagnetic torque, high order harmonic flux and current of permanent magnet synchronous motor (PMSM) are generated by the nonlinear characteristics of inverter and the distortion of air-gap magnetic field. In this paper, a novel harmonic compensation algorithm was presented to reduce the harmonic components of flux and current. Based on the harmonic model of the PMSM, harmonic voltage is injected to compensate the harmonic components of the motor flux and current. By extraction of harmonic flux/current and injection of harmonic voltage in real-time, high-order harmonics of flux generated by the nonlinear characteristics of inverter and the distortion of air-gap magnetic field is counteracted. Thereby, distortion of motor current is reduced. The effectiveness of the algorithm is validated by simulation and experimentation.
{"title":"Compensation for harmonic flux and current of permanent magnet synchronous motor by harmonic voltage","authors":"Jun Lu, Jian-guo Yang, Y. Ma, R. Ren","doi":"10.1109/ICIEV.2015.7333993","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7333993","url":null,"abstract":"Resulting in the ripple of electromagnetic torque, high order harmonic flux and current of permanent magnet synchronous motor (PMSM) are generated by the nonlinear characteristics of inverter and the distortion of air-gap magnetic field. In this paper, a novel harmonic compensation algorithm was presented to reduce the harmonic components of flux and current. Based on the harmonic model of the PMSM, harmonic voltage is injected to compensate the harmonic components of the motor flux and current. By extraction of harmonic flux/current and injection of harmonic voltage in real-time, high-order harmonics of flux generated by the nonlinear characteristics of inverter and the distortion of air-gap magnetic field is counteracted. Thereby, distortion of motor current is reduced. The effectiveness of the algorithm is validated by simulation and experimentation.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128652590","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7333985
H. Wakuya, Kohei Nakata, Hideaki Itoh, Sang-Hoon Oh, Yong-Sun Oh
A Hopfield network is one of the famous neural network models proposed in 1980s, and it is known as a good tool for solving combinatorial optimization problems. Its working mechanismis quite easy to understand, because its state transition is carried out to reduce the energy defined in advance. But it is true that there are some drawbacks. One is the existence of local energyminima corresponding to spurious solutions. Another is a size of the given task. Generally speaking, it is said that a large-scale network shows poor performance compared with a small-scale one, because the number of combinations for all possibilities are larger. In order to overcome the latter issue, an idea of partitioning applied constraints is tried in this study. Its key aspect is as follows: i) all constraints are divided into several groups, and ii) some of them are applied iteratively while the Hopfield network is searching an optimal solution. As a result of some computer simulations, it is found that the proposed method shows a better score than the conventional method.
{"title":"Search performance for solving combinatorial optimization problems by a Hopfield network with applying iterative partial constraints","authors":"H. Wakuya, Kohei Nakata, Hideaki Itoh, Sang-Hoon Oh, Yong-Sun Oh","doi":"10.1109/ICIEV.2015.7333985","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7333985","url":null,"abstract":"A Hopfield network is one of the famous neural network models proposed in 1980s, and it is known as a good tool for solving combinatorial optimization problems. Its working mechanismis quite easy to understand, because its state transition is carried out to reduce the energy defined in advance. But it is true that there are some drawbacks. One is the existence of local energyminima corresponding to spurious solutions. Another is a size of the given task. Generally speaking, it is said that a large-scale network shows poor performance compared with a small-scale one, because the number of combinations for all possibilities are larger. In order to overcome the latter issue, an idea of partitioning applied constraints is tried in this study. Its key aspect is as follows: i) all constraints are divided into several groups, and ii) some of them are applied iteratively while the Hopfield network is searching an optimal solution. As a result of some computer simulations, it is found that the proposed method shows a better score than the conventional method.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128055972","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7333978
Yosuke Uozumi, K. Nagamune
Total knee arthroplasty (TKA) is an effective surgical treatment for the knee osteoarthritis, and is currently performed about 50,000 per year in Japan. TAK minimally invasive surgery (TKA-MIS) is a smaller incision range than TKA, and can expect an early recovery and post-surgical pain reduction. The navigation system for the purpose of precision improvement and shortening of the operative time operated on has been already studied. However, a study for the instruction system to improve the skill of surgeons has not yet advanced. This study aims to develop a training system which can makes non-expert surgeon improved the skill by simulating the TKA-MIS. The proposed method developed a simulator for the knee model with a three-dimensional electromagnetism sensor. The experiment established an evaluation method for the skin incision by tracing a sham scalpel trace. The developed system was applied to one non-experts. In the experimental results, non-teaching case was 65.80+/-7.00; teaching case, 83.44+/-11.04 (p = 0.00 <; 0.05, student t-test). The experimental result leads to the conclusion that the proposed training system has the learning effect.
{"title":"3D interactive trace teaching system with anatomical model","authors":"Yosuke Uozumi, K. Nagamune","doi":"10.1109/ICIEV.2015.7333978","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7333978","url":null,"abstract":"Total knee arthroplasty (TKA) is an effective surgical treatment for the knee osteoarthritis, and is currently performed about 50,000 per year in Japan. TAK minimally invasive surgery (TKA-MIS) is a smaller incision range than TKA, and can expect an early recovery and post-surgical pain reduction. The navigation system for the purpose of precision improvement and shortening of the operative time operated on has been already studied. However, a study for the instruction system to improve the skill of surgeons has not yet advanced. This study aims to develop a training system which can makes non-expert surgeon improved the skill by simulating the TKA-MIS. The proposed method developed a simulator for the knee model with a three-dimensional electromagnetism sensor. The experiment established an evaluation method for the skin incision by tracing a sham scalpel trace. The developed system was applied to one non-experts. In the experimental results, non-teaching case was 65.80+/-7.00; teaching case, 83.44+/-11.04 (p = 0.00 <; 0.05, student t-test). The experimental result leads to the conclusion that the proposed training system has the learning effect.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126067248","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}
Pub Date : 2015-06-15DOI: 10.1109/ICIEV.2015.7334040
S. Toha, H. Yusof, M. Razali, Abdul Halim
Visually impaired person faced difficulty in limited movement, even in their house. A study on this field based on engineering concept is vital to help the visually impaired people. It is very important that this research come out with an intelligent path guidance robot to assist the visually impaired people in their movement. This paper presents the design and implementation of an intelligent path guidance robot to assist the visually impaired people in their movement (iPath). The robot has the capability to follow a path that is provided on the floor and also detect any obstacle that is blocking the path. Apart from that, the robot can sense the motion of the user. The robot can also detect when the user wants the robot to increase or decrease its speed. Another great advantage of the robot is that the cane that is attached on the robot can be easily detached from the robot body. In addition, the hardware design for the robot is small and lightweight. Thus, visually impaired people can comfortably receive the help from the robot in assisting their movement.
{"title":"Intelligent path guidance robot for blind person assistance","authors":"S. Toha, H. Yusof, M. Razali, Abdul Halim","doi":"10.1109/ICIEV.2015.7334040","DOIUrl":"https://doi.org/10.1109/ICIEV.2015.7334040","url":null,"abstract":"Visually impaired person faced difficulty in limited movement, even in their house. A study on this field based on engineering concept is vital to help the visually impaired people. It is very important that this research come out with an intelligent path guidance robot to assist the visually impaired people in their movement. This paper presents the design and implementation of an intelligent path guidance robot to assist the visually impaired people in their movement (iPath). The robot has the capability to follow a path that is provided on the floor and also detect any obstacle that is blocking the path. Apart from that, the robot can sense the motion of the user. The robot can also detect when the user wants the robot to increase or decrease its speed. Another great advantage of the robot is that the cane that is attached on the robot can be easily detached from the robot body. In addition, the hardware design for the robot is small and lightweight. Thus, visually impaired people can comfortably receive the help from the robot in assisting their movement.","PeriodicalId":367355,"journal":{"name":"2015 International Conference on Informatics, Electronics & Vision (ICIEV)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127189702","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
扫码关注我们
求助内容：
应助结果提醒方式：