scholarly journals DCT Untuk Ekstraksi Fitur Berbasis GLCM Pada Identifikasi Batik Menggunakan K-NN

2021 ◽  
Vol 3 (1) ◽  
pp. 1-6
Author(s):  
Zulfrianto Yusrin Lamasigi
Keyword(s):  
Feature Extraction ◽  
Discrete Cosine Transform ◽  
Confusion Matrix ◽  
Training Data ◽  
Gray Level ◽  
K Nearest Neighbor ◽  
Cosine Transform ◽  
A Value ◽  
Testing Data ◽  
Occurrence Matrix

Batik merupakan kain yang dibuat khusus, batik sendiri terbilang unik karena memiliki motif tertentu yang dibuat berdasarkan unsur budaya dari daerah asal batik itu dibuat. setiap motif dan warna batik berbeda-beda sehingga sulit untuk dikenali asal dari motir batik itu sendiri. penelitian ini bertujuan untuk meningkatkan hasil ektraksi fitur pada identifikasi motif batik. metode yang digunakan dalam penelitian ini adalah Discrete Cosine Transform bertujuan untuk meningkatkan hasil ektraksi fitur Gray Level Co-Occurrence Matrix untuk mendapatkan hasil akurasi identifikasi motif batik yang lebih baik, sedangkan untuk mengetahui nilai kedekatan antara data training dengan data testing citra batik akan menggunakan K-Nearest Neighbour berdasarkan nilai ekstraksi fitur yang diperoleh. dalam eksperimen ini dilakukan 4 kali percobaan berdasarkan sudut 0°, 45°, 90°, dan 135° pada nilai k=1, 3, 5, 7, dan 9. sementara itu, untuk menghitung tingkat akurasi dari klasifikasi KNN akan menggunakan confusion matrix. Dari uji coba yang di lakukan dengan menggunakan jumalah data training sebanyak 602 citra dan data testing 344 citra terhadap semua kelas berdasarkan sudut 0°, 45°, 90°, dan 135° pada nilai k=1, 3, 5, , dan 9 akurasi tertinggi yang diperoleh DCT-GLCM ada pada sudut 135° dengan nilai k=3 sebesar 84,88% dan yang paling rendah ada pada sudut 0° dengan nilai k=7 dan 9 sebesar 41,86%. Sedangkan hasil uji dengan hanya mennggunakan GLCM akurasi tertinggi ada pada sudut 135° dengan nilai k=1 sebesar 77,90% dan yang paling rendah ada pada sudut 90° dengan nilai k=7 sebesar 40,69%. Dari hasil uji coba yang dilakukan menunjukkan bahwah DCT bekerja dengan baik untuk meningkatkan hasil ekstraksi fitur GLCM yang dibuktikan dengan hasil rata-rata akurasi yang diperoleh.Batik is a specially made cloth, batik itself is unique because it has certain motifs that are made based on cultural elements from the area where the batik was made. each batik motif and color is different so it is difficult to identify the origin of the batik motir itself. This study aims to improve the feature extraction results in the identification of batik motifs. The method used in this research is Discrete Cosine Transform, which aims to increase the extraction of the Gray Level Co-Occurrence Matrix feature to obtain better accuracy results for identification of batik motifs, while to determine the closeness value between training data and batik image testing data will use K- Nearest Neighbor based on the feature extraction value obtained. In this experiment, 4 experiments were carried out based on angles of 0 °, 45 °, 90 °, and 135 ° at values of k = 1, 3, 5, 7, and 9. Meanwhile, to calculate the level of accuracy of the KNN classification, confusion matrix will be used. . From the trials carried out using the total training data of 602 images and testing data of 344 images for all classes based on angles of 0 °, 45 °, 90 °, and 135 ° at values of k = 1, 3, 5, and 9 accuracy The highest obtained by DCT-GLCM was at an angle of 135 ° with a value of k = 3 of 84.88% and the lowest was at an angle of 0 ° with values of k = 7 and 9 of 41.86%. While the test results using only GLCM, the highest accuracy is at an angle of 135 ° with a value of k = 1 of 77.90% and the lowest is at an angle of 90 ° with a value of k = 7 of 40.69%. From the results of the trials conducted, it shows that the DCT works well to improve the results of the GLCM feature extraction as evidenced by the average accuracy results obtained.

scholarly journals Classification of Bird Based on Face Types Using Gray Level Co-Occurrence Matrix (GLCM) Feature Extraction Based on the k-Nearest Neighbor (K-NN) Algorithm

2021 ◽  
Vol 6 (2) ◽  
pp. 111-119
Author(s):  
Daurat Sinaga ◽  
Feri Agustina ◽  
Noor Ageng Setiyanto ◽  
Suprayogi Suprayogi ◽  
Cahaya Jatmoko
Keyword(s):  
Feature Extraction ◽  
Nearest Neighbor ◽  
Correlation Energy ◽  
Training Data ◽  
Gray Level ◽  
K Nearest Neighbor ◽  
Testing Data ◽  
Occurrence Matrix

Indonesia is one of the countries with a large number of fauna wealth. Various types of fauna that exist are scattered throughout Indonesia. One type of fauna that is owned is a type of bird animal. Birds are often bred as pets because of their characteristic facial voice and body features. In this study, using the Gray Level Co-Occurrence Matrix (GLCM) based on the k-Nearest Neighbor (K-NN) algorithm. The data used in this study were 66 images which were divided into two, namely 55 training data and 11 testing data. The calculation of the feature value used in this study is based on the value of the GLCM feature extraction such as: contrast, correlation, energy, homogeneity and entropy which will later be calculated using the k-Nearest Neighbor (K-NN) algorithm and Eucliden Distance. From the results of the classification process using k-Nearest Neighbor (K-NN), it is found that the highest accuracy results lie at the value of K = 1 and at an degree of 0 ° of 54.54%.

scholarly journals Comparison Analysis of K-Nearest Neighbor and Naïve Bayes in Determining Talent of Adolescence

2020 ◽  
Vol 4 (1) ◽  
Author(s):  
Yessi Jusman ◽  
Widdya Rahmalina ◽  
Juni Zarman
Keyword(s):  
Nearest Neighbor ◽  
Naive Bayes ◽  
Confusion Matrix ◽  
Naïve Bayes ◽  
Training Data ◽  
K Nearest Neighbor ◽  
Combined Training ◽  
Testing Data ◽  
Bayes Algorithm ◽  
Children's Interests

Adolescence always searches for the identity to shape the personality character. This paper aims to use the artificial intelligent analysis to determine the talent of the adolescence. This study uses a sample of children aged 10-18 years with testing data consisting of 100 respondents. The algorithm used for analysis is the K-Nearest Neigbor and Naive Bayes algorithm. The analysis results are performance of accuracy results of both algorithms of classification. In knowing the accurate algorithm in determining children's interests and talents, it can be seen from the accuracy of the data with the confusion matrix using the RapidMiner software for training data, testing data, and combined training and testing data. This study concludes that the K-Nearest Neighbor algorithm is better than Naive Bayes in terms of classification accuracy.

scholarly journals Color moment and gray level co-occurrence matrix in classification of soil organic matter for patchouli plantation

2020 ◽  
Vol 19 (2) ◽  
pp. 983
Author(s):  
Candra Dewi ◽  
Akbar Grahadhuita ◽  
Lailil Muflikhah
Keyword(s):  
Organic Matter ◽  
Nearest Neighbor ◽  
Texture Feature ◽  
Texture Features ◽  
Training Data ◽  
Gray Level ◽  
K Nearest Neighbor ◽  
Occurrence Matrix ◽  
Selection Of ◽  
Color And Texture Features

<span>Patchouli is one of the essential plants that have the most potential and widely cultivated in Indonesia. Patchouli is greedily absorbing soil nutrients and organic matter. Therefore, the selection of soil with high organic matter will maximize the patchouli’s productivity. This paper aims to facilitate soil’s organic matter identification by classifying soil image based on the combination of color and texture features. The color feature extraction was done using the Color Moments method and the texture feature was done using Gray Level Co-occurrence Matrix (GLCM) method. The selection of features was performed to obtain the best combination of color and texture features. The selected features then was used as input of classification by using Modified K-Nearest Neighbor (MKNN). The samples of soil that used as data were taken from several districts in Blitar, East Java province. The testing result of this research showed the highest accuracy of 93,33% by using 180 training data, and also particular color and texture feature combination.</span>

Gray-Level Co-occurrence Matrix and Random Forest Based Off-line Odia Handwritten Character Recognition

2019 ◽  
Vol 13 (2) ◽  
pp. 136-141 ◽  
Author(s):  
Abhisek Sethy ◽  
Prashanta Kumar Patra ◽  
Deepak Ranjan Nayak
Keyword(s):  
Feature Extraction ◽  
Random Forest ◽  
Character Recognition ◽  
Recognition Rate ◽  
Discrete Wavelet ◽  
Gray Level ◽  
Handwritten Character Recognition ◽  
Handwritten Character ◽  
Wide Range ◽  
Occurrence Matrix

Background: In the past decades, handwritten character recognition has received considerable attention from researchers across the globe because of its wide range of applications in daily life. From the literature, it has been observed that there is limited study on various handwritten Indian scripts and Odia is one of them. We revised some of the patents relating to handwritten character recognition. Methods: This paper deals with the development of an automatic recognition system for offline handwritten Odia character recognition. In this case, prior to feature extraction from images, preprocessing has been done on the character images. For feature extraction, first the gray level co-occurrence matrix (GLCM) is computed from all the sub-bands of two-dimensional discrete wavelet transform (2D DWT) and thereafter, feature descriptors such as energy, entropy, correlation, homogeneity, and contrast are calculated from GLCMs which are termed as the primary feature vector. In order to further reduce the feature space and generate more relevant features, principal component analysis (PCA) has been employed. Because of the several salient features of random forest (RF) and K- nearest neighbor (K-NN), they have become a significant choice in pattern classification tasks and therefore, both RF and K-NN are separately applied in this study for segregation of character images. Results: All the experiments were performed on a system having specification as windows 8, 64-bit operating system, and Intel (R) i7 – 4770 CPU @ 3.40 GHz. Simulations were conducted through Matlab2014a on a standard database named as NIT Rourkela Odia Database. Conclusion: The proposed system has been validated on a standard database. The simulation results based on 10-fold cross-validation scenario demonstrate that the proposed system earns better accuracy than the existing methods while requiring least number of features. The recognition rate using RF and K-NN classifier is found to be 94.6% and 96.4% respectively.

An intelligent fault diagnosis method based on domain adaptation for rolling bearings under variable load conditions

2021 ◽  
pp. 095440622110329
Author(s):  
Jianqun Zhang ◽  
Qing Zhang ◽  
Xianrong Qin ◽  
Yuantao Sun
Keyword(s):  
Feature Extraction ◽  
Fault Diagnosis ◽  
Domain Adaptation ◽  
Rolling Bearing ◽  
Training Data ◽  
Variable Load ◽  
K Nearest Neighbor ◽  
Target Domain ◽  
Bearing Faults ◽  
Load Conditions

To identify rolling bearing faults under variable load conditions, a method named DISA-KNN is proposed in this paper, which is based on the strategy of feature extraction-domain adaptation-classification. To be specific, the time-domain and frequency-domain indicators are used for feature extraction. Discriminative and domain invariant subspace alignment (DISA) is used to minimize the data distributions’ discrepancies between the training data (source domain) and testing data (target domain). K-nearest neighbor (KNN) is applied to identify rolling bearing faults. DISA-KNN’s validation is proved by the experimental signal collected under different load conditions. The identification accuracies obtained by the DISA-KNN method are more than 90% on four datasets, including one dataset with 99.5% accuracy. The strength of the proposed method is further highlighted by comparisons with the other 8 methods. These results reveal that the proposed method is promising for the rolling bearing fault diagnosis in real rotating machinery.

DIAGNOSIS OF LUNG NODULES FROM 2D COMPUTER TOMOGRAPHY SCANS

2020 ◽  
Vol 32 (03) ◽  
pp. 2050017
Author(s):  
Ayat Karrar ◽  
Mai S. Mabrouk ◽  
Manal AbdEl Wahed
Keyword(s):  
Nearest Neighbor ◽  
Survival Rates ◽  
Maximum Intensity Projection ◽  
Lung Nodules ◽  
Gray Level ◽  
K Nearest Neighbor ◽  
Cad System ◽  
Different Shapes ◽  
Occurrence Matrix ◽  
Aided Diagnosis

Cancers typically are both highly dangerous and common. Among these, lung cancer has one of the lowest survival rates compared to other cancers. CT scans can reveal dense masses of different shapes and sizes; in the lungs, these are called lung nodules. This study applied a computer-aided diagnosis (CAD) system to detect candidate nodules — and diagnose it either solitary or juxtapleural — with equivalent diameters, ranging from 7.78[Formula: see text]mm to 22.48[Formula: see text]mm in a 2D CT slice. Pre-processing and segmentation is a very important step to segment and enhance the CT image. A segmentation and enhancement algorithm is achieved using bilateral filtering, Thresholding the gray-level transformation function, Bounding box and maximum intensity projection. Border artifacts are removed by clearing the lung border, erosion, dilation and superimposing. Feature extraction is done by extracting 20 gray-level co-occurrence matrix features from four directions: [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text] and one distance of separation ([Formula: see text] pixel). In the classification step, two classifiers are proposed to classify two types of nodules based on their locations: as juxtapleural or solitary nodules. The two classifiers are a deep learning convolutional neural network (CNN) and the K-nearest neighbor (KNN) algorithm. Random oversampling and 10-fold cross-validation are used to improve the results. In our CAD system, the highest accuracy and sensitivity rates achieved by the CNN were 96% and 95%, respectively, for solitary nodule detection. The highest accuracy and sensitivity rates achieved by the KNN model were 93.8% and 96.7%, respectively, and K was set to 1 to detect juxtapleural nodules.

Discriminant DCT Feature Extraction

2006 ◽  
pp. 205-221
Author(s):  
David Zhang ◽  
Xiao-Yuan Jing ◽  
Jian Yang
Keyword(s):  
Feature Extraction ◽  
Frequency Domain ◽  
Discrete Cosine Transform ◽  
Domain Analysis ◽  
Frequency Domain Analysis ◽  
Experimental Results ◽  
Cosine Transform ◽  
Analysis Technique

This chapter provides a feature extraction approach that combines the discrete cosine transform (DCT) with LDA. The DCT-based frequency-domain analysis technique is introduced first. Then, we describe the presented discriminant DCT approach and analyze its theoretical properties. Finally, we offer detailed experimental results and a chapter summary.

scholarly journals Detection and Characterization of Physical Activity and Psychological Stress from Wristband Data

Signals ◽  
2020 ◽  
Vol 1 (2) ◽  
pp. 188-208
Author(s):  
Mert Sevil ◽  
Mudassir Rashid ◽  
Mohammad Reza Askari ◽  
Zacharie Maloney ◽  
Iman Hajizadeh ◽  
...  
Keyword(s):  
Physical Activity ◽  
Signal Processing ◽  
Feature Extraction ◽  
Psychological Stress ◽  
Training Data ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Linear Discriminant ◽  
Physiological Variables

Wearable devices continuously measure multiple physiological variables to inform users of health and behavior indicators. The computed health indicators must rely on informative signals obtained by processing the raw physiological variables with powerful noise- and artifacts-filtering algorithms. In this study, we aimed to elucidate the effects of signal processing techniques on the accuracy of detecting and discriminating physical activity (PA) and acute psychological stress (APS) using physiological measurements (blood volume pulse, heart rate, skin temperature, galvanic skin response, and accelerometer) collected from a wristband. Data from 207 experiments involving 24 subjects were used to develop signal processing, feature extraction, and machine learning (ML) algorithms that can detect and discriminate PA and APS when they occur individually or concurrently, classify different types of PA and APS, and estimate energy expenditure (EE). Training data were used to generate feature variables from the physiological variables and develop ML models (naïve Bayes, decision tree, k-nearest neighbor, linear discriminant, ensemble learning, and support vector machine). Results from an independent labeled testing data set demonstrate that PA was detected and classified with an accuracy of 99.3%, and APS was detected and classified with an accuracy of 92.7%, whereas the simultaneous occurrences of both PA and APS were detected and classified with an accuracy of 89.9% (relative to actual class labels), and EE was estimated with a low mean absolute error of 0.02 metabolic equivalent of task (MET).The data filtering and adaptive noise cancellation techniques used to mitigate the effects of noise and artifacts on the classification results increased the detection and discrimination accuracy by 0.7% and 3.0% for PA and APS, respectively, and by 18% for EE estimation. The results demonstrate the physiological measurements from wristband devices are susceptible to noise and artifacts, and elucidate the effects of signal processing and feature extraction on the accuracy of detection, classification, and estimation of PA and APS.

Sign in / Sign up

Export Citation Format

Share Document