Eihab Abdelkariem Bashir Ibrahim, Ummi Raba’ah Hashim, L. Salahuddin, Nor Haslinda Ismail, Ngo Hea Choon, K. Kanchymalay, S. N. Zabri
Article history Received December 5, 2019 Revised March 23, 2020 Accepted March 26, 2021 Available online March 31, 2021 Wood defects detection has been studied a lot recently to detect the defects on the wood surface and assist the manufacturers in having a clear wood to be used to produce a high-quality product. Therefore, the defects on the wood affect and reduce the quality of wood. This research proposes an effective feature extraction technique called the local binary pattern (LBP) with a common classifier called Support Vector Machine (SVM). Our goal is to classify the natural defects on the wood surface. First, preprocessing was applied to convert the RGB images into grayscale images. Then, the research applied the LBP feature extraction technique with eight neighbors (P=8) and several radius (R) values. After that, we apply the SVM classifier for the classification and measure the proposed technique's performance. The experimental result shows that the average accuracy achieved is 65% on the balanced dataset with P=8 and R=1. It indicates that the proposed technique works moderately well to classify wood defects. This study will consequently contribute to the overall wood defect detection framework, which generally benefits the automated inspection of the wood defects.
{"title":"Evaluation of texture feature based on basic local binary pattern for wood defect classification","authors":"Eihab Abdelkariem Bashir Ibrahim, Ummi Raba’ah Hashim, L. Salahuddin, Nor Haslinda Ismail, Ngo Hea Choon, K. Kanchymalay, S. N. Zabri","doi":"10.26555/IJAIN.V7I1.393","DOIUrl":"https://doi.org/10.26555/IJAIN.V7I1.393","url":null,"abstract":"Article history Received December 5, 2019 Revised March 23, 2020 Accepted March 26, 2021 Available online March 31, 2021 Wood defects detection has been studied a lot recently to detect the defects on the wood surface and assist the manufacturers in having a clear wood to be used to produce a high-quality product. Therefore, the defects on the wood affect and reduce the quality of wood. This research proposes an effective feature extraction technique called the local binary pattern (LBP) with a common classifier called Support Vector Machine (SVM). Our goal is to classify the natural defects on the wood surface. First, preprocessing was applied to convert the RGB images into grayscale images. Then, the research applied the LBP feature extraction technique with eight neighbors (P=8) and several radius (R) values. After that, we apply the SVM classifier for the classification and measure the proposed technique's performance. The experimental result shows that the average accuracy achieved is 65% on the balanced dataset with P=8 and R=1. It indicates that the proposed technique works moderately well to classify wood defects. This study will consequently contribute to the overall wood defect detection framework, which generally benefits the automated inspection of the wood defects.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"19 1","pages":"26"},"PeriodicalIF":0.0,"publicationDate":"2021-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82538712","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}
Forecasting is a method of predicting past and current data, most often by pattern analysis. A Fuzzy Takagi Sugeno Kang (TSK) study can predict Indonesia's inflation rate, yet with too high error. This study proposes an accuracy improvement based on Evolution Strategies (ES), a specific evolutionary algorithm with good performance optimization problems. ES algorithm used to determine the best coefficient values on consequent fuzzy rules. This research uses Bank Indonesia time-series data as in the previous study. ES algorithm uses the popSize test to determine the number of initial chromosomes to produce the best optimal solution for this problem. The increase of popSize creates better fitness value due to the ES's broader search area. The RMSE of ES-TSK is 0.637, which outperforms the baseline approach. This research generally shows that ES may reduce repetitive experiment events due to Fuzzy coefficients' manual setting. The algorithm complexity may cost to the computing time, yet with higher performance.
预测是一种预测过去和当前数据的方法，最常用的方法是模式分析。一项模糊高木Sugeno Kang (TSK)研究可以预测印度尼西亚的通货膨胀率，但误差太高。本文提出了一种基于进化策略(ES)的精度改进算法，这是一种具有良好性能优化问题的特定进化算法。采用ES算法确定顺次模糊规则的最佳系数值。本研究使用了印尼银行的时间序列数据，与之前的研究一样。ES算法使用popSize测试来确定初始染色体的数量，以产生该问题的最优解。随着popSize的增大，ES的搜索范围扩大，适应度值也随之提高。ES-TSK的RMSE为0.637，优于基线方法。本研究总体上表明，由于模糊系数的手动设置，ES可以减少重复实验事件。算法的复杂度可能会增加计算时间，但性能会有所提高。
{"title":"Evolution strategies based coefficient of TSK fuzzy forecasting engine","authors":"Nadia Roosmalita Sari, W. Mahmudy, A. Wibawa","doi":"10.26555/IJAIN.V7I1.376","DOIUrl":"https://doi.org/10.26555/IJAIN.V7I1.376","url":null,"abstract":"Forecasting is a method of predicting past and current data, most often by pattern analysis. A Fuzzy Takagi Sugeno Kang (TSK) study can predict Indonesia's inflation rate, yet with too high error. This study proposes an accuracy improvement based on Evolution Strategies (ES), a specific evolutionary algorithm with good performance optimization problems. ES algorithm used to determine the best coefficient values on consequent fuzzy rules. This research uses Bank Indonesia time-series data as in the previous study. ES algorithm uses the popSize test to determine the number of initial chromosomes to produce the best optimal solution for this problem. The increase of popSize creates better fitness value due to the ES's broader search area. The RMSE of ES-TSK is 0.637, which outperforms the baseline approach. This research generally shows that ES may reduce repetitive experiment events due to Fuzzy coefficients' manual setting. The algorithm complexity may cost to the computing time, yet with higher performance.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"1 1","pages":"89-100"},"PeriodicalIF":0.0,"publicationDate":"2021-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87769449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Most basic and recent image edge detection methods are based on exploiting spatial high-frequency to localize efficiency the boundaries and image discontinuities. These approaches are strictly sensitive to noise, and their performance decrease with the increasing noise level. This research suggests a novel and robust approach based on a binomial Gaussian filter for edge detection. We propose a scheme-based Gaussian filter that employs low-pass filters to reduce noise and gradient image differentiation to perform edge recovering. The results presented illustrate that the proposed approach outperforms the basic method for edge detection. The global scheme may be implemented efficiently with high speed using the proposed novel binomial Gaussian filter.
{"title":"A novel edge detection method based on efficient gaussian binomial filter","authors":"El Houssain Ait Mansour, F. Bretaudeau","doi":"10.26555/ijain.v7i2.651","DOIUrl":"https://doi.org/10.26555/ijain.v7i2.651","url":null,"abstract":"Most basic and recent image edge detection methods are based on exploiting spatial high-frequency to localize efficiency the boundaries and image discontinuities. These approaches are strictly sensitive to noise, and their performance decrease with the increasing noise level. This research suggests a novel and robust approach based on a binomial Gaussian filter for edge detection. We propose a scheme-based Gaussian filter that employs low-pass filters to reduce noise and gradient image differentiation to perform edge recovering. The results presented illustrate that the proposed approach outperforms the basic method for edge detection. The global scheme may be implemented efficiently with high speed using the proposed novel binomial Gaussian filter.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"332 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82941281","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}
A. W. Reza, Jannatul Ferdous Sorna, Md. Momtaz Uddin Rashel, Mir Moynuddin Ahmed Shibly
COVID-19 is a devastating pandemic in the history of humankind. It is a highly contagious flu that can spread from human to human. For being so contagious, detecting patients with it and isolating them has become the primary concern for healthcare professionals. However, identifying COVID-19 patients with a Polymerase chain reaction (PCR) test can sometimes be problematic and time-consuming. Therefore, detecting patients with this virus from X-ray chest images can be a perfect alternative to the de-facto standard PCR test. This article aims at providing such a decision support system that can detect COVID-19 patients with the help of X-ray images. To do that, a novel convolutional neural network (CNN) based architecture, namely ModCOVNN, has been introduced. To determine whether the proposed model works with good efficiency, two CNN-based architectures – VGG16 and VGG19 have been developed for the detection task. The experimental results of this study have proved that the proposed architecture has outperformed the other two models with 98.08% accuracy, 98.14% precision, and 98.4% recall. This result indicates that proper detection of COVID-19 patients with the help of X-ray images of the chest is possible using machine learning methods with high accuracy. This type of data-driven system can help us to overcome the current appalling situation throughout the world.
{"title":"ModCOVNN: a convolutional neural network approach in COVID-19 prognosis","authors":"A. W. Reza, Jannatul Ferdous Sorna, Md. Momtaz Uddin Rashel, Mir Moynuddin Ahmed Shibly","doi":"10.26555/ijain.v7i2.604","DOIUrl":"https://doi.org/10.26555/ijain.v7i2.604","url":null,"abstract":"COVID-19 is a devastating pandemic in the history of humankind. It is a highly contagious flu that can spread from human to human. For being so contagious, detecting patients with it and isolating them has become the primary concern for healthcare professionals. However, identifying COVID-19 patients with a Polymerase chain reaction (PCR) test can sometimes be problematic and time-consuming. Therefore, detecting patients with this virus from X-ray chest images can be a perfect alternative to the de-facto standard PCR test. This article aims at providing such a decision support system that can detect COVID-19 patients with the help of X-ray images. To do that, a novel convolutional neural network (CNN) based architecture, namely ModCOVNN, has been introduced. To determine whether the proposed model works with good efficiency, two CNN-based architectures – VGG16 and VGG19 have been developed for the detection task. The experimental results of this study have proved that the proposed architecture has outperformed the other two models with 98.08% accuracy, 98.14% precision, and 98.4% recall. This result indicates that proper detection of COVID-19 patients with the help of X-ray images of the chest is possible using machine learning methods with high accuracy. This type of data-driven system can help us to overcome the current appalling situation throughout the world.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"163 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72423056","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}
Computational methods have been used extensively to solve problems in the education sector. This paper aims to explore the computational method's recent implementation in solving global Vocational education and training (VET) problems. The study used a systematic literature review to answer specific research questions by identifying, assessing, and interpreting all available research shreds of evidence. The result shows that researchers use the computational method to predict various cases in VET. The most popular methods are ANN and Naive Bayes. It has significant potential to develop because VET has a very complex problem of (a) curriculum, (b) apprenticeship, (c) matching labor market, and (d) attracting enrollment. In the future, academics may have broad overviews of the use of the computational method in VET. A computer scientist may use this study to find more efficient and intelligent solutions for VET issues.
{"title":"An integrative review of computational methods for vocational curriculum, apprenticeship, labor market, and enrollment problems","authors":"A. Dardiri, F. Dwiyanto, Agung Bella Putra Utama","doi":"10.26555/ijain.v6i3.581","DOIUrl":"https://doi.org/10.26555/ijain.v6i3.581","url":null,"abstract":"Computational methods have been used extensively to solve problems in the education sector. This paper aims to explore the computational method's recent implementation in solving global Vocational education and training (VET) problems. The study used a systematic literature review to answer specific research questions by identifying, assessing, and interpreting all available research shreds of evidence. The result shows that researchers use the computational method to predict various cases in VET. The most popular methods are ANN and Naive Bayes. It has significant potential to develop because VET has a very complex problem of (a) curriculum, (b) apprenticeship, (c) matching labor market, and (d) attracting enrollment. In the future, academics may have broad overviews of the use of the computational method in VET. A computer scientist may use this study to find more efficient and intelligent solutions for VET issues.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"31 1","pages":"246-260"},"PeriodicalIF":0.0,"publicationDate":"2020-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89564116","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}
Ronnie S. Concepcion, Jonnel D. Alejandrino, Sandy C. Lauguico, Rogelio Ruzcko Tobias, E. Sybingco, E. Dadios, A. Bandala
Identifying the plant's developmental growth stages from seed leaf is crucial to understand plant science and cultivation management deeply. An efficient vision-based system for plant growth monitoring entails optimum segmentation and classification algorithms. This study presents coupled color-based superpixels and multifold watershed transformation in segmenting lettuce plant from complicated background taken from smart farm aquaponic system, and machine learning models used to classify lettuce plant growth as vegetative, head development and for harvest based on phytomorphological profile. Morphological computations were employed by feature extraction of the number of leaves, biomass area and perimeter, convex area, convex hull area and perimeter, major and minor axis lengths of the major axis length the dominant leaf, and length of plant skeleton. Phytomorphological variations of biomass compactness, convexity, solidity, plant skeleton, and perimeter ratio were included as inputs of the classification network. The extracted Lab color space information from the training image set undergoes superpixels overlaying with 1,000 superpixel regions employing K-means clustering on each pixel class. Six-level watershed transformation with distance transformation and minima imposition was employed to segment the lettuce plant from other pixel objects. The accuracy of correctly classifying the vegetative, head development, and harvest growth stages are 88.89%, 86.67%, and 79.63%, respectively. The experiment shows that the test accuracy rates of machine learning models were recorded as 60% for LDA, 85% for ANN, and 88.33% for QSVM. Comparative analysis showed that QSVM bested the performance of optimized LDA and ANN in classifying lettuce growth stages. This research developed a seamless model in segmenting vegetation pixels, and predicting lettuce growth stage is essential for plant computational phenotyping and agricultural practice optimization.
{"title":"Lettuce growth stage identification based on phytomorphological variations using coupled color superpixels and multifold watershed transformation","authors":"Ronnie S. Concepcion, Jonnel D. Alejandrino, Sandy C. Lauguico, Rogelio Ruzcko Tobias, E. Sybingco, E. Dadios, A. Bandala","doi":"10.26555/ijain.v6i3.435","DOIUrl":"https://doi.org/10.26555/ijain.v6i3.435","url":null,"abstract":"Identifying the plant's developmental growth stages from seed leaf is crucial to understand plant science and cultivation management deeply. An efficient vision-based system for plant growth monitoring entails optimum segmentation and classification algorithms. This study presents coupled color-based superpixels and multifold watershed transformation in segmenting lettuce plant from complicated background taken from smart farm aquaponic system, and machine learning models used to classify lettuce plant growth as vegetative, head development and for harvest based on phytomorphological profile. Morphological computations were employed by feature extraction of the number of leaves, biomass area and perimeter, convex area, convex hull area and perimeter, major and minor axis lengths of the major axis length the dominant leaf, and length of plant skeleton. Phytomorphological variations of biomass compactness, convexity, solidity, plant skeleton, and perimeter ratio were included as inputs of the classification network. The extracted Lab color space information from the training image set undergoes superpixels overlaying with 1,000 superpixel regions employing K-means clustering on each pixel class. Six-level watershed transformation with distance transformation and minima imposition was employed to segment the lettuce plant from other pixel objects. The accuracy of correctly classifying the vegetative, head development, and harvest growth stages are 88.89%, 86.67%, and 79.63%, respectively. The experiment shows that the test accuracy rates of machine learning models were recorded as 60% for LDA, 85% for ANN, and 88.33% for QSVM. Comparative analysis showed that QSVM bested the performance of optimized LDA and ANN in classifying lettuce growth stages. This research developed a seamless model in segmenting vegetation pixels, and predicting lettuce growth stage is essential for plant computational phenotyping and agricultural practice optimization.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"1 1","pages":"261-277"},"PeriodicalIF":0.0,"publicationDate":"2020-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84108648","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}
The image forgery process can be simply defined as inserting some objects, with different sizes, in order to vanish some structures and/or scenes. Satellite images can be forged in many ways, such as copy-paste, copy-move and splicing processes. Recent approaches present a generative adversarial network (GAN) as an effective method for identifying the presence of spliced forgeries and identifying their locations with higher detection accuracy of large- and medium-sized forgeries. However, such recent approaches clearly show limited detection accuracy of small-sized forgeries. Accordingly, the localization step of such small-sized forgeries is negatively impacted. In this paper, two different approaches, for detection and localization of small-sized forgeries in satellite images, are proposed. The first approach is inspired from a recently presented GAN-based approach and is modified to an enhanced version. The experimental results manifest that the detection accuracy of the first proposed approach in noticeably increased to 86% compared to his inspiring one with 79% with respect to the small-sized forgeries. Whereas, the second proposed approach uses a different design of a CNN-based discriminator to significantly enhance the detection accuracy to 94%, using the same dataset obtained from NASA and US Geological Survey (USGS) for validation and testing. Furthermore, the results show a comparable detection accuracy in case of large- and medium-sized forgeries using the two proposed approaches compared to the competing ones.
{"title":"Detection and localization enhancement for satellite images with small forgeries using modified GAN-based CNN structure","authors":"M. Fouad, Eslam Mostafa, Mohamed A. Elshafey","doi":"10.26555/ijain.v6i3.548","DOIUrl":"https://doi.org/10.26555/ijain.v6i3.548","url":null,"abstract":"The image forgery process can be simply defined as inserting some objects, with different sizes, in order to vanish some structures and/or scenes. Satellite images can be forged in many ways, such as copy-paste, copy-move and splicing processes. Recent approaches present a generative adversarial network (GAN) as an effective method for identifying the presence of spliced forgeries and identifying their locations with higher detection accuracy of large- and medium-sized forgeries. However, such recent approaches clearly show limited detection accuracy of small-sized forgeries. Accordingly, the localization step of such small-sized forgeries is negatively impacted. In this paper, two different approaches, for detection and localization of small-sized forgeries in satellite images, are proposed. The first approach is inspired from a recently presented GAN-based approach and is modified to an enhanced version. The experimental results manifest that the detection accuracy of the first proposed approach in noticeably increased to 86% compared to his inspiring one with 79% with respect to the small-sized forgeries. Whereas, the second proposed approach uses a different design of a CNN-based discriminator to significantly enhance the detection accuracy to 94%, using the same dataset obtained from NASA and US Geological Survey (USGS) for validation and testing. Furthermore, the results show a comparable detection accuracy in case of large- and medium-sized forgeries using the two proposed approaches compared to the competing ones.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"15 1","pages":"278-289"},"PeriodicalIF":0.0,"publicationDate":"2020-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82898923","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}
In UAV-based human detection, the extraction and selection of the feature vector are one of the critical tasks to ensure the optimal performance of the detection system. Although UAV cameras capture high-resolution images, human figures' relative size renders persons at very low resolution and contrast. Feature descriptors that can adequately discriminate between local symmetrical patterns in a low-contrast image may improve a human figures' detection in vegetative environments. Such a descriptor is proposed and presented in this paper. Initially, the acquired images are fed to a digital processor in a ground station where the human detection algorithm is performed. Part of the human detection algorithm is the GeHOG feature extraction, where a bank of Gabor filters is used to generate textured images from the original. The local energy for each cell of the Gabor images is calculated to identify the dominant orientations. The bins of conventional HOG are enhanced based on the dominant orientation index and the accumulated local energy in Gabor images. To measure the performance of the proposed features, Gabor-enhanced HOG (GeHOG) and other two recent improvements to HOG, Histogram of Edge Oriented Gradients (HEOG) and Improved HOG (ImHOG), are used for human detection on INRIA dataset and a custom dataset of farmers working in fields captured via unmanned aerial vehicle. The proposed feature descriptor significantly improved human detection and performed better than recent improvements in conventional HOG. Using GeHOG improved the precision of human detection to 98.23% in the INRIA dataset. The proposed feature can significantly improve human detection applied in surveillance systems, especially in vegetative environments.
{"title":"Gabor-enhanced histogram of oriented gradients for human presence detection applied in aerial monitoring","authors":"A. L. D. de Ocampo, A. Bandala, E. Dadios","doi":"10.26555/ijain.v6i3.514","DOIUrl":"https://doi.org/10.26555/ijain.v6i3.514","url":null,"abstract":"In UAV-based human detection, the extraction and selection of the feature vector are one of the critical tasks to ensure the optimal performance of the detection system. Although UAV cameras capture high-resolution images, human figures' relative size renders persons at very low resolution and contrast. Feature descriptors that can adequately discriminate between local symmetrical patterns in a low-contrast image may improve a human figures' detection in vegetative environments. Such a descriptor is proposed and presented in this paper. Initially, the acquired images are fed to a digital processor in a ground station where the human detection algorithm is performed. Part of the human detection algorithm is the GeHOG feature extraction, where a bank of Gabor filters is used to generate textured images from the original. The local energy for each cell of the Gabor images is calculated to identify the dominant orientations. The bins of conventional HOG are enhanced based on the dominant orientation index and the accumulated local energy in Gabor images. To measure the performance of the proposed features, Gabor-enhanced HOG (GeHOG) and other two recent improvements to HOG, Histogram of Edge Oriented Gradients (HEOG) and Improved HOG (ImHOG), are used for human detection on INRIA dataset and a custom dataset of farmers working in fields captured via unmanned aerial vehicle. The proposed feature descriptor significantly improved human detection and performed better than recent improvements in conventional HOG. Using GeHOG improved the precision of human detection to 98.23% in the INRIA dataset. The proposed feature can significantly improve human detection applied in surveillance systems, especially in vegetative environments.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"4 4 1","pages":"223-234"},"PeriodicalIF":0.0,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84340080","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}
The k-means is a clustering algorithm that is often and easy to use. This algorithm is susceptible to randomly chosen centroid points so that it cannot produce optimal results. This research aimed to improve the k-means algorithm’s performance by applying a proposed algorithm called point center. The proposed algorithm overcame the random centroid value in k-means and then applied it to predict software defects modules’ errors. The point center algorithm was proposed to determine the initial centroid value for the k-means algorithm optimization. Then, the selection of X and Y variables determined the cluster center members. The ten datasets were used to perform the testing, of which nine datasets were used for predicting software defects. The proposed center point algorithm showed the lowest errors. It also improved the k-means algorithm’s performance by an average of 12.82% cluster errors in the software compared to the centroid value obtained randomly on the simple k-means algorithm. The findings are beneficial and contribute to developing a clustering model to handle data, such as to predict software defect modules more accurately.
{"title":"Improved point center algorithm for K-Means clustering to increase software defect prediction","authors":"Riski Annisa, D. Rosiyadi, D. Riana","doi":"10.26555/IJAIN.V6I3.484","DOIUrl":"https://doi.org/10.26555/IJAIN.V6I3.484","url":null,"abstract":"The k-means is a clustering algorithm that is often and easy to use. This algorithm is susceptible to randomly chosen centroid points so that it cannot produce optimal results. This research aimed to improve the k-means algorithm’s performance by applying a proposed algorithm called point center. The proposed algorithm overcame the random centroid value in k-means and then applied it to predict software defects modules’ errors. The point center algorithm was proposed to determine the initial centroid value for the k-means algorithm optimization. Then, the selection of X and Y variables determined the cluster center members. The ten datasets were used to perform the testing, of which nine datasets were used for predicting software defects. The proposed center point algorithm showed the lowest errors. It also improved the k-means algorithm’s performance by an average of 12.82% cluster errors in the software compared to the centroid value obtained randomly on the simple k-means algorithm. The findings are beneficial and contribute to developing a clustering model to handle data, such as to predict software defect modules more accurately.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"64 1","pages":"328-339"},"PeriodicalIF":0.0,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77087548","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}
Z. M. Zain, Mona Alshenaifi, Abeer Aljaloud, Tamadhur Albednah, Reham Alghanim, Alanoud Alqifari, Amal Alqahtani
Breast cancer recurrence is among the most noteworthy fears faced by women. Nevertheless, with modern innovations in data mining technology, early recurrence prediction can help relieve these fears. Although medical information is typically complicated, and simplifying searches to the most relevant input is challenging, new sophisticated data mining techniques promise accurate predictions from high-dimensional data. In this study, the performances of three established data mining algorithms: Naive Bayes (NB), k-nearest neighbor (KNN), and fast decision tree (REPTree), adopting the feature extraction algorithm, principal component analysis (PCA), for predicting breast cancer recurrence were contrasted. The comparison was conducted between models built in the absence and presence of PCA. The results showed that KNN produced better prediction without PCA (F-measure = 72.1%), whereas the other two techniques: NB and REPTree, improved when used with PCA (F-measure = 76.1% and 72.8%, respectively). This study can benefit the healthcare industry in assisting physicians in predicting breast cancer recurrence precisely.
{"title":"Predicting breast cancer recurrence using principal component analysis as feature extraction: an unbiased comparative analysis","authors":"Z. M. Zain, Mona Alshenaifi, Abeer Aljaloud, Tamadhur Albednah, Reham Alghanim, Alanoud Alqifari, Amal Alqahtani","doi":"10.26555/IJAIN.V6I3.462","DOIUrl":"https://doi.org/10.26555/IJAIN.V6I3.462","url":null,"abstract":"Breast cancer recurrence is among the most noteworthy fears faced by women. Nevertheless, with modern innovations in data mining technology, early recurrence prediction can help relieve these fears. Although medical information is typically complicated, and simplifying searches to the most relevant input is challenging, new sophisticated data mining techniques promise accurate predictions from high-dimensional data. In this study, the performances of three established data mining algorithms: Naive Bayes (NB), k-nearest neighbor (KNN), and fast decision tree (REPTree), adopting the feature extraction algorithm, principal component analysis (PCA), for predicting breast cancer recurrence were contrasted. The comparison was conducted between models built in the absence and presence of PCA. The results showed that KNN produced better prediction without PCA (F-measure = 72.1%), whereas the other two techniques: NB and REPTree, improved when used with PCA (F-measure = 76.1% and 72.8%, respectively). This study can benefit the healthcare industry in assisting physicians in predicting breast cancer recurrence precisely.","PeriodicalId":52195,"journal":{"name":"International Journal of Advances in Intelligent Informatics","volume":"30 1","pages":"313-327"},"PeriodicalIF":0.0,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84095305","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
扫码关注我们
求助内容：
应助结果提醒方式：