Klasifikasi Daun Dengan Perbaikan Fitur Citra Menggunakan Metode K-Nearest Neighbor

  • Febri Liantoni Institut Teknologi Adhi Tama

Abstract

Plants are the most important part in life on earth as oxygen supplier to breathe, groceries, fuel, medicine and more. Plants can be classified based on its leaves shape. Classification process is required well data extraction feature, so it needs fixing feature process at pre-processing level. Combining median filter and image erosion is used for fixing feature process. Whereas for feature extraction is used invariant moment method. In this research, it is used leaves classification based on leaves edge shape. K-Nearest Neighbor Method (KNN) is used for leaves classification process. KNN method is chosen because this method is known rapid in training data, effective for large training data, simple and easy to learn. Testing the result of leaves classification from image which is on dataset has been built to get accuracy value about 86,67%.

Index Terms—Classification, Median Filter, Invariant Moment, K-Nearest Neighbor.

Downloads

Download data is not yet available.
Published
2016-08-01
How to Cite
Liantoni, F. (2016). Klasifikasi Daun Dengan Perbaikan Fitur Citra Menggunakan Metode K-Nearest Neighbor. Ultimatics : Jurnal Teknik Informatika, 7(2), 98-104. https://doi.org/https://doi.org/10.31937/ti.v7i2.356