scholarly journals Deteksi Objek pada Film Menggunakan Yolo Object Detector dan K-Nearest Neighbor

2021 ◽  
Vol 1 ◽  
pp. 61-70
Author(s):  
Windra Swastika ◽  
Marcellino Agustinus Sinaga
Keyword(s):  
Nearest Neighbor ◽  
Mean Average Precision ◽  
K Nearest Neighbor ◽  
Average Precision

Peran film sebagai industri budaya merupakan salah satu faktor yang dianggap penting bagi Indonesia. Film harus benar–benar diperhatikan dan dilindungi agar tidak berbalik menjadi pengaruh negatif yang tidak sesuai dan mengakibatkan kemunduran bagi negara Indonesia. Rating usia dari sebuah film merupakan solusi untuk masalah tersebut. Rating usia menunjukkan sentimen pada film tersebut negatif atau positif terutama untuk anak-anak. Pada penelitian ini akan dibuat sebuah sistem untuk mendeteksi objek pada film menggunakan You Only Look Once (YOLO). YOLO digunakan untuk mendapatkan data dari objek yang terdeteksi pada film yaitu untuk objek pistol, pisau, dan rokok dengan jumlah iterasi 50.000. Hasil dari YOLO Mean Average Precision (mAP) adalah 67,14%.

Implementation of Verification and Matching E-KTP with Faster R-CNN and ORB

2021 ◽  
Vol 5 (4) ◽  
pp. 783-793
Author(s):  
Muhammad Muttabi Hudaya ◽  
Siti Saadah ◽  
Hendy Irawan
Keyword(s):  
Image Matching ◽  
Nearest Neighbor ◽  
Feature Matching ◽  
Image Feature ◽  
Brute Force ◽  
K Nearest Neighbor ◽  
Matching Method ◽  
Average Precision ◽  
Detection Model ◽  
Matching Process

needs a solid validation that has verification and matching uploaded images. To solve this problem, this paper implementing a detection model using Faster R-CNN and a matching method using ORB (Oriented FAST and Rotated BRIEF) and KNN-BFM (K-Nearest Neighbor Brute Force Matcher). The goal of the implementations is to reach both an 80% mark of accuracy and prove matching using ORB only can be a replaced OCR technique. The implementation accuracy results in the detection model reach mAP (Mean Average Precision) of 94%. But, the matching process only achieves an accuracy of 43,46%. The matching process using only image feature matching underperforms the previous OCR technique but improves processing time from 4510ms to 60m). Image matching accuracy has proven to increase by using a high-quality dan high quantity dataset, extracting features on the important area of EKTP card images.

scholarly journals Algoritma Scale Invariant Feature Transform (SIFT) pada Deteksi Kendaraan Bermotor di Jalan Raya

MIND Journal ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 54-65
Author(s):  
YUSUP MIFTAHUDDIN ◽  
NUR FITRIANTI FAHRUDIN ◽  
MOCHAMAD FACHRY PRAYOGA
Keyword(s):  
Nearest Neighbor ◽  
Heavy Vehicle ◽  
Heavy Vehicles ◽  
K Nearest Neighbor ◽  
Average Precision ◽  
Scale Invariant ◽  
Invariant Feature ◽  
Feature Transform ◽  
Scale Invariant Feature ◽  
F Measure

AbstrakProses perhitungan jumlah kendaraan yang masih dilakukan secara manual dan membutuhkan banyak operator dalam pendataan. Berdasarkan hal itu, diperlukan sistem yang mampu mendeteksi dan mengklasifikasi kendaraan yang melintas di jalan raya secara otomatis. Dalam mengidentifikasi citra kendaraan, sistem menggunakan algoritma SIFT. Hasil fitur akan dibandingkan dengan metode K-Nearest Neighbor (KNN). Sistem dibangun untuk mendeteksi jenis kendaraan berat dengan mengukur tingkat akurasi keberhasilan berdasarkan nilai pencahayaan, jumlah objek, perubahan rotasi, serta pada kondisi siang dan malam hari. Dataset yang digunakan berjumlah 100 citra kendaraan berat. Kinerja sistem pada kondisi siang hari mendapat nilai presisi rata-rata 100%, nilai recall 54%, dan nilai akurasi 78%. Hasil pengukuran presisi dan recall, diperoleh nilai f-measure sebesar 67 %.Kata kunci: SIFT, kendaraan berat, K-Nearest NeighbourAbstractThe process of collecting vehicles still done manually and requires a lot of human resources. Therefore, we need a system that can detect and classify vehicles passing on the highway automatically. SIFT is an algorithm for identification of an image. The features will be compared using the K-Nearest Neighbor (KNN) method. In this study,  system will be designed to detect the type of heavy vehicle using the SIFT method to measure the accuracy of success based on the value of lighting, number of objects, changes in rotation, and day night conditions. Dataset used was 100 heavy vehicle images. The system performance during daytime conditions gets an average precision value of 100%, a recall value of 54%, and an accuracy value of 78%. From the results of precision and recall, the f-measure value is 67 %.Keywords: SIFT, heavy vehicles, K-Nearest Neighbour 

scholarly journals Identifikasi Jenis Font Menggunakan Metode Genetic Modified K-Nearest Neighbor

2020 ◽  
Vol 4 (3) ◽  
pp. 157-166
Author(s):  
Yusup Miftahuddin ◽  
Sofia Umaroh ◽  
Agistya Anugrah Dwiutama
Keyword(s):  
Genetic Algorithm ◽  
Pattern Recognition ◽  
Hybrid Method ◽  
Classification Accuracy ◽  
Nearest Neighbor ◽  
K Nearest Neighbor ◽  
Average Precision ◽  
Complete Collection ◽  
Front End ◽  
F Measure

ABSTRAKFont adalah kumpulan karakter lengkap yang memiliki ukuran dan gaya. Saat melihat desain atau aplikasi, desainer grafis dan pengembang front-end terinspirasi untuk menggunakan font yang sama. Namun font telah menjadi gambar atau aplikasi dan sulit untuk mengetahui jenis font yang digunakan. Genetic Modified K-Nearest Neighbor (GMKNN) merupakan metode gabungan dari Modified K-Nearest Neighbor (MKNN) dan Genetic Algorithm (GA) untuk menentukan k Optimal. Dalam penelitian ini, sebuah sistem akan dirancang untuk mengenali jenis font sans-serif menggunakan metode Genetic Modified K-Nearest Neighbor (GMKNN) untuk mengukur akurasi dan waktu komputasi. Kinerja sistem dalam proses mengidentifikasi jenis font mendapat nilai presisi rata-rata 74,6%. Nilai akurasi adalah 72,2% dan nilai recall 72%. Dari hasil presisi dan recall yang diperoleh nilai f-measure sebesar 72,2% dan rata-rata waktu komputasi untuk satu karakter diperoleh adalah 945,04190395673 detikKata kunci: Pengolahan Citra Digital, Identifikasi Font, Pengenalan Pola dan GMKNNABSTRACTFonts is a complete collection of characters that have size and style. When looking at a design or an application, graphic designers and front-end developers are inspired to use the same font. Unfortunately, the font has become an image or an application so it is difficult to identify the font types. Genetic Modified K-Nearest Neighbor (GMKNN) is a hybrid method of Modified K-Nearest Neighbor (MKNN) and Genetic Algorithm (GA) to determine optimal k, it also reduces the complexity of MKNN and improves the classification accuracy. In this research, a system is designed to recognize font sans-serif types using GMKNN method to measure accuracy and time computation. The performance of the system in the process of identifying font types gets an average precision value of 74.6%. The recall and accuracy values are 72% and 72,2%, respectively. Based on the results of precision and recall obtained, the system gets an f-measured value of 72.2% and time obtained for one character is 945,04190395673 seconds.Keywords: Image Proccesing, Font Identify, Pattern Recognition, and GMKNN

Machine Learning Verdict of EEG Signals in Brain Computer Interface

2018 ◽  
pp. 429-441
Author(s):  
M. Jeyanthi ◽  
C. Velayutham
Keyword(s):  
Nearest Neighbor ◽  
Technology Development ◽  
Vital Role ◽  
Svm Classifier ◽  
K Nearest Neighbor ◽  
Data Mining Technique ◽  
Data Set ◽  
Eeg Data ◽  
Irrelevant Attributes

In Science and Technology Development BCI plays a vital role in the field of Research. Classification is a data mining technique used to predict group membership for data instances. Analyses of BCI data are challenging because feature extraction and classification of these data are more difficult as compared with those applied to raw data. In this paper, We extracted features using statistical Haralick features from the raw EEG data . Then the features are Normalized, Binning is used to improve the accuracy of the predictive models by reducing noise and eliminate some irrelevant attributes and then the classification is performed using different classification techniques such as Naïve Bayes, k-nearest neighbor classifier, SVM classifier using BCI dataset. Finally we propose the SVM classification algorithm for the BCI data set.

PENENTUAN DAERAH PRIORITAS PELAYANAN AKTA KELAHIRAN DENGAN METODE K-NN DAN K-MEANS

2020 ◽  
Vol 17 (1) ◽  
pp. 319-328
Author(s):  
Ade Muchlis Maulana Anwar ◽  
Prihastuti Harsani ◽  
Aries Maesya
Keyword(s):  
Nearest Neighbor ◽  
Information Gain ◽  
Birth Certificate ◽  
Population Data ◽  
Community Services ◽  
Birth Certificates ◽  
Similar Data ◽  
K Nearest Neighbor ◽  
Civil Registration ◽  
The Family

Population Data is individual data or aggregate data that is structured as a result of Population Registration and Civil Registration activities. Birth Certificate is a Civil Registration Deed as a result of recording the birth event of a baby whose birth is reported to be registered on the Family Card and given a Population Identification Number (NIK) as a basis for obtaining other community services. From the total number of integrated birth certificate reporting for the 2018 Population Administration Information System (SIAK) totaling 570,637 there were 503,946 reported late and only 66,691 were reported publicly. Clustering is a method used to classify data that is similar to others in one group or similar data to other groups. K-Nearest Neighbor is a method for classifying objects based on learning data that is the closest distance to the test data. k-means is a method used to divide a number of objects into groups based on existing categories by looking at the midpoint. In data mining preprocesses, data is cleaned by filling in the blank data with the most dominating data, and selecting attributes using the information gain method. Based on the k-nearest neighbor method to predict delays in reporting and the k-means method to classify priority areas of service with 10,000 birth certificate data on birth certificates in 2019 that have good enough performance to produce predictions with an accuracy of 74.00% and with K = 2 on k-means produces a index davies bouldin of 1,179.

Optimizing Error Rate in Intrusion Detection System Using Artificial Neural Network Algorithm

2018 ◽  
Vol 6 (9) ◽  
pp. 152
Author(s):  
S. Vijaya Rani ◽  
G. N. K. Suresh Babu
Keyword(s):  
Neural Network ◽  
Artificial Neural Network ◽  
Intrusion Detection ◽  
Error Rate ◽  
Learning Process ◽  
Nearest Neighbor ◽  
Detection System ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Artificial Neural

The illegal hackers  penetrate the servers and networks of corporate and financial institutions to gain money and extract vital information. The hacking varies from one computing system to many system. They gain access by sending malicious packets in the network through virus, worms, Trojan horses etc. The hackers scan a network through various tools and collect information of network and host. Hence it is very much essential to detect the attacks as they enter into a network. The methods  available for intrusion detection are Naive Bayes, Decision tree, Support Vector Machine, K-Nearest Neighbor, Artificial Neural Networks. A neural network consists of processing units in complex manner and able to store information and make it functional for use. It acts like human brain and takes knowledge from the environment through training and learning process. Many algorithms are available for learning process This work carry out research on analysis of malicious packets and predicting the error rate in detection of injured packets through artificial neural network algorithms.

Perancangan Aplikasi Prediksi Kelulusan Tepat Waktu Bagi Mahasiswa Baru Dengan Teknik Data Mining (Studi Kasus: Data Akademik Mahasiswa STMIK Dipanegara Makassar)

2015 ◽  
Vol 1 (4) ◽  
pp. 270
Author(s):  
Muhammad Syukri Mustafa ◽  
I. Wayan Simpen
Keyword(s):  
Data Mining ◽  
Nearest Neighbor ◽  
Test Results ◽  
K Nearest Neighbor ◽  
Accuracy Rate ◽  
Sample Data ◽  
New Students ◽  
K Nearest Neighbor Algorithm ◽  
Using Data ◽  
Existing Data

Penelitian ini dimaksudkan untuk melakukan prediksi terhadap kemungkian mahasiswa baru dapat menyelesaikan studi tepat waktu dengan menggunakan analisis data mining untuk menggali tumpukan histori data dengan menggunakan algoritma K-Nearest Neighbor (KNN). Aplikasi yang dihasilkan pada penelitian ini akan menggunakan berbagai atribut yang klasifikasikan dalam suatu data mining antara lain nilai ujian nasional (UN), asal sekolah/ daerah, jenis kelamin, pekerjaan dan penghasilan orang tua, jumlah bersaudara, dan lain-lain sehingga dengan menerapkan analysis KNN dapat dilakukan suatu prediksi berdasarkan kedekatan histori data yang ada dengan data yang baru, apakah mahasiswa tersebut berpeluang untuk menyelesaikan studi tepat waktu atau tidak. Dari hasil pengujian dengan menerapkan algoritma KNN dan menggunakan data sampel alumni tahun wisuda 2004 s.d. 2010 untuk kasus lama dan data alumni tahun wisuda 2011 untuk kasus baru diperoleh tingkat akurasi sebesar 83,36%.This research is intended to predict the possibility of new students time to complete studies using data mining analysis to explore the history stack data using K-Nearest Neighbor algorithm (KNN). Applications generated in this study will use a variety of attributes in a data mining classified among other Ujian Nasional scores (UN), the origin of the school / area, gender, occupation and income of parents, number of siblings, and others that by applying the analysis KNN can do a prediction based on historical proximity of existing data with new data, whether the student is likely to complete the study on time or not. From the test results by applying the KNN algorithm and uses sample data alumnus graduation year 2004 s.d 2010 for the case of a long and alumni data graduation year 2011 for new cases obtained accuracy rate of 83.36%.

Sign in / Sign up

Export Citation Format

Share Document