Articles

Found 4 Documents
Search

A New Copyright Marking for Vector Map using FFT-based Watermarking Neyman, Shelvie Nidya; Pradnyana, I Nyoman Prama; Sitohang, Benhard
TELKOMNIKA Telecommunication, Computing, Electronics and Control Vol 12, No 2: June 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

This study proposed a robust watermarking method on FFT transform domain for embedding a copyright on the map vector. In addition to data origin authentication capabilities watermark, RSA cryptographic algorithm used when generating the watermark. Quality measurement of the results of this study was based on the three characteristics of digital watermarking : (1) invisibility using RMSE calculations, (2) fidelity with the farthest distance and NC calculation , and gemotrical level of robustness against attacks. Result of experiments showed that the approach used in this study succeeded in inserting copyright as watermark on vector maps. Invisibility test showed good results , demonstrated by RMSE : below 1 or close to zero . Fidelity of the watermarked map was also maintained. Level of watermark robustness against geometric attacks on vector map results has been maintained within the limits that these attacks do not affect the watermark bit value directly.
A New Copyright Marking for Vector Map using FFT-based Watermarking Neyman, Shelvie Nidya; Pradnyana, I Nyoman Prama; Sitohang, Benhard
TELKOMNIKA Telecommunication, Computing, Electronics and Control Vol 12, No 2: June 2014
Publisher : Universitas Ahmad Dahlan

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

Abstract

This study proposed a robust watermarking method on FFT transform domain for embedding a copyright on the map vector. In addition to data origin authentication capabilities watermark, RSA cryptographic algorithm used when generating the watermark. Quality measurement of the results of this study was based on the three characteristics of digital watermarking : (1) invisibility using RMSE calculations, (2) fidelity with the farthest distance and NC calculation , and gemotrical level of robustness against attacks. Result of experiments showed that the approach used in this study succeeded in inserting copyright as watermark on vector maps. Invisibility test showed good results , demonstrated by RMSE : below 1 or close to zero . Fidelity of the watermarked map was also maintained. Level of watermark robustness against geometric attacks on vector map results has been maintained within the limits that these attacks do not affect the watermark bit value directly.
Teknik Penyembunyian Data Rahasia pada Berkas Gambar Digital Menggunakan Steganografi Least Significant Bit Variable-Size Neyman, Shelvie Nidya; Lindayati, Lindayati; Guritman, Sugi
Jurnal Ilmu Komputer dan Agri-Informatika Vol 1, No 1 (2012)
Publisher : Departemen Ilmu Komputer IPB

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

Abstract

Salah satu teknik pengamanan data dengan cara penyisipan informasi rahasia pada berkas gambar digital sebagai media penampung ialah steganografi berbasis least significant bit (LSB) dengan penambahan kemampuan penyisipan yang bersifat variable-size. Operasi teknik steganografi ini menggunakan tiga parameter, yaitu capacity evaluation untuk menentukan kapasitas maksimum LSB dari masing-masing pixel media penampung, minimum error replacement untuk memperkecil tingkat kesalahan saat penyisipan, dan improved grayscale compensation untuk memisahkan kesalahan penempelan agar tidak berdekatan pada tempat pixel bekerja. Penelitian ini bertujuan mengimplementasikan teknik tersebut untuk menyembunyikan data rahasia pada berkas gambar digital sebagai media penampung dan menghasilkan stego-image dengan kesamaan tampilan dan ukuran berkas. Berkas hasil penyisipan (stego-image) yang diperoleh diharapkan tidak menimbulkan kecurigaan pihak lawan, serta mampu memaksimumkan kapasitas penyisipan data rahasia, dengan memungkinkan penyisipan mencapai bit ke-5 dari LSB media penampung. Hasil penelitian menunjukkan bahwa stego-image yang diperoleh secara visual memiliki tampilan hampir sama dengan media penampungnya dan kapasitas penyisipannya mencapai lebih dari 50% ukuran media penampungnya. Kapasitas ini diperoleh tanpa mempertimbangkan border dan jumlah bit data pada setiap pixel minimal berjumlah empat.Kata kunci: capacity evaluation, improved grayscale compensation, least significant bit variabel-size, steganografi
Bandwidth Allocation Management of Internet Services Using Fractional Knapsack Problem Muttaqi, Ahmad Rizaqu; Wahjuni, Sri; Neyman, Shelvie Nidya
Jurnal Teknologi dan Sistem Komputer Volume 7, Issue 2, Year 2019 (April 2019)
Publisher : Departemen Teknik Sistem Komputer, Fakultas Teknik, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (328.313 KB) | DOI: 10.14710/jtsiskom.7.2.2019.71-76

Abstract

The technical problems faced in e-government implemented by the Ministry of Religion of Indonesia since 2015 are minimal bandwidth requirements to provide information services and behavior of users who access entertainment sites. When peak hours occur, the congested network often occurs which becomes a significant bottleneck. This study aims to implement bandwidth management using the fractional knapsack problem method by limiting access to entertainment services. The QoS parameters used in this management are throughput, delay, and jitter. The method was tested using a paired t-test using throughput, jitter, and delay test parameters by comparing test parameters before and after bandwidth management applied. The significance value produced is between 75-85%. The method used can control the amount of traffic for each service, but on the other, hand the delay and jitter are still high. It is necessary to add additional free space to each service that can be used when needed to reduce the delay and jitter.