A New Copyright Protection for Vector Map using FFT-based Watermarking

Neyman, Shelvie Nidya; Pradnyana, I Nyoman Prama; Sitohang, Benhard

doi:10.12928/telkomnika.v12i2.49

Cited by 19 publications

(13 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As shown in Fig. 4, this is achieved using the discrete cosine transform (DCT), discrete wavelet transform (DWT), discrete Fourier transform, or fast Fourier transform (FFT) [20][21][22]. Following this, the watermark insertion phase begins, which is achieved by changing coefficients within the cover work to produce a transformed, watermarked version of the cover work.…”

Section: Watermarking Techniquesmentioning

confidence: 99%

A Watermarking System Architecture using the Cellular Automata Transform for 2D Vector Map

AL-ardhi¹,

Thayananthan²,

Basuhail³

2019

IJACSA

View full text Add to dashboard Cite

Technological advancement, paired with the emergence of increasingly open and sophisticated communication systems, has contributed to the growing complexity of copyright protection and ownership identification for digital content. The technique of digital watermarking has been receiving attention in the literature as a way to address these complexities. Digital watermarking involves covertly embedding a marker in a piece of digital data (e.g., a vector map, database, or audio, image, or video data) such that the marker cannot be edited, does not interfere with the quality or size of the data, and can be extracted accurately even under the deterioration of the watermarked data (e.g., as a consequence of malicious activity). The purpose of this paper is to describe a watermarking system architecture that can be applied to a 2D vector map. The proposed scheme involves embedding the watermark into the frequency domain, namely, the linear cellular automata transform (LCAT) algorithm. To evaluate the performance of the proposed scheme, the algorithm was applied to vector maps from the Riyadh Development Authority. The results indicate that the watermarking system architecture described here is efficient in terms of its computational complexity, reversibility, fidelity, and robustness against well-known attacks.

show abstract

Section: Watermarking Techniquesmentioning

confidence: 99%

A Watermarking System Architecture using the Cellular Automata Transform for 2D Vector Map

AL-ardhi¹,

Thayananthan²,

Basuhail³

2019

IJACSA

View full text Add to dashboard Cite

show abstract

“…The Fast Fourier Transform is an enhancement algorithm of Discrete Fourier Transform (DFT), in which FFT can calculate discrete Fourier algorithms with relatively low complexity and fast calculation times. For the formula change the signal from time domain to frequency domain is as follows (Neyman, Pradnyana, & Sitohang, 2014):…”

Section: Lifting Wavelet Transform (Lwt)mentioning

confidence: 99%

“…As for the formula of Inverse-FFT change the signal back from frequency domain to time domain is as follows (Neyman et al, 2014):…”

Section: Lifting Wavelet Transform (Lwt)mentioning

confidence: 99%

Image Hiding on Audio Subband Based On Centroid in Frequency Domain

2019

View full text Add to dashboard Cite

Audio watermarking adalah mekanisme penyembunyian data pada audio. Metode penyembunyian data yang digunakan dalam penulisan ini adalah Lifting Wavelet Transform (LWT), Fast Fourier Transform (FFT), Centroid dan Quantization Index Modulation (QIM). Langkah pertama adalah host audio tersegmentasi menjadi beberapa frame. Kemudian sub-band terpilih diubah oleh FFT dengan mengubah domain sub-band dari waktu ke frekuensi. Proses centroid digunakan untuk menemukan titik pusat frekuensi untuk lokasi penyisipan untuk mendapatkan output yang lebih stabil. Proses penyematan dilakukan dengan QIM. Kinerja watermarking oleh parameter yang disesuaikan memperoleh nilai imperceptibility dengan Signal to Noise Ratio (SNR) > 21 dB, Mean Opinion Score (MOS)> 3.8 dengan kapasitas = 86.13 bps. Selain itu, untuk sebagian besar file audio terwatermark yang diserang, metode ini tahan terhadap beberapa serangan seperti Low Pass Filter (LPF) dengan fco> 6 kHz, Band Pass Filter (BPF) dengan fco 50 Hz-6 kHz, Linear Speed Change (LSC) dan MP4 Compression dengan Bit Error Rate (BER) kurang dari 20%.

show abstract

“…Juniawan [5] produced an Android-based e-voting BEM security application using RSA. Neyman et al [6] protected the copyright markers in vector maps using the FFT algorithm. Kridalaksana et al [7] produced a security SMS using the AES 128-bit algorithm.…”

Section: Introductionmentioning

confidence: 99%

SMS Security Improvement using RSA in Complaints Application on Regional Head Election’s Fraud

Sylfania¹,

Juniawan²,

Laurentinus³

et al. 2019

Jurnal Teknologi dan Sistem Komputer

View full text Add to dashboard Cite

In the campaign period of regional heads election, fraud can occur, such as money politics, blaming campaign facilities, campaign time violations, and black campaign. This study implemented a secure SMS application for election fraud complaints as a tool for the society to report all forms of election fraud that have occurred to the election supervisory department safely. The RSA algorithm was applied to encrypt the messages for sender privacy protection. The application was able to perform the message randomization function properly with a 10.44% avalanche effect. Brute force attack using a 16-bit key length needs 3.7 milliseconds for each try to find 32.768 possible private keys.

show abstract

A New Copyright Protection for Vector Map using FFT-based Watermarking

Abstract: This study proposed a new approach of copyright protection for vector map

Cited by 19 publications

References 21 publications

A Watermarking System Architecture using the Cellular Automata Transform for 2D Vector Map

A Watermarking System Architecture using the Cellular Automata Transform for 2D Vector Map

Image Hiding on Audio Subband Based On Centroid in Frequency Domain

SMS Security Improvement using RSA in Complaints Application on Regional Head Election’s Fraud

Contact Info

Product

Resources

About