• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.938-943
• /
• 2003

In this paper, we Propose a method using the Tikhonov-Miller process to improve the robustness of watermarking under various attacks. A visually recognizable pattern watermark is embedded in the LH2, HL2 and HH2 subband of wavelet transformed domain using threshold and besides watermark is embeded by utilizing HVS(Human Visual System) feature. The pattern watermark was interlaced after random Permutation for a security and an extraction rate. To demonstrate the improvement of robustness and similarity of the proposed method, we applied some basic algorithm of image processing such as scaling, filtering, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method was able to embed robust watermark invisibility and extract with an excellent normalized correlation of watermark under various attacks.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.5
• /
• pp.464-473
• /
• 2001

Since DCT algorithm divides an image into blocks uniformly in both the spatial domain and the frequency domain, it has a weak point that it can not reflect HVS(Human Visual System) efficiently To avoid this problem, we propose a new algorithm, which combines only the merits of DCT and wavelet transform. The proposed algorithm uses the high compaction efficiency of DCT, and applies wavelet transform mode to DCT coefficients, so that the algorithm can utilize interband and intraband correlations of wavelet simultaneously After that, the proposed algorithm quantizes each coefficient based on the characteristic of each coefficient's band. In terms of coding method, the quantized coefficients of important DCT coefficients have symmetrical distribution, the bigger that value Is, the smaller occurrence probability is. Using the characteristic, we propose a new still image coding algorithm of symmetric and bidirectional tree structure with simple algorithm and fast decoding time. Comparing the proposed method with JPEG, the proposed method yields better image quality both objectively and subjectively at the same bit rate.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.89-94
• /
• 1999

In vector quantization (VQ), mean squared error (MSE) is widely used as a distance measure between vectors. But the distance between averages appears as a dominant quantity in MSE. In the case of image vectors, the coincidence of edge pattern is also important considering human visual system (HVS). Therefore, this paper presents a new distance measure using the variance of difference (VD) as a criterion for the coincidence of edge pattern. By using this in the VQ encoding, we can reduce the degradation of edge region in the reconstructed image. And applying this to the codebook design, we can obtain the final codebook that has a lot of various edge codevectors instead of redundant shade ones.

• Journal of Broadcast Engineering
• /
• v.15 no.3
• /
• pp.321-331
• /
• 2010

Most of multimedia video coding algorithms are lossy schemes and several kinds of spatial and temporal artifacts are inevitable. Flickering, which is the most typical coding artifact in time domain, is mainly due to fact that the quality of coded sequence fluctuates as the quantization parameter is adjusted for rate control. In this paper, we analyzed the effect of quality variation according to the characteristics of video sequence when the I-frames are periodically inserted. And we proposed the FR(Full Reference)-based assessment algorithm to measure the amount of flickering artifacts in the coded video. It is discovered that the flickering becomes critical when the level of quality is intermediate and is affected by the amount of detail or movement, the size of object, and camera parameters. The proposed measurement algorithm shows is well consistent with HVS(Human Visual System).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.10
• /
• pp.4060-4079
• /
• 2020

Blur is an important type of image distortion. How to evaluate the quality of blurred image accurately and efficiently is a research hotspot in the field of image processing in recent years. Inspired by the multi-scale perceptual characteristics of the human visual system (HVS), this paper presents a no-reference image blur/sharpness assessment method based on multi-scale local features in the spatial domain. First, considering various content has different sensitivity to blur distortion, the image is divided into smooth, edge, and texture regions in blocks. Then, the Gaussian scale space of the image is constructed, and the categorized contrast features between the original image and the Gaussian scale space images are calculated to express the blur degree of different image contents. To simulate the impact of viewing distance on blur distortion, the distribution characteristics of local maximum gradient of multi-resolution images were also calculated in the spatial domain. Finally, the image blur assessment model is obtained by fusing all features and learning the mapping from features to quality scores by support vector regression (SVR). Performance of the proposed method is evaluated on four synthetically blurred databases and one real blurred database. The experimental results demonstrate that our method can produce quality scores more consistent with subjective evaluations than other methods, especially for real burred images.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.33-41
• /
• 2008

Due to the advantage of wavelet transform such as the compatibility with JPEG2000, multi-resolution decomposition, and application of HVS(Human Visual System), watermarking algorithm based on wavelet transform (DWT) is recently mast interesting research subject. However, mast of researches are focused on theoretical aspects for the robustness rather than practical usage, and. may be not suitable too much complicated to use in practice. In this paper, robust logo watermarking algorithm based on DWT is proposed for large and huge data processing. The proposed method embeds the logo watermark by mapping of $8{\times}8$ blocks in order of the number of '1' of the original image and the randomized watermark image with LFSR. The original image is transformed by 2 level wavelet. The experimental results shows that the watermark is embedded successfully, and the proposed algorithm has the valuable robustness from the image processing like JPEG compression, low pass filter, high pass filter and changes in brightness and contrast.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.3 s.303
• /
• pp.73-82
• /
• 2005

Recently, The wide range of the Internet applications and the related technology developments enabled the ease use of the digital multimedia contents (fixed images, movies, digital audios). However, due to the replay ability which the contents may be easily duplicated and not only the duplicates are capable of providing the same original quality. There are mainly the encipher techniques and the watermarking techniques which are studied and used as solutions for the above problem in order to protect the license holders' rights. To the protection of the IP(Intellectual Property) rights of the owner, digital watermarking is the technique that authenticates the legal copyrighter. This paper proposed the watermarking algorithms to watermark the 256 gray logo image and the color image by applying the wavelet transformation to the color stand-still images. The proposed algorithms conducted the watermark insertion at the LH frequency region among the wavelet transformation regions (LL, LH, HL, HH). The interleaving algorithms which applied in data communication was applied to the watermark. the amount of watermark increased which consequently caused the PSNR to decrease but this might provide the perseverance against the external attacks such as extraction, filtering, and crop.

• Journal of Korea Multimedia Society
• /
• v.12 no.8
• /
• pp.1055-1065
• /
• 2009

High-dynamic-range (HDR) rendering technology changes the range from the broad dynamic range (up to 9 log units) of a luminance, in a real-world scene, to the 8-bit dynamic range which is the common output of a display's dynamic range. One of the techniques, iCAM06 has a superior capacity for making HDR images. iCAM06 is capable of making color appearance predictions of HDR images based on CIECAM02 and incorporating spatial process models in the human visual system (HVS) for contrast enhancement. However there are several problems in the iCAM06, including obscure user controllable factors to be decided. These factors have a serious effect on the output image but users get into difficulty in that they can't find an adequate solution on how to adjust. So a suggested model gives a quantitative formulation for user controllable factors of iCAM06 to find suitable values which corresponds with different viewing conditions, and improves subjective visuality of displayed images for varying illuminations.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.39-52
• /
• 1999

In this paper we propose a new watermarking technique for copyright protection of images. The proposed technique is based on a spatial masking method with a spatial scale parameter. In general it becomes more robust against various attacks but with some degradations on the image quality as the amplitude of the watermark increases. On the other hand it becomes perceptually more invisible but more vulnerable to various attacks as the amplitude of the watermark decreases. Thus it is quite complex to decide the compromise between the robustness of watermark and its visibility. We note that watermarking using the spread spectrum is not robust enought. That is there may be some areas in the image that are tolerable to strong watermark signals. However large smooth areas may not be strong enough. Thus in order to enhance the invisibility of watermarked image for those areas the spatial masking characteristics of the HVS(Human Visual System) should be exploited. That is for texture regions the magnitude of the watermark can be large whereas for those smooth regions the magnitude of the watermark can be small. As a result the proposed watermarking algorithm is intend to satisfy both the robustness of watermark and the quality of the image. The experimental results show that the proposed algorithm is robust to image deformations(such as compression adding noise image scaling clipping and collusion attack).

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.1
• /
• pp.1-10
• /
• 2000

In this paper, a new digital watermarking algorithm using wavelet transform is proposed. Wavelet transform is widely used for image processing, because of its multiresolution characteristic which conforms to the principles of the human visual system(HVS). It is also very efficient for localizing images in the spatial and frequency domain. Since wavelet coefficients can be characterized by the gaussian distribution, the proposed algorithm uses a gaussian distributed random vector as the watermark in order to achieve invisibility and robustness. After the original image is transformed using DWT(Discrete Wavelet Transform), the coefficients of all subbands including LL subband are utilized to equally embed the watermark to the whole image. To select perceptually significant coefficients for each subband, we use level-adaptive thresholding. The watermark is embedded to the selected coeffocoents, using different scale factors according to the wavelet characteristics. In the process of watermark detection, the similarity between the original watermark and the extracted watermark is calculated by using vector projection method. We analyze the performance of the proposed algorithm, compared with other transform-domain watermarking methods. The experimental results tested on various images show that the proposed watermark is less visible to human eyes and more robust to image compressions, image processings, geometric transformations and various noises, than the existing methods.