• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.73-76
• /
• 2001

In this paper, we utilize a HVS(Human Visual System) watermarking method where watermarks are embedded in a DFT domain. The HVS watermarking method is robust for attacks like JPEC, filtering, noise, etc. But, when images are attacked by basic geometric attacks as cropping, scaling, rotation, a watermarks may not be detected. In this paper, we introduce the HVS watermarking method that inserts references In a domain of LSB(Least Significant Bit) of image. Experimental results show that the proposed method based on HVS watermarking method gives more robustness to the basic geometric attacks compared with original HVS watermarking methods.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1427-1430
• /
• 2003

본 논문에서는 저작권 보호를 위하여 임계값을 이용한 워터마킹 기법을 제안한다 저작권을 보호하기 위하여 원 영상을 웨이블릿 변환하여 얻어진 웨이블렛 계수의 LSB(least significant bit)와 워터마크 영상을 동적 임계값을 적용하여 생성한 4장의 이진영상을 각 주파수 영역 HL1, LH1, HL2, LH2에서 XOR연산을 하여 워터마크를 삽입한다. 화질 열화가 많은 저주파 영역과 손실압축에 약한 고주파 영역을 제외한 영역에 워터마크를 삽입하였다. 실험결과로써, 화질의 열화가 적은 워터마크 삽입영상을 얻을 수 있었으며, 강인하게 워터마크가 추출이 되었다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.697-700
• /
• 2000

워터마크의 실현방법은 크게 두 가지로 나누어지는데, 하나는 공간영역에서 처리방법이고 다른 하나는 주파수영역에서 처리방법이다. 초기에는 공간영역에서 처리가 많이 연구되었으나 공간영역에서의 워터마크 삽입방법은 주로 least significant bit(LSB)을 조작하기 때문에 주파수영역의 방법보다 각종 신호처리에 의해 워터마크가 쉽게 없어지는 단점이 생긴다. 따라서 현재는 그런 단점들을 잘 극복할 수 있는 방법으로 주파수 영역에서의 워터마크 삽입 방법이 많이 쓰인다. 본 논문에서는 디지털 영상을 위한 다해상도 이산 웨이브렛 변환을 사용한 워터마킹 방법을 제안하였다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.3
• /
• pp.163-168
• /
• 2011

In this paper, we proposed non-linear gamma curve algorithm for gamma correction. The previous non-linear gamma curve algorithm is generated by the least square polynomial using the Gauss-Jordan inverse matrix. However, the previous algorithm has some weak points. When calculating coefficients using inverse matrix of higher degree, occurred truncation errors. Also, only if input sample points are existed regular interval on 10-bit scale, the least square polynomial is accurately works. To compensate weak-points, we calculated accurate coefficients of polynomial using eigenvalue and orthogonal value of mat11x from singular value decomposition (SVD) and QR decomposition of vandemond matrix. Also, we used input data part segmentation, then we performed polynomial curve fitting and merged curve fitting results. When compared the previous method and proposed method using the mean square error (MSE) and the standard deviation (STD), the proposed segmented polynomial curve fitting is highly accuracy that MSE under the least significant bit (LSB) error range is approximately $10^{-9}$ and STD is about $10^{-5}$.

• Journal of Korea Multimedia Society
• /
• v.17 no.4
• /
• pp.466-477
• /
• 2014

Many image hiding schemes based on least significant bit (LSB) transformation have been proposed. One of the LSB-based image hiding schemes that employs diamond encoding was proposed in 2008. In this scheme, the binary secret data is converted into base n representation, and the converted secret data is concealed in the cover image. Here, we show that this scheme has two vulnerabilities: noticeable spots in the stego-image, i.e., a non-smooth embedding result, and inefficiency caused by rough re-adjustment of falling-off-boundary value and impractical base translation. Moreover, we propose a new scheme that is efficient and produces a smooth and high quality embedding result by restricting n to power of 2 and using a sophisticated re-adjustment procedure. Our experimental results show that our scheme yields high quality stego-images and is secure against RS detection attack.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.261-270
• /
• 2019

In order to protect secret digital documents against vulnerabilities while communicating, steganography algorithms are applied. It protects a digital file from unauthorized access by hiding the entire content. Pixel-value-difference being a method from spatial domain steganography utilizes the difference gap between neighbor pixels to fulfill the same. The proposed approach is a block-wise embedding process where blocks of variable size are chosen from the cover image, therefore, a stream of secret digital contents is hidden. Least significant bit (LSB) substitution method is applied as an adaptive mechanism and optimal pixel adjustment process (OPAP) is used to minimize the error rate. The proposed application succeeds to maintain good hiding capacity and better signal-to-noise ratio when compared against other existing methods. Any means of digital communication specially e-Governance applications could be highly benefited from this approach.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.4
• /
• pp.243-249
• /
• 2016

This paper proposes a new watermarking algorithm to embed watermarks in thr process of sample adaptive offsets (SAO) for high efficiency video coding (HEVC) compressed videos. The proposed method embeds two-bit watermark into the SAO offsets for each coding tree unit (CTU). To minimize visual quality degradation caused by embedding watermark, watermark bits are embedded into SAO offset depending on the SAO types of block. Furthermore, the embedded watermark can be extracted by simply adding four offsets and checking their least significant bits (LSB) at the decoder side. The experimental results show that the proposed method achieves 0.3% BD-rate increase without much visual quality degradation. Two-bit watermark for each CTU is embedded for more bit watermarking. In addition, the proposed method requires negligible computational load for watermark insertion and extraction.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.1-8
• /
• 2002

Digital image watermarking is a technique for the purpose of protecting the ownership of the image by embedding proprietary watermarks in a digital image. It is required for the digital image watermarking scheme to pursue the robustness against water marking attacks and the perceptual Invisibility more than usual in steganography area, to guarantee not a hidden watermarking algorithm but the publicity of water-marking algorithm details and hidden use of key, which can protect the unauthorized user access from detection. In this paper we propose a new copyright watermarking scheme, which is barred on one-way hash functions using ElGamal functions and modular operations. ElGamal functions are widely used in cryptographic systems. Our watermarking scheme is robust against LSB(least significant bit) attacks and gamma correction attack, and also perceptually invisible. We demonstrate the characteristics of our proposed watermarking scheme through experiments. It is necessary to proceed as the future work the algorithm of achieving at the same time both the pseudo-randomness for the steno-key generation and the asymmetric-key generation.

• Journal of KIISE
• /
• v.44 no.5
• /
• pp.537-544
• /
• 2017

As a special form of the signed-digit representation, the NAF(non-adjacent form) minimizes the hamming weight by reducing the average density of the non-zero bits from the binary representation of the positive integer k. Due to this advantage, the NAF is used in various fields; in particular, it is actively used in cryptology. The existing NAF-conversion algorithm, however, is problematic because the conversion speed decreases when the LSB(least significant bit) frequently becomes "1" during the binary positive integer conversion process. This paper suggests a method for the improvement of the NAF-conversion speed for which the problems that occur in the existing NAF-conversion process are solved. To verify the performance improvement of the algorithm, the CPU cycle for the various inputs were measured on the ATmega128, a low-performance 8-bit microprocessor. The results of this study show that, compared with the existing algorithm, the suggested algorithm not only improved the processing speed of the major patterns by 20% or more on average, but it also reduced the NAF-conversion time by 13% or more.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.143-151
• /
• 2021

The enormous prevalence of transferring official confidential digital documents via the Internet shows the urgent need to deliver confidential messages to the recipient without letting any unauthorized person to know contents of the secret messages or detect there existence . Several Steganography techniques such as the least significant Bit (LSB), Secure Cover Selection (SCS), Discrete Cosine Transform (DCT) and Palette Based (PB) were applied to prevent any intruder from analyzing and getting the secret transferred message. The utilized steganography methods should defiance the challenges of Steganalysis techniques in term of analysis and detection. This paper presents a novel and robust framework for color image steganography that combines Linear Congruential Generator (LCG), simulated annealing (SA), Cesar cryptography and LSB substitution method in one system in order to reduce the objection of Steganalysis and deliver data securely to their destination. SA with the support of LCG finds out the optimal minimum sniffing path inside a cover color image (RGB) then the confidential message will be encrypt and embedded within the RGB image path as a host medium by using Cesar and LSB procedures. Embedding and extraction processes of secret message require a common knowledge between sender and receiver; that knowledge are represented by SA initialization parameters, LCG seed, Cesar key agreement and secret message length. Steganalysis intruder will not understand or detect the secret message inside the host image without the correct knowledge about the manipulation process. The constructed system satisfies the main requirements of image steganography in term of robustness against confidential message extraction, high quality visual appearance, little mean square error (MSE) and high peak signal noise ratio (PSNR).