Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Komputer dan Informasi
Grafika Jati
Faculty of Computer Science, Universitas Indonesia
Computer Science & IT Library & Information Science

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

Found 3 Documents
Search

 1 
COMPARISON OF IMAGE ENHANCEMENT METHODS FOR CHROMOSOME KARYOTYPE IMAGE ENHANCEMENT Dewa Made Sri Arsa; Grafika Jati; Agung Santoso; Rafli Filano; Nurul Hanifah; Muhammad Febrian Rachmadi
Jurnal Ilmu Komputer dan Informasi Vol 10, No 1 (2017): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (612.028 KB) | DOI: 10.21609/jiki.v10i1.445

Abstract

The chromosome is a set of DNA structure that carry information about our life. The information can be obtained through Karyotyping. The process requires a clear image so the chromosome can be evaluate well. Preprocessing have to be done on chromosome images that is image enhancement. The process starts with image background removing. The image will be cleaned background color. The next step is image enhancement. This paper compares several methods for image enhancement. We evaluate some method in image enhancement like Histogram Equalization (HE), Contrast-limiting Adaptive Histogram Equalization (CLAHE), Histogram Equalization with 3D Block Matching (HE+BM3D), and basic image enhancement, unsharp masking. We examine and discuss the best method for enhancing chromosome image. Therefore, to evaluate the methods, the original image was manipulated by the addition of some noise and blur. Peak Signal-to-noise Ratio (PSNR) and Structural Similarity Index (SSIM) are used to examine method performance. The output of enhancement method will be compared with result of Professional software for karyotyping analysis named Ikaros MetasystemT M . Based on experimental results, HE+BM3D method gets a stable result on both scenario noised and blur image. 
MULTI OBJECT DETECTION AND TRACKING USING OPTICAL FLOW DENSITY – HUNGARIAN KALMAN FILTER (OFD - HKF) ALGORITHM FOR VEHICLE COUNTING Muhamad Soleh; Grafika Jati; Muhammad Hafizhuddin Hilman
Jurnal Ilmu Komputer dan Informasi Vol 11, No 1 (2018): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (490.037 KB) | DOI: 10.21609/jiki.v11i1.581

Abstract

Intelligent Transportation Systems (ITS) is one of the most developing research topic along with growing advance technology and digital information. The benefits of research topic on ITS are to address some problems related to traffic conditions. Vehicle detection and tracking is one of the main step to realize the benefits of ITS. There are several problems related to vehicles detection and tracking. The appearance of shadow, illumination change, challenging weather, motion blur and dynamic background such a big challenges issue in vehicles detection and tracking. Vehicles detection in this paper using the Optical Flow Density algorithm by utilizing the gradient of object displacement on video frames. Gradient image feature and HSV color space on Optical flow density guarantee the object detection in illumination change and challenging weather for more robust accuracy. Hungarian Kalman filter algorithm used for vehicle tracking. Vehicle tracking used to solve miss detection problems caused by motion blur and dynamic background. Hungarian kalman filter combine the recursive state estimation and optimal solution assignment. The future positon estimation makes the vehicles detected although miss detection occurance on vehicles. Vehicles counting used single line counting after the vehicles pass that line. The average accuracy for each process of vehicles detection, tracking, and counting were 93.6%, 88.2% and 88.2% respectively.
Sparse Coding-Based Method Comparison For Land-Use Classification Dewa Made Sri Arsa; Grafika Jati; M H Hilman
Jurnal Ilmu Komputer dan Informasi Vol 10, No 2 (2017): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information
Publisher : Faculty of Computer Science - Universitas Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (448.73 KB) | DOI: 10.21609/jiki.v10i2.480

Abstract

Land-use classification utilize  high-resolution remote sensing image. The image is utilized for improving the classification problem. Nonetheless, in other side, the problem becomes more challenging cause the image is too complex. We have to represent the image appropriately. On of the common method to deal with it is Bag of Visual Word (BOVW).  The method needs  a coding process to get the final data interpretation. There are many methods to do coding such as Hard Quantization Coding (HQ), Sparse Coding (SC), and Locality-constrained Linear Coding (LCC). However, that coding methods use a different assumption. Therefore, we have to compare the result of each coding method. The coding method affects classification accuracy. The best coding method will produce the better classification result. Dataset UC Merced consisted 21 classes is used in this research. The experiment result shows that LCC got better performance / accuracy than SC and HQ. LCC method got 86.48 % accuracy. Furthermore, LCC also got the best performance on various number of training data for each class.
Co-Authors Agung Santoso Arsa, Dewa Made Sri M H Hilman Muhamad Soleh Muhammad Febrian Rachmadi Muhammad Hafizhuddin Hilman Nurul Hanifah Rafli Filano