{"title":"Energy Distribution Image Processing of Stroke EEG Signal using Gray Level Co-occurrence Matrix","authors":"Safira Amalia, Koredianto Usman, Hilman Fauzi","doi":"10.1109/IAICT55358.2022.9887511","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887511","url":null,"abstract":"In this study, we propose the effect of Electroencephalography (EEG) stroke signal processing into energy distribution images using energy distribution for stroke conditions. The EEG signals are used as an alternative method to help the improvement of Brain Computer Interface (BCI) to detect stroke conditions. The energy distribution clarifies the relationship for each channel while converting the EEG signal into an energy distribution image. The Gray-Level Co-Occurrence Matrix (GLCM) with Genetic Algorithm (GA) and ANN-BP are used as a method for image feature values to get the optimal system feature after brain mapping using Power Spectrum Density (PSD). We evaluate the system performances via a series of computer simulations. We investigate the feature combination using GLCM by taking the best 11 features, i.e., contrast, correlation, variance, entropy, homogeneity, energy, sum variance, sum entropy, difference variance, difference entropy and inverse difference momentum with an accuracy equal to 61.25%. Thus, the GA uses to select the feature on GLCM in order to find the best combination for the BCI system in this study. We found the accuracy value of GA-GLCM equals 72.5% with features, i.e., contrast, correlation, homogeneity, energy, sum variance, and different variance, while the EEG signal is tested with accuracy equals 59%. The result shows that the BCI system can be optimized using the converted EEG signal into energy distribution images. The results are expected to contribute to the future of biomedical development.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128461648","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}
Rianta Athallah Dharmmesta, I. Jaya, Achmad Rizal, Istiqomah
{"title":"Classification of Foot Kicks in Taekwondo Using SVM (Support Vector Machine) and KNN (K-Nearest Neighbors) Algorithms","authors":"Rianta Athallah Dharmmesta, I. Jaya, Achmad Rizal, Istiqomah","doi":"10.1109/IAICT55358.2022.9887475","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887475","url":null,"abstract":"Taekwondo is one of the most popular martial arts in Indonesia. The number of competitions held at various regional levels proves that taekwondo is popular. In an online match, judges assess movement through video so that errors can occur in judging the type of kick. No research discusses the classification of kick types. However, several related studies examine monitoring human movement using SVM and KNN algorithms. This experiment aims to determine the performance of the SVM and KNN algorithms in classifying taekwondo foot kicks. The experiment results show that the SVM and KNN algorithms effectively classify taekwondo foot kick types. Using the kurtosis feature, the SVM algorithm obtained an accuracy rate 91.6%. As for KNN, the accuracy rate is 96.8% with the kurtosis feature.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117305382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Stochastic Asynchronous Gradient Descent Algorithm with Delay Compensation Mechanism","authors":"Tianyu Zhang, Tianhan Gao, Qingwei Mi","doi":"10.1109/IAICT55358.2022.9887513","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887513","url":null,"abstract":"A large amount of idle computing power exists in mobile devices, which can be deployed with large-scale machine learning applications. One of the key problems is how to reduce the communication overhead between different nodes. In recent years, gradient sparsity is introduced to reduce the communication overhead. However, in the federated learning scenario, the traditional synchronous gradient optimization algorithm can not adapt to the complex network environment and high communication costs. In this paper, we propose a stochastic gradient descent algorithm with delay compensation mechanism (FedDgd) for asynchronous distributed training and further optimize it for federated asynchronous training. It is proved theoretically that FedDgd can converge at the same rate as ASGD for non-convex neural networks. Moreover, FedDgd way converge quickly and tolerates staleness in various app applications as well.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123170095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Performance Comparison of Open Speech-To-Text Engines using Sentence Transformer Similarity Check with the Korean Language by Foreigners","authors":"A. B. Wahyutama, Mintae Hwang","doi":"10.1109/IAICT55358.2022.9887500","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887500","url":null,"abstract":"This paper contains the performance comparison of four Speech-to-Text (STT) engines which are Google STT, Naver Clova CSR, IBM Watson, and Microsoft Azure STT when transcribing foreigners speaking the Korean Language. The respondents are recording themselves speaking a predetermined sentence to be compiled together and then feeding it into the STT engine one by one to generate the transcribed text. The performance is evaluated using the Sentence Transformer Python framework that checks the similarity percentage between the original sentence to each of the transcribed texts and then finds the average result. The engine’s performance is categorized into four different categories which are sentence, nationality, age, and gender. The performance comparison results can be used to help determine the optimal STT engine for the Korean Language Spoken by Foreigner to develop STT-based or AI-based applications.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126283603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Systematic Literature Review on Process Mining in Learning Management System","authors":"Fatharani Wafda, T. Usagawa, ER Mahendrawathi","doi":"10.1109/IAICT55358.2022.9887428","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887428","url":null,"abstract":"In the era of Industry 4.0, information systems record a huge amount of event logs. Process Mining (PM) techniques can evaluate a Learning Management System (LMS) usage based on actual learner’s activity as recorded in the event logs. Similar systematic review research has highlighted the use of PM in LMS datasets and essential issues for future research. Our research is motivated by the fact that no literature reviews consider the process mining application in the learning process design. This paper aims to present the use of PM in LMS related to the deviation between learning design and actual execution. This literature study selects 20 out of 52 published articles from 2017 until 2021 based on the criteria and quality assessment. These articles were analyzed based on the research objectives, PM technique, and the tools used. The results show that student behavior is heavily related to the deviation between learning design and actual execution. Three perspectives are found in approaching student behavior: comparison of student behavior, performance prediction based on student behavior, and learning strategy evaluation. This structured literature review may help LMS learning designers improve learning design to suit student behavior.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132486446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Procedural Generation Method of Urban Roads Based on OSM","authors":"Tianhan Gao, Qi Gao, Tingting Yu","doi":"10.1109/IAICT55358.2022.9887441","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887441","url":null,"abstract":"The cost of manually creating large-scale urban road 3D assets for a virtual city is prohibitively expensive, and there is no road environment that corresponds to real geographic space. Thus, the approach of procedural modelling has received a lot of attention. In this paper, we propose a procedural generation method for urban roads. By preprocessing the OpenStreetMap (OSM) data, we construct a network of urban roads with topological relations, and instantiate the road 3D models with procedural syntax. Furthermore, we use several procedural generation methods that have been proposed to create street furniture. The method proposed in this paper produces a coherent and robust generation framework for urban roads that contains traffic information, road surfaces, and street components. The experiment demonstrates that this method is able to create realistic cityscapes based on real world locations. Moreover, the form of 3D assets created by the method can be easily modified through parameters, making it possible to create endless variations. Compared with the previous approach, our urban road generation framework can greatly enhance modelling efficiency.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128193418","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}
Wei Wenxuan, Wang Qianshu, Hao Chaofan, Sun Xizhe, Bao Ruiming, Teoh Teik Toe
{"title":"Leaf Disease image classification method based on improved convolutional neural network","authors":"Wei Wenxuan, Wang Qianshu, Hao Chaofan, Sun Xizhe, Bao Ruiming, Teoh Teik Toe","doi":"10.1109/IAICT55358.2022.9887392","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887392","url":null,"abstract":"This paper attempts to apply neural networks to classify maize disease images. The classification model is based on thousands of images of actual maize diseased leaves, which are relatively belonging to maize leaf blight leaves, corn rusty leaves, corn gray spot disease leaves, and corn healthy leaves. Classification neural networks are a popular machine learning method that will serve as an adjunct to help diagnose whether corn leaves are diseased. This article analyzes and contains details of the algorithms we use. This article demonstrates our proposed VGG-16-based neural network model. The average recognition rate of the final model is 94.64%.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131415434","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}
M. Bertolusso, G. Pettorru, M. Spanu, M. Fadda, M. Sole, M. Anedda, D. Giusto
{"title":"A passive Wi-Fi based monitoring system for urban flows detection","authors":"M. Bertolusso, G. Pettorru, M. Spanu, M. Fadda, M. Sole, M. Anedda, D. Giusto","doi":"10.1109/IAICT55358.2022.9887478","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887478","url":null,"abstract":"This paper presents an innovative vehicle monitoring system based on Wi-Fi sniffing devices and real-time data processing using machine learning techniques. Our solution involves the construction of a neural network-based multiclass classifier that can classify the incoming Wi-Fi signal from many sources based on the received signal strength. The solution was carried out by training the neural network to predict different output classes corresponding to different vehicular (0-30Km/h,30-60Km/h, 60-90Km/h, 90-120Km/h) and several pedestrian speed ranges among 0-15Km/h.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129718805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Robust Offline Reinforcement Learning Algorithm Based on Behavior Regularization Methods","authors":"Yan Zhang, Tianhan Gao, Qingwei Mi","doi":"10.1109/IAICT55358.2022.9887435","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887435","url":null,"abstract":"Offline deep reinforcement learning algorithms are still in developing. Some existing algorithms have shown that it is feasible to learn directly without using environmental interaction under the condition of sufficient datasets. In this paper, we combine an offline reinforcement learning method through behavior regularization with a robust offline reinforcement learning algorithm. Moreover, the algorithm is verified and analyzed with a high-quality but limited dataset. The experimental results show that it is feasible to combine the behavior regularization method with the robust offline reinforcement learning algorithm, to gain better performance under the condition of limited data compared with the baseline algorithms.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130779227","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}
Guntru Prasanth Kumar, M. S. Subodh Raj, S. N. George
{"title":"Human Activity Recognition from Skeletal Data using Covariance Descriptor and Temporal Subspace Clustering","authors":"Guntru Prasanth Kumar, M. S. Subodh Raj, S. N. George","doi":"10.1109/IAICT55358.2022.9887486","DOIUrl":"https://doi.org/10.1109/IAICT55358.2022.9887486","url":null,"abstract":"Human Activity Recognition (HAR) is one of the most active research areas in fields of computer vision and pattern analysis. Most of the existing HAR algorithms are devised in supervised manner by excluding the temporal aspects of skeletal data which is a key parameter in HAR. Motivated by this, we have designed and developed an efficient subspace clustering algorithm for HAR by explicitly considering the time series aspects of human activity data. Designing this algorithm in an unsupervised manner is another challenge that we are dealing with. The work involves design of an efficient covariance descriptor for encoding the skeletal data. Later a subspace clustering algorithm called temporal subspace clustering (TSC) algorithm is designed by exploiting the principles of Laplacian regularization and dictionary learning. Experimental analysis shows that the proposed method outperforms the state-of-the-art methods employed for HAR.","PeriodicalId":154027,"journal":{"name":"2022 IEEE International Conference on Industry 4.0, Artificial Intelligence, and Communications Technology (IAICT)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133549103","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}