Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal ULTIMATICS

Digital Image Processing using Texture Features Extraction of Local Seeds in Nekbaun Village with Color Moment, Gray Level Co Occurance Matrix, and k-Nearest Neighbor Yampi R Kaesmetan; Marlinda Vasty Overbeek
Ultimatics : Jurnal Teknik Informatika Vol 13 No 2 (2021): Ultimatics : Jurnal Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31937/ti.v13i2.2038

Abstract

The problem in determining the selection of corn seeds for replanting, especially maize in East Nusa Tenggara is still an important issue. Things that affect the quality of corn seeds are damaged seeds, dull seeds, dirty seeds, and broken seeds due to the drying and shelling process, which during the process of shelling corn with a machine, many damaged and broken seeds are found. So far, quality evaluation in the process of classification of the quality of corn seeds is still done manually through visible observations. Manual systems take a long time and produce products of inconsistent quality due to visual limitations, fatigue, and differences in the perceptions of each observer. The selection of local maize seeds in Timor Island, East Nusa Tenggara Province, especially in Nekbaun Village, West Amarasi District with feature extraction with a color moment shows that the mean, standard deviation and skewness features have an average validation of 88% and use the GLCM method which shows the neighbor relationship. Between the two pixels that form a co-occurrence matrix of the image data, namely GLCM, it shows that the features of homogeneity, correlation, contrast and energy have an average validation of 70.93%. The k-Nearest Neighbor (k-NN) algorithm is used in research to classify the image object to be studied. The results of this study were successfully carried out using k-Nearest Neighbor (k-NN) with the euclidean distance and k = 1 with the highest extraction yield of 88% and the results of GLCM feature extraction for homogeneity of 75.5%, correlation of 78.67%, contrast of 65.75 % and energy of 63.83% with an average accuracy of 70.93%.
Classification of Metagenome Fragments With Agglomerative Hierarchical Clustering Alex Kurniadi; Marlinda Vasty Overbeek
Ultimatics : Jurnal Teknik Informatika Vol 13 No 2 (2021): Ultimatics : Jurnal Teknik Informatika
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31937/ti.v13i2.2180

Abstract

Unlike genomics which study specifically culturable microorganisms, metagenomics is a field that studies microorganic samples retrieved directly from the environment. Such samples produce widely varying fragments when sequenced, many of which are still unidentified or unknown. Assembly of these fragments in the goals of identifying the species contained among them are thus prone to make said goals more difficult, so it becomes necessary for binning techniques to come in handy while trying to classify these mixed fragments onto certain levels in the phylogenetic tree. This research attempts to implement algorithms and methods such as k-mers to use for feature extraction, linear discriminant analysis (LDA) for dimensionality reduction, and agglomerative hierarchical clustering (AGNES) for taxonomic classification to the genus level. Experimentation is done across different objective measurements, including the length of the observed metagenome fragment that spans from 0,5 Kbp up to 10 Kbp for both the 3-mer and 4-mer contexts (k = 3 and k = 4). The averaged validity scores of the resulting data clusters generated from both the training and test sets, computed with the silhouette index metric, are 0.6945 and 0.0879 for the 3-mer context, along with 0.5219 and 0.1884 for the 4-mer context.