• Title/Summary/Keyword: embedding scheme

Search Result 191, Processing Time 0.023 seconds

An adaptive watermarking for remote sensing images based on maximum entropy and discrete wavelet transformation

  • Yang Hua;Xu Xi;Chengyi Qu;Jinglong Du;Maofeng Weng;Bao Ye
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.1
    • /
    • pp.192-210
    • /
    • 2024
  • Most frequency-domain remote sensing image watermarking algorithms embed watermarks at random locations, which have negative impact on the watermark invisibility. In this study, we propose an adaptive watermarking scheme for remote sensing images that considers the information complexity to select where to embed watermarks to improve watermark invisibility without affecting algorithm robustness. The scheme converts remote sensing images from RGB to YCbCr color space, performs two-level DWT on luminance Y, and selects the high frequency coefficient of the low frequency component (HHY2) as the watermark embedding domain. To achieve adaptive embedding, HHY2 is divided into several 8*8 blocks, the entropy of each sub-block is calculated, and the block with the maximum entropy is chosen as the watermark embedding location. During embedding phase, the watermark image is also decomposed by two-level DWT, and the resulting high frequency coefficient (HHW2) is then embedded into the block with maximum entropy using α- blending. The experimental results show that the watermarked remote sensing images have high fidelity, indicating good invisibility. Under varying degrees of geometric, cropping, filtering, and noise attacks, the proposed watermarking can always extract high identifiable watermark images. Moreover, it is extremely stable and impervious to attack intensity interference.

Doping-free Transparent Conducting Schottky Type Heterojunction Solar Cells

  • Kim, Joon-Dong
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2012.02a
    • /
    • pp.209-209
    • /
    • 2012
  • High-efficient transparent conductive oxide (TCO) film-embedding Si heterojunction solar cells were fabricated. An additional doping was not applied for heterojunction solar cells due to the spontaneous junction formation between TCO films and an n-type Si substrate. Three different TCO coatings were formed by sputtering method for an Al-doped ZnO (AZO) film, an indium-tin-oxide (ITO) film and double stacks of ITO/AZO films. An improved crystalline ITO film was grown on an AZO template upon hetero-epitaxial growth. This double TCO films-embedding Si heterojunction solar cell provided significantly enhanced efficiency of 9.23% as compared to the single TCO/Si devices. The effective arrangement of TCO films (ITO/AZO) provides benefits of a lower front contact resistance and a smaller band offset to Si leading enhanced photovoltaic performances. This demonstrates a potential scheme of the effective TCO film-embedding heterojunction Si solar cells.

  • PDF

A Watermarking Scheme of Lowest Frequency Band Based on the Quad-Tree Algorithm (쿼드트리 알고리즘과 최저주파수대역을 이용한 워터마킹 기법)

  • Jeong, Byong-Soo;Chu, Hyung-Suk;Shin, Soung-Wook;An, Chong-Koo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.11
    • /
    • pp.2027-2032
    • /
    • 2007
  • In this paper, digital watermarking method using quad-tree algorithm and the lowest frequency band is proposed. The proposed algorithm searches the coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation of the proposed algorithm is implemented about the effect of various weight factors in Cox's algorithm, that of embedding watermark in each subband coefficient (HH, LH, HL), and that of embedding in the lowest frequency band (LL). As a simulation result, the bigger weight factors in Cox's algorithm show strong to noise. The watermarking performance of simultaneously embedding in HH, LH, and HL band is better than that of different cases. In addition, insertion the watermark to the LL band about $30{\sim}60%$ of all watermarks improves the watermarking performance in comparison with the case of not using the LL band.

Data Hiding using Improving Hamming Code (성능을 개선한 해밍 코드 기법을 이용한 데이터 은닉)

  • Kim, Cheonshik
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.8
    • /
    • pp.180-186
    • /
    • 2013
  • The primary goal of attack on steganographic images, termed steganalysis, is to detect the presence of hidden data by finding statistical abnormality of a stego-media caused by data embedding. This paper proposes a novel steganographic scheme based on improving the (7, 4) Hamming code for digital images. The proposed scheme embeds a segment of six secret bits into a group of nine cover pixels at a time. The experimental results show that the proposed scheme achieves a 0.67bpp embedding payload and a slightly higher visual quality of stego images compared with the previous arts.

Block Based Blind & Secure Gray Image Watermarking Technique Based on Discrete Wavelet Transform and Singular Value Decomposition

  • Imran, Muhammad;Harvey, Bruce A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.883-900
    • /
    • 2017
  • In this paper block based blind secure gray image watermarking scheme based on discrete wavelet transform and singular value decomposition is proposed. In devising the proposed scheme, security is given high importance along with other two requirements: robustness and imperceptibility. The use of discrete wavelet transform not only improves robustness but the selection of bands with high tolerance towards noise caused an improvement in terms of imperceptibility. The robustness further improved due to the involvement of singular vectors along with singular values in watermark embedding and extraction process. Finally, to achieve security, the selected DWT band is decomposed into smaller blocks and random blocks are chosen for modification. Furthermore, the elements of left and right singular vectors of selected blocks are chosen based on their dependence upon each other for watermark embedding. Various experiments using different images as host and watermark were conducted to examine and validate the proposed technique. Additionally, the proposed technique is tested against various attacks like compression, affine transformation, cropping, translation, X shearing, scaling, Y shearing, filtering, blurring, different kinds of noises, histogram equalization, rotation, etc. Lastly, the proposed technique is compared with state-of-the-art watermarking techniques and their comparison shows significant improvement of proposed scheme over existing techniques.

Design of a Recommendation System for Improving Deep Neural Network Performance

  • Juhyoung Sung;Kiwon Kwon;Byoungchul Song
    • Journal of Internet Computing and Services
    • /
    • v.25 no.1
    • /
    • pp.49-56
    • /
    • 2024
  • There have been emerging many use-cases applying recommendation systems especially in online platform. Although the performance of recommendation systems is affected by a variety of factors, selecting appropriate features is difficult since most of recommendation systems have sparse data. Conventional matrix factorization (MF) method is a basic way to handle with problems in the recommendation systems. However, the MF based scheme cannot reflect non-linearity characteristics well. As deep learning technology has been attracted widely, a deep neural network (DNN) framework based collaborative filtering (CF) was introduced to complement the non-linearity issue. However, there is still a problem related to feature embedding for use as input to the DNN. In this paper, we propose an effective method using singular value decomposition (SVD) based feature embedding for improving the DNN performance of recommendation algorithms. We evaluate the performance of recommendation systems using MovieLens dataset and show the proposed scheme outperforms the existing methods. Moreover, we analyze the performance according to the number of latent features in the proposed algorithm. We expect that the proposed scheme can be applied to the generalized recommendation systems.

A Proactive Secret Image Sharing Scheme over GF(28) (유한 체상에서의 사전 비밀이미지 공유 기법)

  • Hyun, Suhng-Ill;Shin, Sang-Ho;Yoo, Kee-Young
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.5
    • /
    • pp.577-590
    • /
    • 2013
  • Shamir's (k,n)-threshold secret sharing scheme is not secure against cheating by attacker because the signature of participants is omitted. To prevent cheating, many schemes have been proposed, and a proactive secret sharing is one of those. The proactive secret sharing is a method to update shares in the secret sharing scheme at irregular intervals. In this paper, a proactive image secret sharing scheme over $GF(2^8)$ is proposed for the first time. For the past 30 years, Galois field operation is widely used in order to perform the efficient and secure bit operation in cryptography, and the proposed scheme with update phase of shadow image over $GF(2^8)$) at irregular intervals provides the lossless and non-compromising of secret image. To evaluate security and efficiency of images (i.e. cover and shadow images) distortion between the proposed scheme and the previous schemes, embedding capacity and PSNR are compared in experiments. The experimental results show that the performances of the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.

Review on Self-embedding Fragile Watermarking for Image Authentication and Self-recovery

  • Wang, Chengyou;Zhang, Heng;Zhou, Xiao
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.510-522
    • /
    • 2018
  • As the major source of information, digital images play an indispensable role in our lives. However, with the development of image processing techniques, people can optionally retouch or even forge an image by using image processing software. Therefore, the authenticity and integrity of digital images are facing severe challenge. To resolve this issue, the fragile watermarking schemes for image authentication have been proposed. According to different purposes, the fragile watermarking can be divided into two categories: fragile watermarking for tamper localization and fragile watermarking with recovery ability. The fragile watermarking for image tamper localization can only identify and locate the tampered regions, but it cannot further restore the modified regions. In some cases, image recovery for tampered regions is very essential. Generally, the fragile watermarking for image authentication and recovery includes three procedures: watermark generation and embedding, tamper localization, and image self-recovery. In this article, we make a review on self-embedding fragile watermarking methods. The basic model and the evaluation indexes of this watermarking scheme are presented in this paper. Some related works proposed in recent years and their advantages and disadvantages are described in detail to help the future research in this field. Based on the analysis, we give the future research prospects and suggestions in the end.

A Synchronization Scheme Based on Moving Average for Robust Audio Watermarking

  • Zhang, Jinquan;Han, Bin
    • Journal of Information Processing Systems
    • /
    • v.15 no.2
    • /
    • pp.271-287
    • /
    • 2019
  • The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

A Reversible Audio Watermarking Scheme

  • Kim, Hyoung-Joong;Sachnev, Vasiliy;Kim, Ki-Seob
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.5 no.1
    • /
    • pp.37-42
    • /
    • 2006
  • A reversible audio watermarking algorithm is presented in this paper. This algorithm transforms the audio signal with the integer wavelet transform first in order to enhance the correlation between neighbor audio samples. Audio signal has low correlation between neighbor samples, which makes it difficult to apply difference expansion scheme. Second, a novel difference expansion scheme is used to embed more data by reducing the size of location map. Therefore, the difference expansion scheme used in this paper theoretically secures high embedding capacity under low perceptual distortion. Experiments show that this scheme can hide large number of information bits and keeps high perceptual quality.

  • PDF