Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal JURNAL PENELITIAN SAINTIKA JURNAL SAINS INDONESIA
Hermawan Syahputra
Jurusan Ilmu Komputer dan Elektronika, Universitas Gadjah Mada
Education

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
Simulasi Lintasan Terpendek pada Graf Komplit Menggunakan Ant Colony Optimization Algorithm Riana, Ami; Syahputra, Hermawan
Jurnal Sains Indonesia Vol 42, No 2 (2018): Edisi Juli - Desember
Publisher : Universitas Negeri Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24114/jsi.v42i2.12248

Abstract

This study aims to build a shortest path simulation program on the complete graph K_20. The data of distance in this simulation was determined randomly with the provision of a value of 0-100. The simulation conducted was an algorithm calculation used parameter values with different initial pheromone conditions. The parameters in the Ant Colony Optimization Algorithm are set with alpha = 1, beta = 2, the initial pheromone condition = 0,0001 for the first simulation; alpha = 1, beta = 2, initial pheromone = 1 for the second simulation; and alpha value = 1, beta = 5, initial pheromone condition = 0,00000001 for the third simulation. The simulation results showed that if the value of the initial pheromone condition used gets greater, the value of the temporary output gets greater. Even though the initial pheromone condition was different, the shortest path obtained with distance data used in this study is the same, namely 15-14-1-3-20-12-16-6-18-10-9-13-11-7-8-4-2-17-5-19 with length 613 (in kilometers). [THE SHORTEST PATH SIMULATION IN COMPLETE GRAPHS USING THE ANT COLONY OPTIMIZATION ALGORITHM](J. Sains Indon., 42(2): 44-51, 2018)Keywords:Ant Colony Optimization Algorithm, Complete Graph, Shortest Path
DESAIN MODEL PENGENALAN TANAMAN MENGGUNAKAN CITRA DAUN 3D (MODEL DESIGN OF PLANT RECOGNITION USING 3D LEAF IMAGES ) Syahputra, Hermawan
JURNAL PENELITIAN SAINTIKA Vol 14, No 1 (2014): Maret 2014
Publisher : JURNAL PENELITIAN SAINTIKA

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Understanding of the view (scene) and 3D objectrecognition is one of the magnificent challenges in computervision. A wide variety of techniques and goals, such as structurefrom motion, optical flow, stereo, edge detection, andsegmentation, can be viewed as subtasks in scene understandingand object recognition. Many methods can be applied by previousinvestigators. On the contrary, this research is focused on highlevelrepresentation for scenery and objects, especially physicalrepresentation recognize 3D view of the underlying image. Thisstudy aims to answer the following questions:• How to relate 2D image with a 3D scene, and how we can takeadvantage of the relationship perspective?• How does the physical scene space can be modeled, and how toestimate the space scene of an image?• How to represent and recognize objects in a way that is robust tochanges in viewpoint?• How can use the knowledge and perspective of the scene toimprove the recognition space, or vice versa?In this study, carried out the stages of development of the plant recognition system based on 3D stereo images leaves, namely: image enhancement and segmentation, stereo correspondence, disparity map calculation and depth maps, feature extraction using Gray Level Coocurence Matrix, and classification using Euclidian distance. The results obtained in this study indicate that the recognition accuracy of the plant with the highest 3D image of the leaf is 83.3% to recognize 3 varieties of plants. While to recognize 9 varieties of plants obtained low accuracy. The low accuracy is due to the quality of the disparity and depth maps are possible for further research.
Co-Authors Riana, Ami