Garuda - Garba Rujukan Digital

Article Per Year (5 Year)

All

Jurnal Ilmu Komputer dan Informasi

JIKI
Website

Published by Universitas Indonesia

ISSN : 20887051 EISSN : 25029274 DOI : 10.21609

Core Subject : Science,

Computer Science & IT Library & Information Science

Jurnal Ilmu Komputer dan Informasi is a scientific journal in computer science and information containing the scientific literature on studies of pure and applied research in computer science and information and public review of the development of theory, method and applied sciences related to the subject. Jurnal Ilmu Komputer dan Informasi is published by Faculty of Computer Science Universitas Indonesia. Editors invite researchers, practitioners, and students to write scientific developments in fields related to computer science and information. Jurnal Ilmu Komputer dan Informasi is issued 2 (two) times a year in February and June. This journal contains research articles and scientific studies. It can be obtained directly through the Library of the Faculty of Computer Science Universitas Indonesia.

Arjuna Subject : -

Articles 257 Documents

12 13 14 15 16

PSNR BASED OPTIMIZATION APPLIED TO ALGEBRAIC RECONSTRUCTION TECHNIQUE FOR IMAGE RECONSTRUCTION ON A MULTI-CORE SYSTEM Bharathi Lakshmi Agnimarimuthu; Christopher Durairaj Daniel Durairaj
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

The present work attempts to reveal a parallel Algebraic Reconstruction Technique (pART) to reduce the computational speed of reconstructing artifact-free images from projections. ART is an iterative algorithm well known to reconstruct artifact-free images with limited number of projections. In this work, a novel idea has been focused on to optimize the number of iterations mandatory based on Peak to Signal Noise Ratio (PSNR) to reconstruct an image. However, it suffers of worst computation speed. Hence, an attempt is made to reduce the computation time by running iterative algorithm on a multi-core parallel environment. The execution times are computed for both serial and parallel implementations of ART using different projection data, and, tabulated for comparison. The experimental results demonstrate that the parallel computing environment provides a source of high computational power leading to obtain reconstructed image instantaneously.

QUALITY OF SERVICE ORIENTED WEB SERVICE SELECTION: AN EVALUATION OF TECHNIQUES Munjiah Nur Saadah; Rigga Widar Atmagi
Jurnal Ilmu Komputer dan Informasi Vol 7, No 1 (2014): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Abstract In service-oriented computing, web services are the basic foundation that aims to facilitate building of business application in a more flexible and interoperable manner for enterprise collaboration. One of the most promising advantages of web service technology is the possibility of creating added-value services by combining existing ones. A key step for composing and executing services lies in the selection of the individual service to use. Much attention has been devoted to appropriate selection of service functionalities, but also the non-functional properties of the services play a key role. A web service selection technique must take as much as possible the important influencing aspects into account to the selection process in order to minimize the selection efforts. This paper evaluates several web service selection techniques published in literature with the focus on their contributions to web service selection. The evaluation results can be used as a basis for improving web service selection techniques and then simplifying the selection tasks.

PEMBANGUNAN SISTEM INFORMASI UNTUK PENYELENGGARAAN SERTIFIKASI DOSEN DI INDONESIA Yeni Nuraeni
Jurnal Ilmu Komputer dan Informasi Vol 2, No 2 (2009): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Sejak tahun 2008 pemerintah Indonesia mulai melaksanakan sertifikasi dosen non guru besar dengan tujuan untuk memberikan pengakuan profesionalisme, perlindungan profesi dan kesejahteraan dosen di Indonesia. Upaya-upaya tersebut diharapkan pada akhirnya dapat meningkatkan mutu perguruan tinggi di Indonesia karena dosen merupakan komponen yang paling penting dan menentukan dalam pelaksanaan kegiatan belajar mengajar di perguruan tinggi. Kenyataannya tidak mudah bagi dosen untuk mendapatkan sertifikasi, selain pembatasan kuota proses pengurusannya pun harus melalui sistem birokrasi yang rumit. Oleh karena itu, setiap perguruan tinggi harus memiliki mekanisme dan strategi supaya dosen dengan mudah dan cepat dapat mendapatkan sertifikasi. Upaya yang dapat dilakukan salah satunya dengan membangun sistem informasi yang terintegrasi untuk mendukung penyelenggaraan sertifikasi dosen. Sistem informasi tersebut meliputi sistem informasi untuk proses sertifikasi internal yang bertujuan untuk melakukan simulasi proses sertifikasi di lingkungan perguruan tinggi pengusul sehingga dapat mengetahui besarnya peluang dosen yang diusulkan lulus dalam proses sertifikasi eksternal. Setelah lulus sertifikasi internal, panitia sertifikasi dosen pengguruan tinggi pengusul akan meneruskan ke tahap sertifikasi eksternal. Bagi dosen yang belum lulus sertifikasi internal maupun eksternal, sistem informasi ini menyediakan program pembinaan sedangkan untuk dosen yang telah lulus sertifikasi eksternal disediakan program penjaminan mutu dosen, sehingga dosen selalu dapat meningkatkan profesionalismenya mengikuti perkembangan IPTEK. Tahapan yang dilakukan pada pengembangan sistem informasi untuk sertifikasi dosen ini meliputi analisis kebutuhan, desain model proses, pengembangan modul-modul aplikasi dan implementasi serta pengujian sistem. Hasil penelitian ini diharapkan dapat menjadi referensi bagi setiap perguruan tinggi di Indonesia dalam penyelenggaraan sertifikasi dosen.

A FLEXIBLE SUB-BLOCK IN REGION BASED IMAGE RETRIEVAL BASED ON TRANSITION REGION Ahmad Wahyu Rosyadi; Renest Danardono; Siprianus Septian Manek; Agus Zainal Arifin
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

One of the techniques in region based image retrieval (RBIR) is comparing the global feature of an entire image and the local feature of image’s sub-block in query and database image. The determined sub-block must be able to detect an object with varying sizes and locations. So the sub-block with flexible size and location is needed. We propose a new method for local feature extraction by determining the flexible size and location of sub-block based on the transition region in region based image retrieval. Global features of both query and database image are extracted using invariant moment. Local features in database and query image are extracted using hue, saturation, and value (HSV) histogram and local binary patterns (LBP). There are several steps to extract the local feature of sub-block in the query image. First, preprocessing is conducted to get the transition region, then the flexible sub-block is determined based on the transition region. Afterward, the local feature of sub-block is extracted. The result of this application is the retrieved images ordered by the most similar to the query image. The local feature extraction with the proposed method is effective for image retrieval with precision and recall value are 57%.

MULTITHRESHOLDING IN GRAYSCALE IMAGE USING PEA FINDING APPROACH AND HIERARCHICAL CLUSTER ANALYSIS Cahyono Cahyono; Gigih Prasetyo; Adrianus Yoza; Ramadhan Hani
Jurnal Ilmu Komputer dan Informasi Vol 7, No 2 (2014): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Abstract Image segmentation is typically used to distinguish objects that exist in an image. However, it remains difficult to accommodate favourable thresholding in multimodal image histogram problem with specifically desired number of thresholds. This research proposes a novel approach to find thresholds in multimodal grayscale image histogram. This method consists of histogram smoothing, identification of peak(s) and valley(s), and merging process using hierarchical cluster analysis. Using five images that consisted of grayscale and converted-to-grayscale images. This method yields maximum value of accuracy, precision, and recall of 99.93%, 99.75%, and 99.75% respectively. These results are better than the similar peak finding method in multimodal grayscale image segmentation.

BUCKETING STRATEGIES FOR EFFICIENT TRIANGLE DETECTION IN CAM-SYSTEM BASED ON FACETED MODELS Gandjar Kiswanto; Rahmat Widyanto; Priadhana Edi Kresnha
Jurnal Ilmu Komputer dan Informasi Vol 3, No 1 (2010): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Triangleâ€™s checking in 3D faceted models is an essential step in gouging detection and elimination process. To check whether model surface intersects the tool, every triangle in the model has to be checked. Unfortunately, this process takes much time. Since the computer canâ€™t see and doesnâ€™t know which triangles located under the current tool position, then the triangles all over the surface model should be checked. To reduce the time, region checking at every position of tool has to be detected. Triangles that have to be checked are only in that region. The way of creating the region can be done by bucketing. Bucketing process will make some buckets as representation of regions and each bucket will be filled with triangles that lie in the corresponding region. There are several bucketing methods. This paper will explain all methods which have been implemented in the research. Pengecekan segitiga dalam model 3 dimensi berfaset merupakan tahapan penting dalam deteksi gouging dan proses eliminasi. Untuk mengecek apakah permukaan model bersinggungan dengan alat, setiap segitiga pada model harus diperiksa. Akan tetapi, proses ini membutuhkan waktu yang lama. Segitiga-segitiga pada seluruh permukaan model harus diperiksa karena komputer tidak dapat melihat dan tidak mengetahui segitiga mana yang terletak di bawah posisi alat saat ini. Untuk mengurangi konsumsi waktu, pengecekan wilayah pada setiap posisi alat harus dapat dideteksi. Segitiga yang harus diperiksa adalah hanya yang berada pada wilayah tersebut. Cara yang dapat dilakukan untuk menetapkan wilayah adalah dengan menggunakan bucketing. Proses bucketing akan membuat beberapa bucket sebagai representasi dari beberapa wilayah dan setiap bucket akan diisi dengan segittiga yang terletak pada wilayah terkait. Terdapat beberapa metode bucketing. Paper ini akan menjelaskan semua metode yang telah diimplementasikan di dalam riset.

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

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.

PERCEPATAN MOTION ESTIMATION BERBASIS PHASE ONLY CORRELATION DENGAN TEKNIK FULL SEARCH MENGGUNAKAN PARALEL THREADING PADA GPU Rosa A. Asmara; Cahya Rahmad; Anik N. Handayani
Jurnal Ilmu Komputer dan Informasi Vol 3, No 2 (2010): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Penelitian ini menyajikan penggunaan metode Phase Only Correlation (POC) pada motion estimation dengan teknik full search menggunakan Graphical Processing Unit (GPU). Dengan fungsi POC, seseorang dapat melakukan estimasi translasi motion antara dua blok citra referensi dan citra yang diproses. Full Search berbasis POC adalah algoritma yang membutuhkan waktu proses lama. Hal ini menyebabkan sistem yang dicoba pada penelitian ini memproses fungsi POC pada Graphical Processing Unit (GPU) yang memiliki kelebihan dalam menyelesaikan perhitungan bilangan floating point dibandingkan CPU. Evaluasi dilakukan dengan menghitung kecepatan waktu proses menggunakan GPU pada video resolusi tinggi dengan resolusi hingga 1280x720 pixel. Hasil pengujian menunjukkan bahwa metode yang diselesaikan menggunakan GPU memiliki percepatan hingga hampir dua kali lipat pada ukuran blok POC 256 x 256 daripada menggunakan CPU. This research presents a method using Phase Only Correlation (POC) on the motion estimation with full search technique using the Graphical Processing Unit (GPU). With POC function, someone can estimate the translational motion between two blocks of the reference image and the processed image. POC based Full Search is an algorithm that takes long time process. This leads the system that is used in this research to process the POC function on Graphical Processing Unit (GPU) which has advantages in solving the floating point calculations than the CPU. Evaluation is conducted by calculating the speed of processing time using a GPU on a high-resolution video with resolutions up to 1280x720 pixels. The test results show that the method that is solved using GPU has an acceleration up to nearly twice the size of the POC block 256 x 256 instead of using the CPU.

MULTISPECTRAL DORSAL HAND VEIN RECOGNITION BASED ON LOCAL LINE BINARY PATTERN Fransisca J Pontoh; Jayanti Yusmah Sari; Amil A Ilham; Ingrid Nurtanio
Jurnal Ilmu Komputer dan Informasi Vol 11, No 2 (2018): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information
Publisher : Faculty of Computer Science - Universitas Indonesia

Nowadays, dorsal hand vein recognition is one of the most recent multispectral biometrics technologies used for the person identification/authentication. Looking into another biometrics system, dorsal hand vein biometrics system has been popular because of the privilege: false duplicity, hygienic, static, and convenient. The most challenging phase in a biometric system is feature extraction phase. In this research, feature extraction method called Local Line Binary Pattern (LLBP) has been explored and implemented. We have used this method to our 300 dorsal hand vein images obtained from 50 persons using a low-cost infrared webcam. In recognition step, the adaptation fuzzy k-NN classifier is to evaluate the efficiency of the proposed approach is feasible and effective for dorsal hand vein recognition. The experimental result showed that LLBP method is reliable for feature extraction on dorsal hand vein recognition with a recognition accuracy up to 98%.

ALGORITMA KOMPRESI FRAKTAL SEQUENTIAL DAN PARALEL UNTUK KOMPRESI CITRA Lely Hiryanto; Satrya N. Ardhytia
Jurnal Ilmu Komputer dan Informasi Vol 3, No 2 (2010): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information)
Publisher : Faculty of Computer Science - Universitas Indonesia

Kompresi citra adalah proses mengurangi ukuran dari citra dengan mengurangi kualitas dari citra tersebut. Metode Fraktal yang digunakan bekerja dengan mencari kemiripan pada piksel-piksel citra dan mengelompokkannya dalam beberapa cluster. Semakin tinggi tingkat kemiripan pada citra, rasio kompresi akan semakin baik. Pada citra berwarna (RGB) metode tersebut diulang sebanyak tiga kali, masing-masing untuk satu elemen warna. Hasil akhir dari proses kompresi adalah tiga virtual codebook, masing-masing untuk satu elemen warna, yang menyimpan nilai dari brightness, contrast, dan tipe transformasi affine yang digunakan untuk tiap cluster. Proses dekompresi dari metode ini adalah dengan membentuk citra kosong dengan resolusi yang sama dengan citra asli dan mengisikan nilai RGB pada tiap piksel yang bersangkutan dengan menghitung nilai yang tersimpan pada virtual codebook. Dengan menggunakan nilai Coefficient of Variation (CV) sebagai penyesuaian nilai standar deviasi dan 57 citra BMP24-bit, hasil pengujian menunjukkan rasio kompresi rata-rata sebesar 41.79%. Dengan metode paralel yang digunakan, proses kompresi citra berwarna menunjukkan rata-rata nilai speed-up sebesar 1.69 dan nilai efisiensi prosesor sebesar 56.34%. Image compression is a process of reducing the size of the image by reducing the quality of the image. Fractal method is used to work by searching for similarities in the image pixels, and group them in clusters. The higher the degree of resemblance to the image, the better the compression ratio. In the color image (RGB) the method is repeated three times, each for one color element.The end result of the compression process is a three virtual codebook, each for one color element, which stores the value of the brightness, contrast, and the type of affine transformation are used for each cluster. Decompression process of this method is to form a blank image with the same resolution with the original image and fill in the RGB values at each pixel corresponding to the count value stored in the virtual codebook.By using the Coefficient of Variation (CV) as an adjustment value and standard deviation of 57 pieces of 24-bit BMP images, test results showed an average compression ratio of 41.79%. With the parallel method is used, the compression process of color image shows the average speed-up values of 1.69 and the processor efficiency of 56.34%.

Page 14 of 26 | Total Record : 257

12 13 14 15 16

Filter by Year

2009 2026

Filter By Issues

Home Page

OAI Link

Editorial Team

Contact

Reviewer

Google Scholar

Contact Name
Nurul Fazriah

Contact Email
jiki@cs.ui.ac.id

Phone
+62217863419

Journal Mail Official
jiki@cs.ui.ac.id

Editorial Address
"Faculty of Computer Science Universitas Indonesia Kampus Baru UI Depok - 16424"

Location
Kota depok,

Jawa barat

INDONESIA

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Home Page

OAI Link

Editorial Team

Contact

Reviewer

Google Scholar

Contact Name Nurul Fazriah

Contact Email jiki@cs.ui.ac.id

Phone +62217863419

Journal Mail Official jiki@cs.ui.ac.id

Editorial Address "Faculty of Computer Science Universitas Indonesia Kampus Baru UI Depok - 16424"

Location Kota depok, Jawa barat INDONESIA

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Contact Name
Nurul Fazriah

Contact Email
jiki@cs.ui.ac.id

Phone
+62217863419

Journal Mail Official
jiki@cs.ui.ac.id

Editorial Address
"Faculty of Computer Science Universitas Indonesia Kampus Baru UI Depok - 16424"

Location
Kota depok,

Jawa barat

INDONESIA