• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.3
• /
• pp.464-469
• /
• 2002

In this research, nonvisibility and robustness of image watermarking mixed Key and Logo method were evaluated. The role of the Key was performed by a personal ID of a copyrighter and the logo images were used as the watermark. The standard image of Lena was used for experimental image and binary images of `Park'with size 32${\times}$32 and 64${\times}$64 were used for the watermark, respectively In order to evaluate nonvisibility of the proposed watermarking scheme, PSNR(Peak Signal to Noise Ratio) of the watermarked image was obtained and for robustness reconstructive rates of the reconstructed watermark were obtained from the watermarked image with image transformation of JPEG lossy compression. The experimental results show that nonvisibility is excellent as PSNR of the watermarked image is 93.75dB and the reconstructive rates of the case of 322${\times}$32 watermark was better than the case of the 64${\times}$64 watermark; average 5.9%, 13.9%, 6.5%, and 4.2% in the case of scale-down rates, rotational rates, impulse noise power density, and JPEG lossy compression rates, respectively.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.31-37
• /
• 2015

The security of the image information is very important in many areas of the IoT(Internet of Things), and study a number of ways to display the security (copyright, etc.). In this paper, information of image that is used by the IoT is converted to a DCT(Discrete Cosine Transform) and QC(Quantization Coefficient). And watermark (message) is to create a new encoded message(WMQR) through a QR Code. QC and WMQR applies LSB steganography techniques, can get the security (copyright, etc.) of image information. LSB steganographic techniques may be inserted according to a message (Watermark) to determine the location (Secret Key). The encoded image is sent to the recipient via the Internet. The reverse process can be obtained image and a QR code, a watermark (Message). A method for extracting a watermark from the security of the image information is coded using only the image and Secret Key, through the DCT and quantization process, so obtained by separating the watermark (Message) for the image. In this paper, we were able to improve the security of the method of image information, the image quality of the image by the simulations (PSNR), in turn, benefits were also normalized correlation (NC) and security.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1484-1490
• /
• 2007

The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1462-1471
• /
• 2005

Recently, the medical image has been digitized by the development of computer science and digitization of the medical devices. There are needs for database service of the medical image and long term storage because of the construction of PACS(picture archiving and communication system) following DICOM(digital imaging communications in medicine) standards, telemedicine, and et al. However, it also caused some kinds of problems, such as illegal reproduction of medical image, proprietary rights and data authentication. In this paper, we propose the new digital watermarking technique for medical image based on public key encryption algorithm for integrity verification. It prevents illegal forgery that can be caused after transmitting medical image data remotely. The watermark is the value of bit-plane in wavelet transform of the original image for certification method of integrity verification. We proposed the embedding regions are randomly chosen considering ROI, and a digital signature is made using hash function of MD5 which input is a secret key. The experimental results show that the watermark embedded by the proposed algorithm can survive successfully in image processing operations and that the watermark's invisibility is good.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.291-300
• /
• 2005

We are required to adequately adjust the distributed contents to each device and users' demands on the network and to obtain authentication of ownership for our information to prevent the illegal usage of our digital information by non-owners. In this paper, we propose scalable digital watermarking of contents within a compression domain based on Orthogonal Forward Wavelet Transforms, and the proposed method focuses on robust watermark algorithms that are not visually recognizable to embedded ownership information. Therefore, it proposes a watermark insertion methods based on spread spectrum techniques and Provides a watermark key. As a result, it not only extracted the contained watermark from the intentionally altered images, but also secured the watermark information extraction from partial images and ensure the decrease of BER (Bit Error Rate) in the images containing watermarks even when more watermark inserted images are transmitted.

• Convergence Security Journal
• /
• v.1 no.1
• /
• pp.47-55
• /
• 2001

This paper proposes a method which inserts watermark created by secret sharing method and then extracts it from watermarked image for the protection of copyrights of digital images. To do this, after image's DCT transform, once some values created by Key sharing method which used Lagrange interpolation are inserted into a frequency domain, one can recreate original watermark even if only k seeds are extracted among n of inserted seeds ($n{\geq}k$).

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.12
• /
• pp.716-722
• /
• 2005

In this paper, we propose the audio watermarking algorithm based on the critical band of HAS(human auditory system) without audibly affecting the quality of the watermarked audio and implement the detecting algorithm on the BSS(broadcast synchronizing system) for testing the proposed algorithm. According to the audio quality test, the SNR(signal to noise ratio) of the watermarked audio objectively is 66dB above. In the robustness test, the proposed algorithm can detect the watermark more than $90\%$ from various compression(MP3, AAC), A/D and D/A conversions, sampling rate conversions and especially asynchronizing attacks. The BSS automatically switches the programs between the key station and the local station in broadcasting system. The result of reliability test of implemented system by using the real broadcasting audio has no false positive error during 30 days. Because of detecting once processing per 0.5 second, we can judge that the false positive error does not occur.

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.69-72
• /
• 2000

In this paper, a novel algorithm for digital watermarking is proposed. We use two pattern keys from BCH (15, 7) code and one randomizing key. In the embedding process, optimal watermark coefficients are determined by statistical analysis of the DCT coefficients from the standpoint of HVS. In the detection, watermark coefficients are restored by correlation matching of the possible pattern keys and minimizing the estimation errors. Attacks tested in the experiments ate image enhancement and image compression (JPEG). Performance is evaluated by BER of the logo images and SNR/PSNR of the restored images. Our method has higher performance against JPEG attacks. Analysis for the performance is included.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.681-687
• /
• 2016

Today's modern world requires a digital watermarking technique that takes the redundancy of an image into consideration for embedding a watermark. The novel algorithm used in this paper takes into consideration the redundancies of spatial domain and wavelet domain for embedding a watermark. Also, the cryptography-based secret key makes the algorithm difficult to hack and help protect ownership. Watermarking is blind, as it does not require the original image. Few coefficient matrices and secret keys are essential to retrieve the original watermark, which makes it redundant to various intentional attacks. The proposed technique resolves the challenge of optimizing transparency and robustness using a Canny-based edge detector technique. Improvements in the transparency of the cover image can be seen in the computed PSNR value, which is 44.20 dB.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.319-322
• /
• 2002

In this paper, we present a digital authentication technique using content-based watermarking in digital images. To digest the image contents, Hopfield network is employed on the block-based edge image. The Hopfield function extracts the same tit fur similarly looking blocks so that the values are unlikely to change to the innocuous manipulations while being changed far malicious manipulations. By inputting the extracted bit sequence with secret key to the cryptographic hash function, we generate a watermark for each block by seeding a pseudo random number generator with a hash output Therefore, the proposed authentication technique can distinguish between malicious attacks and innocuous attacks. Watermark embedding is based on the block-based spread spectrum method in DCT domain and the strength of watermark is adjusted according to the local statistics of DCT coefficients in a zig-zag scan line in AC subband. The numerical experiments show that the proposed technique is very efficient in the performance of robust authentication.