Digital Watermarking Method Based on STFT Histogram

This paper presents a digital audio watermarking method. In the method, watermark has been represented by a form of the histogram for sound power level\u27s distribution in time domain in certain frequency band(s). The relation of four numbers of selected bins in a histogram are changed by a rule of watermark bits assignment. To evaluate the performance of the embedding procedure in each frequency band, the robustness test against several kinds of manipulations or attacks were conducted for some instrumental music sources and harmonic complex tone. Considering the results of robustness test, the performance of multi-band embedding is discussed. Promising results of hearing tests are also presented.9th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2013; Beijing; China; 16 October 2013 through 18 October 201

Image watermarking based on the space/spatial-frequency analysis and Hermite functions expansion

International audienceAn image watermarking scheme that combines Hermite functions expansion and space/spatial-frequency analysis is proposed. In the first step, the Hermite functions expansion is employed to select busy regions for watermark embedding. In the second step, the space/spatial-frequency representation and Hermite functions expansion are combined to design the imperceptible watermark, using the host local frequency content. The Hermite expansion has been done by using the fast Hermite projection method. Recursive realization of Hermite functions significantly speeds up the algorithms for regions selection and watermark design. The watermark detection is performed within the space/spatial-frequency domain. The detection performance is increased due to the high information redundancy in that domain in comparison with the space or frequency domains, respectively. The performance of the proposed procedure has been tested experimentally for different watermark strengths, i.e., for different values of the peak signal-to-noise ratio (PSNR). The proposed approach provides high detection performance even for high PSNR values. It offers a good compromise between detection performance (including the robustness to a wide variety of common attacks) and imperceptibility

Pengaruh Serangan LPF pada Audio Watermarking dengan Metode DWT-Histogram Terhadap Performa BER

Perkembangan teknologi yang pesat membuat kemudahan untuk mengakses data oleh umum sehingga dibutuhkan suatu perlindungan hak cipta guna melindungi hak perihal pemilikan data secara legal. Audio watermarking yang diusulkan menanamkan informasi bit biner ke dalam sebuah media digital berupa audio yang tidak menyebabkan kerusakan pada media yang disisipi informasi. Penelitian ini menggunakan kombinasi metode DWT dan Histogram. Hasil yang diperoleh berupa audio terwatermark yang mempunyai kualitas tinggi dan tidak menimbulkan dampak berati terhadap sinyal informasi yang telah disisipkan dengan menggunakan parameter Bit Error Ratio (BER). Pada penelitian ini, rata-rata BER yang didapat saat dilakukan serangan LPF adalah 0.07952. Sehingga metode ini mempunyai ketahanan yang tinggi. Sedangkan tanpa serangan watermark dapat terekstrak sempurna tanpa kerusakan dengan BER=0

Enhancing steganography for hiding pixels inside audio signals

Multimodal steganography consists of concealing a signal into another one of a different medium, such that the latter is only very slightly distorted and the hidden information can be later recovered. A previous work employed deep learning techniques to this end by hiding an image inside an audio signal's spectrogram in a way that the encoding of one is independent of the other. In this work we explore the way in which images were being encoded previously and present a collection of improvements that produce a significant increase in the quality of the system. These mainly consist in encoding the image in a smarter way such that more information is able to be transmitted in a container of the same size. We also explore the possibility of using the short-time Fourier transform phase as an alternative to the magnitude and to randomly permute the signal to break the structure of the noise. Finally, we report results when using a larger container signal and outline possible directions for future work

Pengaruh Kapasitas Dimensi Citra Watermark terhadap Audio Watermarking dengan Perpaduan Metode DWT (Discrete Wavelet Transform) dan SVD ( Singular Value Decomposition)

Digital audio watermarking dibutuhkan untuk memberi perlindungan dari pembajakan musik secara ilegal dan pemberian hak cipta/kepemilikan. Penelitian ini menjelaskan perpaduan metode audio watermarking dimana informasi berupa hak cipta disisipkan ke dalam sinyal audio. Perpaduan dari metode DWT (Discrete Wavelet Transfrom) dan SVD (Singular Value Decomposition) digunakan untuk menyisipkan dan mengekstrak watermark dari sinyal audio. Informasi atau watermark tersebut dapat berupa gambar hitam putih (biner) atau huruf-huruf karakter ASCII. Pada penelitian ini sebuah gambar dijadikan sebagai watermark dengan berbagai variasi ukuran piksel seperti 10×10, 30×30, 40×40 dan 50×50 piksel. Hasil dari penyisipan watermark yang berukuran 30×30 piksel menghasilkan imperceptibility yang baik dengan nilai rata-rata diantara 43 sampai dengan 50 dB. Hasil eksperimen yang telah dilakukan juga menunjukkan bahwa kombinasi dari kedua metode tahan (robustness) terhadap beberapa serangan seperti amplify, resampling dan invert.AbstractDigital audio watermarking is needed as a protection against online music piracy and copyright issues. This paper describes an audio watermarking combination method where the copyright information is imperceptibly added into the audio signal. The combination of discrete wavelet transform (DWT) and singular value decomposition (SVD) is used to embed and extract the watermark from the audio signal. The copyright information or watermark could be a binary logo or some unique binary patterns. In this paper, a watermarked image is divided into four different capacities of dimension such as 10×10, 30×30, 40×40 and 50×50 pixels. The results of the watermarked image are imperceptibly added into the audio signal and image with 30×30 pixel dimension has the best mean result ranged from 43 to 50 dB. The experiment result also shows that the combination of DWT and SVD is robust against different attacks such as amplify, resampling and invert.

SIMULASI DAN ANALISIS PENCARI REFF DAN VERSE LAGU PADA MUSIK DIGITAL DENGAN METODE KORELASI

ABSTRAK Perkembangan teknologi dimasa globalisasi saat ini terutama tekonologi komunikasi dan informasi yang berbasiskan komputer berkembang sangat pesat, dan teknologi menjadi kebutuhan masyarakat dunia. Hal ini disebabkan oleh perkembangan yang cepat pada bidang teknologi telekomunikasi. Pengolahan sinyal informasi merupakan salah satu bagian dari teknologi telekomunikasi. Pengolahan sinyal informasi ini mencakup luas, salah satunya adalah mengidentifikasi sinyal informasi pada lagu. Lagu dijadikan sebagai objek yang utama, dikarenakan perkembangan musik yang begitu pesat juga. Pada penelitian sebelumnya mencoba dibuat suatu aplikasi menentukan sebuah judul lagu dengan memanfaatkan ekstraksi ciri., Penelitian tersebut merekam lagu dari awal sampai akhir untuk mendapatkan sebuah judul. Namun sistem tersebut masih secara manual untuk menentukan bagian mana verse dan reff lagu. Maka dari itu, peneliti yang mengerjakan tugas akhir saat ini, akan mengembangkan potensi baru, dimana akan mencari reff dan verse lagu selanjutnya secara otomatis, dengan syarat mendengar bagian pertama dari lagu tersebut. Dengan memanfaatkan perkembangan audio processing yang sangat membantu dalam perkembangan industri musik digital , sistem yang akan dibuat menggunakan lagu sebagai input yang kemudian dilakukan pencarian untuk menentukan kesamaan jarak antara panjang pola yang sama denngan menggunakan metode Korelasi. Setelah pengujian dengan skenario yang berbeda pada sistem yang dirancang maka diperoleh beberapa akurasi. Pengujian skenario dilakukan pada ukuran frame 250ms, 500ms, 750ms, 1000ms, dan 2000ms. Dari hasil yang telah diuji, sistem menghasilkan akurasi yang baik pada ukuran frame 1000ms dan 2000ms dengan nilai mencapai 92%. Dan waktu komputasi yang baik terdapat pada ukuran frame 2000ms dengan waku ekstraksi ciri 2,9 detik dan waktu proses pencarian verse dan reff lagu 4 detik. Kata Kunci : Reff Lagu, Verse Lagu, Korelas

Lossless and low-cost integer-based lifting wavelet transform

Discrete wavelet transform (DWT) is a powerful tool for analyzing real-time signals, including aperiodic, irregular, noisy, and transient data, because of its capability to explore signals in both the frequency- and time-domain in different resolutions. For this reason, they are used extensively in a wide number of applications in image and signal processing. Despite the wide usage, the implementation of the wavelet transform is usually lossy or computationally complex, and it requires expensive hardware. However, in many applications, such as medical diagnosis, reversible data-hiding, and critical satellite data, lossless implementation of the wavelet transform is desirable. It is also important to have more hardware-friendly implementations due to its recent inclusion in signal processing modules in system-on-chips (SoCs). To address the need, this research work provides a generalized implementation of a wavelet transform using an integer-based lifting method to produce lossless and low-cost architecture while maintaining the performance close to the original wavelets. In order to achieve a general implementation method for all orthogonal and biorthogonal wavelets, the Daubechies wavelet family has been utilized at first since it is one of the most widely used wavelets and based on a systematic method of construction of compact support orthogonal wavelets. Though the first two phases of this work are for Daubechies wavelets, they can be generalized in order to apply to other wavelets as well. Subsequently, some techniques used in the primary works have been adopted and the critical issues for achieving general lossless implementation have solved to propose a general lossless method. The research work presented here can be divided into several phases. In the first phase, low-cost architectures of the Daubechies-4 (D4) and Daubechies-6 (D6) wavelets have been derived by applying the integer-polynomial mapping. A lifting architecture has been used which reduces the cost by a half compared to the conventional convolution-based approach. The application of integer-polynomial mapping (IPM) of the polynomial filter coefficient with a floating-point value further decreases the complexity and reduces the loss in signal reconstruction. Also, the “resource sharing” between lifting steps results in a further reduction in implementation costs and near-lossless data reconstruction. In the second phase, a completely lossless or error-free architecture has been proposed for the Daubechies-8 (D8) wavelet. Several lifting variants have been derived for the same wavelet, the integer mapping has been applied, and the best variant is determined in terms of performance, using entropy and transform coding gain. Then a theory has been derived regarding the impact of scaling steps on the transform coding gain (GT). The approach results in the lowest cost lossless architecture of the D8 in the literature, to the best of our knowledge. The proposed approach may be applied to other orthogonal wavelets, including biorthogonal ones to achieve higher performance. In the final phase, a general algorithm has been proposed to implement the original filter coefficients expressed by a polyphase matrix into a more efficient lifting structure. This is done by using modified factorization, so that the factorized polyphase matrix does not include the lossy scaling step like the conventional lifting method. This general technique has been applied on some widely used orthogonal and biorthogonal wavelets and its advantages have been discussed. Since the discrete wavelet transform is used in a vast number of applications, the proposed algorithms can be utilized in those cases to achieve lossless, low-cost, and hardware-friendly architectures

Data Encryption and Hashing Schemes for Multimedia Protection

There are millions of people using social networking sites like Facebook, Google+, and Youtube every single day across the entire world for sharing photos and other digital media. Unfortunately, sometimes people publish content that does not belong to them. As a result, there is an increasing demand for quality software capable of providing maximum protection for copyrighted material. In addition, confidential content such as medical images and patient records require high level of security so that they can be protected from unintended disclosure, when transferred over the Internet. On the other hand, decreasing the size of an image without significant loss in quality is always highly desirable. Hence, the need for efficient compression algorithms. This thesis introduces a robust method for image compression in the shearlet domain. Motivated by the outperformance of the Discrete Shearlet Transform (DST) compared to the Discrete Wavelet Transform (DWT) in encoding the directional information in images, we propose a DST-based compression algorithm that provides not only a better quality in terms of image approximation and compression ratio, but also increases the security of images via the Advanced Encryption Standard. Experimental results on a slew of medical images illustrate an improved performance in image quality of the proposed approximation approach in comparison to DWT, and also demonstrate its robustness against a variety of tests, including randomness, entropy, key sensitivity, and input sensitivity. We also present a 3D mesh hashing technique using spectral graph theory. The main idea is to partition a 3D model into sub-meshes, followed by the generation of the Laplace-Beltrami matrix of each sub-mesh, and the application of eigen-decomposition. This, in turn, is followed by the hashing of each sub-mesh using Tsallis entropy. The experimental results using a benchmark 3D models demonstrate the effectiveness of the proposed hashing scheme