cover
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
Jurnal Informatika
ISSN : -     EISSN : -     DOI : -
Core Subject : Science,
Arjuna Subject : -
Articles 5 Documents
Search results for , issue "Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika" : 5 Documents clear
PENERAPAN ALGORITMA K-MEANS PADA KOMPRESI ADAPTIF CITRA MEDIS MRI I Wayan Angga Wijaya; Afriliana Kusumadewi
Jurnal Informatika Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (323.404 KB) | DOI: 10.21460/inf.2015.112.450

Abstract

MRI medical image processing require large amounts of memory. Due to limited bandwidth and storage capacity, the image must be compressed prior to transmission and stored. This paper has the objective to implement the algorithm k means the MRI medical image compression. Implementation begins with the Pre post. At this stage, L-dimensional vector of the image will be made. L is the block - a measure used for clustering technique, but is set back in the form of an array. Then the process of clustering. At this stage, every pixel of the image is represented by the centroid of the cluster. And the last stage is the Main Compression, the pixels that do not contain important information will be removed. The study compared the quality of the original image and compressed image. Based on manual observation, there is no significant difference in quality between the original image and the compressed one.
PERBANDINGAN ALGORITMA SHORTEST PATH DALAM PEMROSESAN CITRA DIGITAL SEAM CARVING Florentinus Alvin Sebastian; R. Gunawan Santosa; Theresia Herlina R.
Jurnal Informatika Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (479.51 KB) | DOI: 10.21460/inf.2015.112.449

Abstract

Seam carving is a method of content aware image resizing. As solutions shortest path algorithms are used to find images seams. Seam is a horizontal or vertical path of an image that has minimum energy. There are two (2) shortest path algorithms that will be discussed in this paper. This paper contains the results of shortest path algorithms comparison between Dijkstra and Directed Acyclic Graph to see which one is better than another in case of efficiency. The precomputed and recomputed methods will be compared to find the more efficient method for executing the seam carving transformation. A web application has been built for this purpose. This web app is capable of transforming image size with seam carving method. The complexity of Dijkstra and Acyclic will be compared to find which one is better. The result is Dijkstra has been won, with the O(4V) with Acyclicis O(5V). The use of precomputed and recomputed is evaluated by the conditions. If the preparation is evaluated then recomputed is more efficient, but if the preparation is not evaluated then the precomputed method is the better one and has faster performance. 
PENGGUNAAN MOMEN INVARIANT, ECCENTRICITY, DAN COMPACTNESS UNTUK KLASIFIKASI MOTIF BATIK DENGAN K-NEAREST NEIGHBOUR Nugroho Agus Haryono; Widi Hapsari; Angelique Angesti; Stheffany Felixiana
Jurnal Informatika Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (383.395 KB) | DOI: 10.21460/inf.2015.112.411

Abstract

Batik classification which have diverse motifs need to be done to distinguish a pattern with another. In this paper, we present batik motifs(Ceplok, Parang, Semen, and Nitik) classification using Hu Moment Invariants, Eccentricity, and Compactness feature description. In classification stage, K-nearest neighbor have been used, which is traditional nonparametric statistical classifier. Set of different experiments on binary images regular, opening image, and closing image of 200 images Batik from some batik literature published by Dinas Perindustrian, Perdagangan, dan Koperasi DIY have been done and variety of results have been presented. The results showed that the best classification result obtained from Hu Moment Invariants feature description.
TRANSFORMASI HOUGH LINEAR UNTUK ANALISIS DAN PENGENALAN BATIK MOTIF PARANG Widi Hapsari
Jurnal Informatika Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (240.141 KB) | DOI: 10.21460/inf.2015.112.412

Abstract

Batik is a craft that has high artistic value. Batik also has become part of Indonesian culture (especially Java) since long. There are so many designs old patterns of Batik. One of traditional batik motif is Parang. Batik Parang have decorative striped pattern and lined tilted. This research analizes characteristic of batik Parang and develops a software to automatically identify motifs of batik Parang image using line feature extraction. The pattern can be identified through a group of points that form the edge of a line and then detected as a line using Hough transform. The research material was 50 image of the sample data and 30 image of research datarespectivelyParang and non Parang. Both the accuracy of Batik Parang and non Parang recognition are 90%.
IMPLEMENTASI PERMAINAN FLOW PADA PEMBANGUNAN SISTEM CAPTCHA Indra Setiawan; Willy Sudiarto Raharjo; Budi Susanto
Jurnal Informatika Vol 11, No 2 (2015): Jurnal Teknologi Komputer dan Informatika
Publisher : Universitas Kristen Duta Wacana

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (312.241 KB) | DOI: 10.21460/inf.2015.112.448

Abstract

The basic challenge in designing an obfuscating CAPTCHAs is to make them easy enough that users are not dissuaded from attempting a solution, yet still too difficult to solve using available image-based computer vision algorithms. CAPTCHA has been widely used in many web applications and there has been so many research on CAPTCHA. Current technology enables computer to easily solve image-based CAPTCHA with high probability, so we propose another type of CAPTCHA-based authenticaton that can not be solved by utilizing Optical Character Recognition but still easy to use for new users. We implemented the new model of CAPTCHA using FLOW game. We found that the success rate of this new system is 92.025%, completion time is 6.3614s, and 81,67% of users are able to solve it in less than 10s.

Page 1 of 1 | Total Record : 5