Syeda Rabia Arshad, Ishwa Obaid, Rameesha Gull, M. Shahzad
{"title":"Steel Defect Classification Using Machine Learning","authors":"Syeda Rabia Arshad, Ishwa Obaid, Rameesha Gull, M. Shahzad","doi":"10.1109/IMCOM53663.2022.9721728","DOIUrl":"https://doi.org/10.1109/IMCOM53663.2022.9721728","url":null,"abstract":"Ensuring the quality of industrial production for the steel industry is very crucial. For complete defect detection, it is important to know the exact location and class of defect, due to which it becomes difficult to apply this method and attain accuracy in both location and classification. Methods used for the detection of steel defects include the YOLO detection network, acoustic emission method, end-to-end steel surface defect classification, and detection of defects by magneto-optical imaging and neural networks. But as data is too large, deployment and training of these systems become expensive and time-consuming, therefore the algorithms used for the detection of defects should have good generalization. With the growth in computer vision and deep learning automation it is possible to classify images with maximum accuracy. We used machine learning algorithms KNN and transfer learning using VGG-16 for this task to help in quality improvement, quick detection, and classification. KNN used for the classification of defects provided fairly improved results with a significant gain in the accuracy. Detection of defects done by transfer learning via VGG-16 provided promising results. The model trained using VGG-16 achieved high accuracy of 97.54%. These techniques provide an optimal solution for both the classification and detection of defects.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131771202","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}
Thien-Binh Dang, D. Le, Moonseong Kim, Hyunseung Choo
{"title":"A General Model for Long-short Term Anomaly Generation in Sensory Data","authors":"Thien-Binh Dang, D. Le, Moonseong Kim, Hyunseung Choo","doi":"10.1109/imcom53663.2022.9721783","DOIUrl":"https://doi.org/10.1109/imcom53663.2022.9721783","url":null,"abstract":"Anomaly detection algorithms play an important role in Internet of Things (IoT) where a significant amount of data is processed every second. The abnormal data can seriously affect the decision-making of data analysts that may lead to system failure. Hence, anomaly detection algorithms are useful tool to identify anomaly. However, detection accuracy of these algorithms is affected by the amount and quality of training data. In fact, the well-known-published datasets are limited. Moreover, they are not labeled and are hard to use for training. In this paper, we propose a general model for artificial anomaly generation. The proposed model can generate six typical forms of anomalies in IoT time-series data including stuck-at, offset, drift, noise, outlier, and spike. The model allows users not only to straightforwardly generate anomalies under various parameters but also generate combined anomalies which are the combination of those six typical forms of anomalies.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"151 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120863650","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}
Yoshihaya Takahashi, Atsuya Sonoyama, Takeshi Kamiyamaton, M. Oguchi, Saneyasu Yamaguchi
{"title":"Person Identification Based on Accelerations on Drawing Figures with a Smartphone","authors":"Yoshihaya Takahashi, Atsuya Sonoyama, Takeshi Kamiyamaton, M. Oguchi, Saneyasu Yamaguchi","doi":"10.1109/imcom53663.2022.9721744","DOIUrl":"https://doi.org/10.1109/imcom53663.2022.9721744","url":null,"abstract":"Several methods to estimate the user who is holding a smartphone by analyzing the acceleration obtained from the smartphone's accelerometer using deep learning have been proposed. However, these methods have some issues such as insufficient accuracy or the need for the user to hold a smartphone for a long time. In this paper, we discuss the estimation of the user based on acceleration measured in a shorter aperiod of time. We propose a method to identify a user by make a user draw a figure in the air. The proposed method is based on the assumption that a user is estimated from users given in advance. Acceleration data of all users is acquired in advance, and learning is performed by deep learning using these acceleration data to create a model for estimation. The acceleration data measured for identification are analyzed using this model, and the user who is holding the smartphone is idenfitied. We evaluated the proposed method using two networks, LSTM and DeepConvLSTM, and showed that the proposed method can identify the user with high accuracy. In particular, the accuracy of the method using DeepConvLSTM is high.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131256933","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":"An Efficient Multi-Criteria Path Selection Approach in Road Networks through Influencer Nodes and K-hop Search","authors":"Zeeshan Ali, Waqas Nawaz, Kifayat-Ullah Khan","doi":"10.1109/imcom53663.2022.9721805","DOIUrl":"https://doi.org/10.1109/imcom53663.2022.9721805","url":null,"abstract":"We present an efficient approach for a multi-criteria path selection problem in road networks. Since, computing shortest paths among all pairs of nodes in a large network is computationally expensive even with a single criterion. Therefore, performing multi-criteria path search becomes costly and inefficient due to excessive traversals over the network with comparisons between all possible paths. Existing algorithm solved the aforementioned problem by introducing a reference point but they performed a large number of offline pre-computations. In this paper, we introduce an efficient multi-criteria-based approach, in which we uniquely model a road network with places of interest into an attributed graph and restrict our algorithm to explore a minimum number of hops while satisfying maximum criteria. Our objective is to get an optimal path, having minimum path length in terms of number of hops while meeting maximum criteria. Experiments are conducted to verify the effectiveness of the proposed approach. The experimental results depict that the proposed algorithm achieves high accuracy in terms of fulfilling the criteria while avoiding pre-processing steps with minor change in execution time.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114814527","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}
Paulino Cristovao, H. Nakada, Y. Tanimura, H. Asoh
{"title":"Few Shot Model based on Weight Imprinting with Multiple Projection Head","authors":"Paulino Cristovao, H. Nakada, Y. Tanimura, H. Asoh","doi":"10.1109/IMCOM53663.2022.9721726","DOIUrl":"https://doi.org/10.1109/IMCOM53663.2022.9721726","url":null,"abstract":"Few-shot learning models based on imprinted weights have achieved excellent results on several benchmarks. In these methods, the network model directly sets the weights of the final layers for novel classes from the latent representations of the training classes. As a result, the learned representations lead to good performance accuracy in training classes. However, the performance accuracy may be poor on unseen classes. This paper provides an alternative training technique for imprinted weight models. We find that adding projection heads can yield substantial improvements over the baseline model. Our experiments show that (1) introducing nonlinear projection heads in-between the feature extractor and the classifier substantially improves generalization, (2) imprinting from the task-specific layer does not provide better generalization for novel classes. Instead, we propose imprinting from the task-agnostic layer, and (3) our design choice benefits from a large latent dimension. We validate our findings by achieving 5.6 and 4.1% improvement on the MNIST dataset trained with the Omniglot dataset","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132785452","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":"Data Cleaning of Sound Data with Label Noise Using Self Organizing Map","authors":"Pildong Hwang, Yanggon Kim","doi":"10.1109/imcom53663.2022.9721724","DOIUrl":"https://doi.org/10.1109/imcom53663.2022.9721724","url":null,"abstract":"The noise label of data is a problem that can cause low performance of deep learning. It is difficult to manually relabel due to huge amounts of data. In addition, there are much more problems due to the similarity of sounds that are difficult to manually distinguish and label sound data. We proposed a data cleaning method using SOM (Self-Organizing Map), one of the unsupervised learning methods. In order to extract compact features from audio, densely connected layer with log scaled Mel-spectrogram is used. Data selection is performed based on the Euclidean distance of each Best matching unit (BMU) derived through the SOM. We also experiment with various grid sizes for SOM to find an efficient grid size. In addition, an appropriate distance finding experiment is conducted. This method is evaluated in sound classification using a pre-trained DenseNet model.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121842348","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}
Mohammad Fahim Arefin, Chowdhury Farhan Ahmed, Redwan Ahmed Rizvee, C. Leung, Longbing Cao
{"title":"Mining Contextual Item Similarity without Concept Hierarchy","authors":"Mohammad Fahim Arefin, Chowdhury Farhan Ahmed, Redwan Ahmed Rizvee, C. Leung, Longbing Cao","doi":"10.1109/IMCOM53663.2022.9721788","DOIUrl":"https://doi.org/10.1109/IMCOM53663.2022.9721788","url":null,"abstract":"In the modern era, data is precious. Therefore, a huge amount of data is being generated every moment and data mining extracts insight from this data. Item similarity mining is a special domain of data mining that helps discover inherent and important characteristics of a dataset. It is a popular research problem with application in numerous domains. In this work, we propose a novel, symmetric, null-invariant measure of similarity that can evaluate contextual similarity between items, without any additional metadata. We also propose an optimal algorithm for calculating this measure. Moreover, as the optimal algorithm has comparatively high runtime complexity, we propose a heuristic algorithm which generates an approximate result without sacrificing much accuracy. This similarity can be used for mining localized associations and discovering object relationships in large datasets. The results obtained using the proposed measure in six real-life datasets confirm the measure’s effectiveness and versatility in data of varying nature.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125818091","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 mobile game approach for energy conservation awareness","authors":"Maslinda Mohd Nadzir, Baktajivan Pillay","doi":"10.1109/IMCOM53663.2022.9721794","DOIUrl":"https://doi.org/10.1109/IMCOM53663.2022.9721794","url":null,"abstract":"Energy plays a vital role in our daily lives. Energy needs to be conserved to cut costs and preserve the resources for more extended use. Energy conservation is an effort to reduce energy consumption by being more energy efficient. However, many people waste a lot of energy in their daily usage. Energy waste tends to happen due to a lack of energy conservation awareness among the public. Even though there are many digital resources on energy conservation, few mobile games are about energy conservation awareness. Therefore, this study proposes a mobile game prototype that emphasizes energy conservation, specifically electricity consumption. A rapid prototyping model modified for serious game development is used to develop the prototype. Nine participants were involved in testing the basic prototype. Most of the participants were satisfied with the game mechanics. The study's outcome shows that this prototype is promising to promote energy conservation with more fun and interactivity via a mobile game platform.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125537866","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":"Music recommendation service based on user impressions: Study of user interface acquiring appropriate impression words","authors":"YuJia Han, M. Nakano, M. Oguchi","doi":"10.1109/imcom53663.2022.9721747","DOIUrl":"https://doi.org/10.1109/imcom53663.2022.9721747","url":null,"abstract":"In recent years, with music streaming services becoming widespread, millions of songs have been made accessible on the Internet. However, music is not just entertainment but is used for various purposes in our lives, starting from the background music of shopping centers to music therapies. It is difficult to effectively select a single song from several songs based on a specific use scene. In this study, we propose a music recommendation method suitable for the elderly who have difficulty using advanced technology. We introduce a music database mapped to the emotional space, as well as interactive robots and agents, to achieve the appropriate atmosphere and users’ desired emotions. Finally, we consider a mechanism for obtaining appropriate impression (emotional) words from the elderly.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"1997 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128806632","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}
Mazen Khodier, Ahmed Abdelaziz, Maria Gadelkarim, Abdelrahman Abdelkhalek, W. Gomaa
{"title":"Sorting of Scrambled Video Frames Using Temporal Order Verification","authors":"Mazen Khodier, Ahmed Abdelaziz, Maria Gadelkarim, Abdelrahman Abdelkhalek, W. Gomaa","doi":"10.1109/IMCOM53663.2022.9721759","DOIUrl":"https://doi.org/10.1109/IMCOM53663.2022.9721759","url":null,"abstract":"The Sorting Problem is exceedingly popular in our contemporary world for its contribution in many of our daily activities. In this paper, we tackle the problem of sorting through providing a method that sorts a variable number of scrambled video frames. The sorting algorithm is accompanied by two Machine Learning models. A supervised learning approach using video frames with semantic labels is presented through these models. The learning method was formulated as a sequential verification task, that is, determine whether a sequence of frames from a video is in the correct temporal order. Using two different classes of artificial neural networks, Three Dimensional Convolutional Neural Network (3D-CNN), and Recurrent Neural Network (RNN), temporally shuffled frames (frames in non- chronological order) are taken as inputs, then, the neural network is trained to first determine whether that sequence is sorted or not Afterwards, these models are used as validators in the sorting algorithm, to sort shuffled frames in the input sequence, to end up with a sorted frame sequence. The experimental results show good accuracy as different tests ended up with accuracy above 82%. This accuracy is related to the performance of an individual neural network, which means that it could be higher if both models are combined.","PeriodicalId":367038,"journal":{"name":"2022 16th International Conference on Ubiquitous Information Management and Communication (IMCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130498105","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}