• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.21-23
• /
• 2006

Due to development of Internet network environments and data compression techniques, the size and amount of multimedia data has greatly increased. They are compressed before transmission or storage. Dealing with these compressed data such as video retrieval or indexing requires the decoding procedure most of the time. In video retrieval and indexing a color histogram is one of the most frequently used tools. We propose a novel scheme for extracting color histograms from images transformed into the compressed domain using $8{times}8$ DCT(Discrete Cosine Transform). In this scheme an averaged version of original image is obtained by filtering DCT coefficients with a filter we destined.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.8
• /
• pp.369-374
• /
• 2006

Due to development of internet network environments and data compression techniques, the size and amount of multimedia data has greatly increased. They are compressed before transmission or storage. Dealing with these compressed data such as video retrieval or indexing requires decompression procedure in most cases. This causes additional computations and increases the processing time. In various applications a histogram is one of the most frequently used tools. Efficiency of extracting such histograms will drop down if decompression is involved. We propose a novel scheme for extracting histograms from images that are transformed into the compressed domain by 8x8 DCT(Discrete Cosine Transform). In this scheme an averaged version of original image is obtained by a simple linear combination of DCT coefficients with the sets of coefficients we designed.

• 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.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.5
• /
• pp.550-558
• /
• 1988

This paper presents laplacian pyramid vector quantization (LPVQ) approach in which a vector quantizer is used to encode a series of quasi-bandpassed images generated by the laplacian pyramid processing. Performance of the LPVQ is compared to those of DCT domain methods at the same bit rate via computer simulations. Experimental results show that the PSNR's (peak signal-to-noise ratio) for the LPVQ are almost the same as those of the DCT based methods. However, subjective study indicates the LPVQ obtains slightly higher scores than the DCT based techniques.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1005-1012
• /
• 1987

An adaptive scalar DCT-Wiener filtering method that can be applied to the problem of restoring an image degraded by white Gaussian noise is presented. In this method, the power spectrum needed to Winer filering is adaptively estimated in block-wise according to the lical properties in transform domain. In addition, overlapping method for reducing the block artifact is considered. Experimental results show that the adaptive Wiener filter by the proposed method yields performance improvement and better image quality over the nonadaptive one and the spatial Lee filter.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.243-246
• /
• 2002

The proliferation of digitized media(audio, image and video) is creating a processing need for copyright enforcement schemes that protect copyright ownership. we argue that a watermark must be placed in perceptually significant components of a signal if it is to be robust to signal distortions and malicious attack. In this paper, RGB coordinate image is transformed into LUV coordinate, it include the characteristics of, Human vision and then the UV component is transformed into NxN block DCT transform. we propose a technique for embedding the watermark of visually recognizable mark into the middle frequency domain of image.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.239-240
• /
• 2007

We suggest an image watermarking algorithm. We perform the modified Log-Polar Mapping (LPM) and the DFT/DCT on the original image and embed the watermark. Binary images are used for watermarks. Watermarking strength is adaptively adjusted depend on the mapped data Experimental results show that this method is robust to JPEG and rotation distortions.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.51-59
• /
• 2016

This paper presents a method of DCT-based illuminant compensation to enhance the accuracy of face recognition under an illuminant change. The basis of the proposed method is that the illuminant is generally located in low-frequency components in the DCT domain. Therefore, the effect of the illuminant can be compensated by controlling the low-frequency components. Moreover, a directional high-order local pattern descriptor is used to detect robust features in the case of face motion. Experiments confirm the performance of the proposed algorithm got up to 95% when tested using a real database.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1402-1411
• /
• 2014

Buyer-seller watermarking protocol is defined as the practice of imperceptible altering a digital content to embed a message using watermarking in the encryption domain. This protocol is acknowledged as one kind of copyright protection techniques in electronic commerce. Buyer-seller watermarking protocol is fundamentally based on public-key cryptosystem that is operating using the algebraic property of an integer. However, in general usage, digital contents which are handled in watermarking scheme mostly exist as real numbers in frequency domain through DCT, DFT, DWT, etc. Therefore, in order to use the watermarking scheme in a cryptographic protocol, digital contents that exist as real number must be transformed into integer type through preprocessing beforehand. In this paper, we presented a new watermarking scheme in an encrypted domain in an image that is based on the block-DCT framework and homomorphic encryption method for buyer-seller watermarking protocol. We applied integral-processing in order to modify the decimal layer. And we designed a direction-adaptive watermarking scheme by analyzing distribution property of the frequency coefficients in a block using JND threshold. From the experimental results, the proposed scheme was confirmed to have a good robustness and invisibility.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.180-181
• /
• 2018

JPEG is a most widely used standard image compression technology. This research introduces the JPEG image compression algorithm and describes each step in the compression and decompression. Image compression is the application of data compression on digital images. The DCT (discrete cosine transform) is a technique for converting a time domain to a frequency domain. First, the image is divided into 8 by 8 pixel blocks. Second, working from top to bottom left to right, the DCT is applied to each block. Third, each block is compressed through quantization. Fourth, the array of compressed blocks that make up the image is stored in a greatly reduced amount of space. Finally if desired, the image is reconstructed through decompression, a process using IDCT (inverse discrete cosine transform).