• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1228-1231
• /
• 2002

Digital image watermarking scheme using adaptive block division is proposed. To increase the perceptual invisibility, the image is divided into blocks by local properties and the human visual system (HVS), then the significant blocks are selected in the divided blocks. The significant coefficient is determined by Weber's law in these blocks. To increase the robustness, low frequency domains of the discrete cosine transform (DCT) and the discrete wavelet transform (DWT) are used. The watermark is embedded into the selected significant blocks of the DCT's and DWT's low frequency domains with adaptive watermark strengths. The watermark strength is determined by the variance and the local properties of the significant block. The experimental results prove that the proposed scheme has a good robustness against several image processing operations (e.g. median filtering, cropping, scaling, JPEG, JPEG2000, etc.) without significant degradation of the watermarked image.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.303-316
• /
• 2021

Digital content protection has recently become an important requirement in biometrics-based authentication systems due to the challenges involved in designing a feasible and effective user authentication method. Biometric approaches are more effective than traditional methods, and simultaneously, they cannot be considered entirely reliable. This study develops a reliable and trustworthy method for verifying that the owner of the biometric traits is the actual user and not an impostor. Watermarking-based approaches are developed using a combination of a color face image of the user and a mobile equipment identifier (MEID). Employing watermark techniques that cannot be easily removed or destroyed, a blind image watermarking scheme based on fast discrete curvelet transform (FDCuT) and discrete cosine transform (DCT) is proposed. FDCuT is applied to the color face image to obtain various frequency coefficients of the image curvelet decomposition, and for high frequency curvelet coefficients DCT is applied to obtain various frequency coefficients. Furthermore, mid-band frequency coefficients are modified using two uncorrelated noise sequences with the MEID watermark bits to obtain a watermarked image. An analysis is carried out to verify the performance of the proposed schema using conventional performance metrics. Compared with an existing approach, the proposed approach is better able to protect multimedia data from unauthorized access and will effectively prevent anyone other than the actual user from using the identity or images.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.5
• /
• pp.93-103
• /
• 2005

In this paper, we propose a RST resistant robust logo embedding technique for multimedia copyright protection Geometric manipulations are challenging attacks in that they do not introduce the quality degradation very much but make the detection process very complex and difficult. Watermark embedding in the normalized image directly suffers from smoothing effect due to the interpolation during the image normalization. This can be avoided by estimating the transform parameters using an image normalization technique, instead of embedding in the normalized image. Conventional RST resistant schemes that use full frame transform suffer from the absence of effective perceptual masking methods. Thus, we adopt $8\times8$ block DCT and calculate masking using a spatio-frequency localization of the $8\times8$ block DCT coefficients. Simulation results show that the proposed algorithm is robust against various signal processing techniques, compression and geometrical manipulations.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1329-1336
• /
• 1996

In many image compression applications, the discrete cosine transform (DCY) is well known for is highly efficient coding performance. However, it produces undesirable block artifacts in low-bit rate coding. In addition, in many practical applications, faster computation and easier VLST implementation of DCT coefficients are also important issues. The removal of the block artifacts and faster DCT computation are therefor of practical interest. In this paper, a modified DCTcomputation scheme was investigated, which provides a simple efficient solution to the reduction of the block artifacts while achieving faster computation. We have applied the new ap-proach to the low-bit rate coding and decoding of images. Simulation results on real images have verified the improved performance of the proposed method over the standar d method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1860-1868
• /
• 1998

A simple postprocessing algorithm is proposed to reduce the blocky artifacts of Block Discrete Cosine Transform (BDCT) coded images. Since the block noise is mostly antisymmetric relative to the block boundaries, we model the blocky noise as one-dimensional antisymmertric functions made by superposing DCT basis functions. observing the frequency characteristics of the noies model, we approximate its high frequency components as those of step functions. Then the proposed postprocessing algorithm eliminates the carefully selected high frequency components of step functions in the one-dimensional sN-point DCT domain, when the encoding block size is $N\;{\times}\;N$. It is shown that the proposed algorithm can also be performed in the spatial domain without computational burden of transforms. The experimental results show that the proposed algorithm well reduces the blocky artifacts in both subjective and objectie viewpoints.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1970-1982
• /
• 1993

This paper describes an efficient array algorithm for parallel computation of vector-radix two-dimensional (2-D) fast discrete cosine transform (VR-FCT), and its VLSI implementation. By mapping the 2-D VR-FCT onto a 2-D array of processing elements (PEs), the butterfly structure of the VR-FCT can be efficiently importanted with high concurrency and local communication geometry. The proposed array algorithm features architectural modularity, regularity and locality, so that it is very suitable for VLSI realization. Also, no transposition memory is required, which is invitable in the conventional row-column decomposition approach. It has the time complexity of O(N+Nnzp-log2N) for (N*N) 2-D DCT, where Nnzd is the number of non-zero digits in canonic-signed digit(CSD) code, By adopting the CSD arithmetic in circuit desine, the number of addition is reduced by about 30%, as compared to the 2`s complement arithmetic. The computational accuracy analysis for finite wordlength processing is presented. From simulation result, it is estimated that (8*8) 2-D DCT (with Nnzp=4) can be computed in about 0.88 sec at 50 MHz clock frequency, resulting in the throughput rate of about 72 Mega pixels per second.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.351-358
• /
• 2002

Video compression based on DCT (Discrete Cosine Transform) has weakpoints of blocking artifacts and pixel loss when the resolution is changed. DWT (Discrete Wavelet Transform) based method can overcome such problems. In SAMCoW (Scalable Adaptive Motion Compensation Wavelet), one of wavelet based video coding algorithm, both intra frames and motion compensated error frames are encoded using EZW(Embedded Zerotree Wavelet) algorithm. However the property of wavelets transform coefficients of motion compensated error frames are different from that of still images. Signal energy is not highly concentrated in the lower bands which is true for most still image cases. Signal energy is rather evenly distributed over all frequency bands. This paper suggests a new video coding algorithm utilizing these properties. Spatial band coding which is known to be very effective for encoding images with relative1y high frequency components and not utilizing the interband coefficients correlation is applied instead of EZW to encode both intra and inter frames. In spatial band coding, the position and value of significant wavelet coefficients in each band are progressively transmitted. Unlike EZW, inter band coefficients correlations are not utilized in spatial band coding. It has been shown that spatial band coding gives better performance than EZW when applied to wavelet based video compression.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.70-82
• /
• 1993

In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.697-703
• /
• 2008

The H.264/AVC video coding standard provides higher coding efnciency compared to the conventional MPEG-2 standard. Since a lot of videos have been encoded using MPEG-2, the format conversion from MPEG-2 to H.264 is essential. In this paper, we propose an efficient method for the conversion of DCT coefficients to H.264/AVC transform coefficients. This conversion is essential, since $8{\times}8$ DCT and $4{\times}4$ integer transform are used in MPEG-2 and H.264/AVC, respectively. The mathematical analysis and computer simulation show that the computational complexity of the proposed algorithm is reduced compared to the conventional algorithm, while the loss caused by the conversion is negligible.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.1002-1011
• /
• 2000

In this paper, we propose a multiresolution progressive image transmission with spatial and bit-rate scalabilities using a $2{\times}2$ DCT. The multiresolition image represented by a $2{\times}2$ DCT is used for the progressive image transmission with spatial and bit-rate scalabilities. Because the proposed progressive image transmission method supports both spatial and bit-rate scalabilities, it can be adaptively applied to the receiver's scalability requests. We compare the proposed progressive transmission with that of the higher-order convolution-based Wavelet method. Comparisons show that the proposed method needs much less computations, but insignificant loss of image quality.