Pub Date : 2019-08-01DOI: 10.1109/COASE.2019.8843192
Jingchuan Chen, Zhiyang Jia, Yaping Dai
Owing to the environment of current intelligent manufacturing strategies (e.g., “Industry 4.0”, “Advanced Manufacturing Partnership 2.0”, and “Made in China 2025 flexible production is becoming prevalent in modern production systems. Compared to mass production systems, flexible production systems have relatively received less research attention. On the other hand, in flexible production environments, to fabricate the products of multiple types, there sometimes exists a transition to adjust and set up system configuration when the type of processed products is changed. Production runs are separated by the transitions. As a result, batch-based production is widely used in flexible production systems. In this paper, under the framework of batch-based serial flexible production lines with finite buffers and machines obeying the geometric reliability model, we study the problem of real-time performance analysis of such systems. Specifically, for oneand two-machine lines, we study the mathematical model. Exact Markovian analysis is used to derive the closed-form formula for calculating the real-time performances measures, i.e., production rates, consumption rates, work-in-process. Moreover, the distribution, the mean, and the standard deviation of completion time are studied. For longer lines, the preliminary results based on the Monte Carlo simulation are presented.
{"title":"Real-Time Performance Analysis of Batch-Based Serial Flexible Production Lines With Geometric Machines","authors":"Jingchuan Chen, Zhiyang Jia, Yaping Dai","doi":"10.1109/COASE.2019.8843192","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843192","url":null,"abstract":"Owing to the environment of current intelligent manufacturing strategies (e.g., “Industry 4.0”, “Advanced Manufacturing Partnership 2.0”, and “Made in China 2025 flexible production is becoming prevalent in modern production systems. Compared to mass production systems, flexible production systems have relatively received less research attention. On the other hand, in flexible production environments, to fabricate the products of multiple types, there sometimes exists a transition to adjust and set up system configuration when the type of processed products is changed. Production runs are separated by the transitions. As a result, batch-based production is widely used in flexible production systems. In this paper, under the framework of batch-based serial flexible production lines with finite buffers and machines obeying the geometric reliability model, we study the problem of real-time performance analysis of such systems. Specifically, for oneand two-machine lines, we study the mathematical model. Exact Markovian analysis is used to derive the closed-form formula for calculating the real-time performances measures, i.e., production rates, consumption rates, work-in-process. Moreover, the distribution, the mean, and the standard deviation of completion time are studied. For longer lines, the preliminary results based on the Monte Carlo simulation are presented.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"15 1","pages":"97-102"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80257432","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 : 2019-08-01DOI: 10.1109/COASE.2019.8842972
T. Kaneko, Yoshihisa Tsurumine, James Poon, Y. Onuki, Yingda Dai, Kaoru Kawabata, Takamitsu Matsubara
This paper presents an approach for predicting in-furnace images and sensor signal readings for a waste incineration plant, utilizing a deep dynamical model based on Kalman Variational Auto-Encoders that considers a range of process signals, control inputs, and time-series sequences of infurnace image data. This is motivated by the need for automatic control systems to be able to anticipate abnormalities in incoming waste to prevent potential instabilities during and after combustion. Experimental results with real plant data show that the proposed strategy provides an improved prediction accuracy for both process signals and in-furnace images compared to a Long Short-Term Memory neural network.
{"title":"Learning Deep Dynamical Models of a Waste Incineration Plant from In-furnace Images and Process Data","authors":"T. Kaneko, Yoshihisa Tsurumine, James Poon, Y. Onuki, Yingda Dai, Kaoru Kawabata, Takamitsu Matsubara","doi":"10.1109/COASE.2019.8842972","DOIUrl":"https://doi.org/10.1109/COASE.2019.8842972","url":null,"abstract":"This paper presents an approach for predicting in-furnace images and sensor signal readings for a waste incineration plant, utilizing a deep dynamical model based on Kalman Variational Auto-Encoders that considers a range of process signals, control inputs, and time-series sequences of infurnace image data. This is motivated by the need for automatic control systems to be able to anticipate abnormalities in incoming waste to prevent potential instabilities during and after combustion. Experimental results with real plant data show that the proposed strategy provides an improved prediction accuracy for both process signals and in-furnace images compared to a Long Short-Term Memory neural network.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"44 1","pages":"873-878"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79146804","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 : 2019-08-01DOI: 10.1109/COASE.2019.8842831
Julian Wanner, O. Sawodny
Tool-center-point control allows efficient and intuitive operation of a mobile concrete pump at task space level. Besides controlling the end-effector, numerous additional requirements and constraints act on the control system. The deformation of the flexible manipulator and volumetric flow rate constraints in the hydraulic actuation system effect the operation of the tool-center-point control. In this paper a deformation compensation and a volumetric flow rate constraint for a kinematic, constrained quadratic optimization (cQP) based tool-center point control is presented. The methods are validated by simulation for a flexible five-link concrete pump.
{"title":"Tool-center-point control of a flexible link concrete pump with hydraulic limitations using quadratic programming","authors":"Julian Wanner, O. Sawodny","doi":"10.1109/COASE.2019.8842831","DOIUrl":"https://doi.org/10.1109/COASE.2019.8842831","url":null,"abstract":"Tool-center-point control allows efficient and intuitive operation of a mobile concrete pump at task space level. Besides controlling the end-effector, numerous additional requirements and constraints act on the control system. The deformation of the flexible manipulator and volumetric flow rate constraints in the hydraulic actuation system effect the operation of the tool-center-point control. In this paper a deformation compensation and a volumetric flow rate constraint for a kinematic, constrained quadratic optimization (cQP) based tool-center point control is presented. The methods are validated by simulation for a flexible five-link concrete pump.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"27 1","pages":"561-566"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84501657","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843017
Hongyu Xie, Qing Xiao, Dong Zhang, Zhengcai Cao
This paper addresses the issue of dense semantic mapping in hazy scenes. In the past few decades, extensive research has been performed on semantic mapping in clear scenes. However, there was little attention on dense semantic mapping in hazy environments. In this paper, we try to solve this problem. Towards this aim, we introduce a hazy dataset which is built on the TUM dataset. In order to explore the haze effect on dense semantic mapping, we have performed a lot of experiments and evaluated several state-of-the-art dehazing methods. In addition, we adopt a convolutional neural network (CNN) for image preprocessing to improve the robustness of robot localization and mapping in hazy scenes. The experimental results show that a good dehazing method can effectively reduce the tracking failure of simultaneous localization and mapping (SLAM) in hazy scenes and benefit semantic understanding.
{"title":"The Analysis of Haze Effect on Dense Semantic Mapping","authors":"Hongyu Xie, Qing Xiao, Dong Zhang, Zhengcai Cao","doi":"10.1109/COASE.2019.8843017","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843017","url":null,"abstract":"This paper addresses the issue of dense semantic mapping in hazy scenes. In the past few decades, extensive research has been performed on semantic mapping in clear scenes. However, there was little attention on dense semantic mapping in hazy environments. In this paper, we try to solve this problem. Towards this aim, we introduce a hazy dataset which is built on the TUM dataset. In order to explore the haze effect on dense semantic mapping, we have performed a lot of experiments and evaluated several state-of-the-art dehazing methods. In addition, we adopt a convolutional neural network (CNN) for image preprocessing to improve the robustness of robot localization and mapping in hazy scenes. The experimental results show that a good dehazing method can effectively reduce the tracking failure of simultaneous localization and mapping (SLAM) in hazy scenes and benefit semantic understanding.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"86 1","pages":"1118-1123"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80821509","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843112
Zhengxuan Jia, Yingying Xiao, Guoqiang Shi, Mei Wang, Tingyu Lin, Z. Shen
Taking Internet as carrier and adopting emerging information and communication technology, intelligent science which exerts dramatic influence on the development approach of regional manufacturing industry. In this paper, the development approach of regional manufacturing industry in driving forces of the transformation and upgrading of Smart Cloud Manufacturing (CMfg) platform and the influence of Smart CMfg platform on collaboration among manufacturing enterprises. Through complex network theory based analysis on that individual manufacturing enterprises should actively conduct technological, business model, and management innovation, and comply with the guidance policies proposed by local government to accomplish the upgrading of both individual enterprises and regional manufacturing industry has been concluded.
{"title":"Research on the development approach of regional manufacturing industry in Internet+era*","authors":"Zhengxuan Jia, Yingying Xiao, Guoqiang Shi, Mei Wang, Tingyu Lin, Z. Shen","doi":"10.1109/COASE.2019.8843112","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843112","url":null,"abstract":"Taking Internet as carrier and adopting emerging information and communication technology, intelligent science which exerts dramatic influence on the development approach of regional manufacturing industry. In this paper, the development approach of regional manufacturing industry in driving forces of the transformation and upgrading of Smart Cloud Manufacturing (CMfg) platform and the influence of Smart CMfg platform on collaboration among manufacturing enterprises. Through complex network theory based analysis on that individual manufacturing enterprises should actively conduct technological, business model, and management innovation, and comply with the guidance policies proposed by local government to accomplish the upgrading of both individual enterprises and regional manufacturing industry has been concluded.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"61 1","pages":"356-361"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77916013","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843159
A.F. van der Stappen, Mansoor Davoodi Monfared
We study the problem of bounding the number of fingers that suffice to immobilize a serial chain of n polyhedra ($mathcal{P}_{1}, ldots, mathcal{P}_{n}$), in which each pair of consecutive polyhedra $mathcal{P}_{i}$ and $mathcal{P}_{i+1}$ (for 1 $leq$ i < n) in the chain shares exactly one vertex $rho_{i}$. This vertex $rho_{i}$ serves as a rotational joint, or hinge. We consider hinges $rho_{i}$ with one degree of freedom, allowing for rotation of both incident subchains about a rotation axis $ell_{i}$ through $rho_{i}$, and with three degrees of freedom, allowing for free rotation of the incident subchains about $rho_{i}$ itself. Besides immobility, we also study robust immobility [1] which additionally requires that sufficiently small perturbations of fingers along their respective facets do not destroy the immobility. Our paper provides the first bounds on the number offingers that suffice to immobilize three-dimensional articulated structures in any given configuration. The bounds are constructive in the sense that we point out how many fingers should be placed on each of the polyhedra in the chain. In the case of hinges with one degree of freedom, we show that 2 n+5 fingers suffice to immobilize a chain of arbitrary polyhedra robustly. If all polyhedra are convex and each axis $ell_{i}$ intersects the adjacent polyhedron $mathcal{P}_{i+1}$ then only at most n+6 fingers suffice to immobilize the chain. In the case of hinges with three degree of freedom, we obtain bounds for arbitrary polyhedra and for irregular polyhedra, which satisfy the condition that the normals to any three different facets are linearly independent. We find that 4 n+5 fingers suffice to immobilize a chain of arbitrary polyhedra robustly. We also show that 3 n+1 fingers suffice to immobilize the chain if the polyhedra are irregular. If, in addition, all polyhedra are convex and no two hinges belong to a single facet of a polyhedron then only $displaystyle lfloorfrac{5}{2}n+2rfloor$ fingers suffice.
{"title":"On Sufficient Numbers of Fingers to Immobilize 3D Chains of Polyhedra","authors":"A.F. van der Stappen, Mansoor Davoodi Monfared","doi":"10.1109/COASE.2019.8843159","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843159","url":null,"abstract":"We study the problem of bounding the number of fingers that suffice to immobilize a serial chain of n polyhedra ($mathcal{P}_{1}, ldots, mathcal{P}_{n}$), in which each pair of consecutive polyhedra $mathcal{P}_{i}$ and $mathcal{P}_{i+1}$ (for 1 $leq$ i < n) in the chain shares exactly one vertex $rho_{i}$. This vertex $rho_{i}$ serves as a rotational joint, or hinge. We consider hinges $rho_{i}$ with one degree of freedom, allowing for rotation of both incident subchains about a rotation axis $ell_{i}$ through $rho_{i}$, and with three degrees of freedom, allowing for free rotation of the incident subchains about $rho_{i}$ itself. Besides immobility, we also study robust immobility [1] which additionally requires that sufficiently small perturbations of fingers along their respective facets do not destroy the immobility. Our paper provides the first bounds on the number offingers that suffice to immobilize three-dimensional articulated structures in any given configuration. The bounds are constructive in the sense that we point out how many fingers should be placed on each of the polyhedra in the chain. In the case of hinges with one degree of freedom, we show that 2 n+5 fingers suffice to immobilize a chain of arbitrary polyhedra robustly. If all polyhedra are convex and each axis $ell_{i}$ intersects the adjacent polyhedron $mathcal{P}_{i+1}$ then only at most n+6 fingers suffice to immobilize the chain. In the case of hinges with three degree of freedom, we obtain bounds for arbitrary polyhedra and for irregular polyhedra, which satisfy the condition that the normals to any three different facets are linearly independent. We find that 4 n+5 fingers suffice to immobilize a chain of arbitrary polyhedra robustly. We also show that 3 n+1 fingers suffice to immobilize the chain if the polyhedra are irregular. If, in addition, all polyhedra are convex and no two hinges belong to a single facet of a polyhedron then only $displaystyle lfloorfrac{5}{2}n+2rfloor$ fingers suffice.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"14 1","pages":"1443-1449"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73182326","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843137
Yang Miao, Jianping He, Shanying Zhu
A cooperative charging protocol for the super-capacitors on catenary-free trams is a promising method to solve the high-power-charging load. The protocol can efficiently improve the dynamic performance of the charging system by reducing the imbalances and overshoots of currents when the transfer data is highly accurate. However, it is noting that some internal circuit failures and external attacks will cause fault data, which is inevitable in the charging system. The fault data may reduce or even break the reliability of the system under the cooperative charging protocol. In this paper, we investigate the causes of fault data and what effects it may bring to the system with cooperative charging protocol. To solve the problem, we propose a reliable cooperative charging protocol with a data screening mechanism added in the existing protocol to guarantee the charging system from fault data. In addition, we show that the reliable cooperative charging protocol enhances the reliability of the charging system with fault data. Both simulations and experiments are conducted to demonstrate the effectiveness of the proposed protocol.
{"title":"Reliable Cooperative Charging Protocol against Fault Data for Supercapacitors Charging Systems","authors":"Yang Miao, Jianping He, Shanying Zhu","doi":"10.1109/COASE.2019.8843137","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843137","url":null,"abstract":"A cooperative charging protocol for the super-capacitors on catenary-free trams is a promising method to solve the high-power-charging load. The protocol can efficiently improve the dynamic performance of the charging system by reducing the imbalances and overshoots of currents when the transfer data is highly accurate. However, it is noting that some internal circuit failures and external attacks will cause fault data, which is inevitable in the charging system. The fault data may reduce or even break the reliability of the system under the cooperative charging protocol. In this paper, we investigate the causes of fault data and what effects it may bring to the system with cooperative charging protocol. To solve the problem, we propose a reliable cooperative charging protocol with a data screening mechanism added in the existing protocol to guarantee the charging system from fault data. In addition, we show that the reliable cooperative charging protocol enhances the reliability of the charging system with fault data. Both simulations and experiments are conducted to demonstrate the effectiveness of the proposed protocol.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"41 1","pages":"954-959"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82470834","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843144
Junxia Xing, F. Qiao, Hong Lu
The aim of this paper is to address the energy-efficient scheduling problems in the hybrid flow shop problem (HFSP) with machine maintenance. For this aim, the mixed integer programming model (MIPM) considering energy consumption and machine maintenance is proposed firstly. Given the NP-hard nature of the model, a hybrid multi-objective algorithm (HMOA) combining an improved algorithm based on the Non-Dominated Sorting Genetic Algorithm (NSGA-II-imp) with a heuristic algorithm is developed to solve MIPM. The NSGA-II-imp designs a new elite remained strategy for the purpose of balancing two conflict objectives and a heuristic algorithm is mainly designed to add machine maintenance during production scheduling. Finally, the proposed algorithm is compared to GA, SA-GA, NSGA-II separately based on extensive numerical experiments. Results show the effectiveness of the algorithm in this paper.
{"title":"A Hybrid Multi-objective Algorithm for Energy-Efficient Scheduling Considering Machine Maintenance*","authors":"Junxia Xing, F. Qiao, Hong Lu","doi":"10.1109/COASE.2019.8843144","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843144","url":null,"abstract":"The aim of this paper is to address the energy-efficient scheduling problems in the hybrid flow shop problem (HFSP) with machine maintenance. For this aim, the mixed integer programming model (MIPM) considering energy consumption and machine maintenance is proposed firstly. Given the NP-hard nature of the model, a hybrid multi-objective algorithm (HMOA) combining an improved algorithm based on the Non-Dominated Sorting Genetic Algorithm (NSGA-II-imp) with a heuristic algorithm is developed to solve MIPM. The NSGA-II-imp designs a new elite remained strategy for the purpose of balancing two conflict objectives and a heuristic algorithm is mainly designed to add machine maintenance during production scheduling. Finally, the proposed algorithm is compared to GA, SA-GA, NSGA-II separately based on extensive numerical experiments. Results show the effectiveness of the algorithm in this paper.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"40 1","pages":"115-120"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86346677","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 : 2019-08-01DOI: 10.1109/COASE.2019.8843199
Ashwin Ramesh Babu, Mohammad Zakizadeh, J. Brady, Diane Calderon, F. Makedon
This paper proposes a novel intelligent system to monitor and assess cognitive behavior through physical tasks which are part of assessment and training for people with Executive Function Disorder. The tasks are specifically designed to fit in the theory of “embodied cognition”, where cognition can be influenced through physical activities. Usually, these assessments are performed by psychologists who manually monitor and score patients which is tiresome and time consuming. The proposed system automates this process by capturing the minute movements of the subjects, analyzing and predicting the action performed by using state of the art computer vision techniques. Detailed visualization of the user’s performance can be viewed in real time through an intelligent Graphical User Interface(GUI) which also provides support for the expert to view the performance statistics remotely. Data was collected from 5 participants with two variations to quantitatively and qualitatively increase the dataset which was combined with an existing public dataset. The action recognition, which is the core of the system, was developed using multiple algorithms, with 3D Convolutional Neural Network performing the best with a maximum of 80 percent accuracy on test set.
{"title":"An Intelligent Action Recognition System to assess Cognitive Behavior for Executive Function Disorder","authors":"Ashwin Ramesh Babu, Mohammad Zakizadeh, J. Brady, Diane Calderon, F. Makedon","doi":"10.1109/COASE.2019.8843199","DOIUrl":"https://doi.org/10.1109/COASE.2019.8843199","url":null,"abstract":"This paper proposes a novel intelligent system to monitor and assess cognitive behavior through physical tasks which are part of assessment and training for people with Executive Function Disorder. The tasks are specifically designed to fit in the theory of “embodied cognition”, where cognition can be influenced through physical activities. Usually, these assessments are performed by psychologists who manually monitor and score patients which is tiresome and time consuming. The proposed system automates this process by capturing the minute movements of the subjects, analyzing and predicting the action performed by using state of the art computer vision techniques. Detailed visualization of the user’s performance can be viewed in real time through an intelligent Graphical User Interface(GUI) which also provides support for the expert to view the performance statistics remotely. Data was collected from 5 participants with two variations to quantitatively and qualitatively increase the dataset which was combined with an existing public dataset. The action recognition, which is the core of the system, was developed using multiple algorithms, with 3D Convolutional Neural Network performing the best with a maximum of 80 percent accuracy on test set.","PeriodicalId":6695,"journal":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","volume":"21 1","pages":"164-169"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91531993","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
扫码关注我们
求助内容：
应助结果提醒方式：