• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1677-1690
• /
• 1997

Block-transform coding is one of the most popular approaches for image compression. For example, DCT is widely used in the internaltional standards standards such as MPEG-1, MPEG-2, JPEG, and H.261. In the block-based transform coding, blocking artifacts may appear along block boundaries, and they can cause severe image degradation eqpecially when the transform coefficients are coarsely quantized. In this paper, we propose a new method for blocking artifacts reduction in transform-coded images. For blocking artifacts reduction, we add a correction term, on a block basis, composed of a linear combination of 28 basis images that are orthonormal on block boundaries. We select 28 DCT kernel functions of which boundary values are linearly independent, and Gram-Schmidt process is applied to the boundary values in order to obtain 28 boundary-orthonormal basis images. A threshold of bolock discontinuity is introduced for improvement of visual quality by reducing image blurring. We also investigate the number of basis images needed for efficient blocking artifacts reduction when the compression ratio changes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.1946-1953
• /
• 2006

Because the embedded watermark of luminance component guarantees the extraction of ownership information when the color image is converted to gray scale image, the information of ownership right as to the luminance component is embedded in the luminance-chrominance color space such as YCbCr. Therefore, this paper proposes watermark embedding, extraction and authentication algorithm of color image. which considers the device and performance of multimedia contents service by focusing on the robustness and invisibility of watermark. The color image is converted from RGB color space to YCbCr color space, and then the properties of each component of Y(Luminance), Cb(Color Differences) and Cr(Color Differences) are considered in order to embed, extract and certify multi-level watermark in the frequency domain based on the wavelet. As a result, it can guaranteed the robustness for the JPEG compression and invisibility of watermark for multi-level.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.183-189
• /
• 2013

This paper proposes a novel lossless image compression scheme composed of direction-adaptive prediction and context-based entropy coding. In the prediction stage, we analyze the directional property with respect to the current coding pixel and select an appropriate prediction pixel. In order to further reduce the prediction error, we propose a prediction error compensation technique based on the context model defined by the activities and directional properties of neighboring pixels. The proposed scheme applies a context-based Golomb-Rice coding as the entropy coding since the coding efficiency can be improved by using the conditional entropy from the viewpoint of the information theory. Experimental results indicate that the proposed lossless image compression scheme outperforms the low complexity and high efficient JPEG-LS in terms of the coding efficiency by 1.3% on average for various test images, specifically for the images with a remarkable direction the proposed scheme shows better results.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.247-258
• /
• 2003

Principal component analysis (PCA) based algorithms form the basis of numerous algorithms and studies in the face recognition literature. PCA is a statistical technique and its incorporation into a face recognition system requires numerous design decisions. We explicitly take the design decisions by in-troducing a generic modular PCA-algorithm since some of these decision ate not documented in the literature We experiment with different implementations of each module, and evaluate the different im-plementations using the September 1996 FERET evaluation protocol (the do facto standard method for evaluating face recognition algorithms). We experiment with (1) changing the illumination normalization procedure; (2) studying effects on algorithm performance of compressing images using JPEG and wavelet compression algorithms; (3) varying the number of eigenvectors in the representation; and (4) changing the similarity measure in classification process. We perform two experiments. In the first experiment, we report performance results on the standard September 1996 FERET large gallery image sets. The result shows that empirical analysis of preprocessing, feature extraction, and matching performance is extremely important in order to produce optimized performance. In the second experiment, we examine variations in algorithm performance based on 100 randomly generated image sets (galleries) of the same size. The result shows that a reasonable threshold for measuring significant difference in performance for the classifiers is 0.10.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.744-754
• /
• 2004

In this paper, a polarity based blind watermarking method considering wavelet coefficients modification is proposed. In this proposed method, we use an asymmetric thresholds watermarking(ATW) in which detection threshold is higher than inserting threshold in order to enhance watermark detection ratio in attacked images. Also, in order to reduce errors in the detected value of watermarks according to small changes in the coefficient values when detecting watermarks, it set the range for movement variation of the coefficients and lowered the sensitivity of variation by ignoring the variations that fall into this range. For this purpose, the polarity preservation threshold $\beta$ was set and a watermark was detected based on the polarity only for the difference that was larger than $\beta$. The experimental results show that the proposed method has good quality and is robust to various attacks such as the JPEG lossy compression, noise addition, cropping, blurring, etc.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.689-696
• /
• 2010

The goal of this paper is to present a novel method for protecting digital image using 2-D cellular automata transform (CAT). A copyright and transform coefficients are used to generate a new content-based copyright and an original digital image is distributed without any hidden copyright. The parameter, which is called gateway value, for 2-D CAT is consisted of rule number, initial configuration, lattice length, number of neighbors, and etc. Since 2-D CAT has various gateway values, it is more secure than conventional methods. The proposed algorithm is verified using attacked images such as filtering, cropping, JPEG compression, and rotation for robustness.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.12
• /
• pp.35-43
• /
• 2013

This paper suggests a way to implement a system that broadcasts compressed JPEG images obtained from a webcam to multiple users on their smartphones. The system was implemented to maintain a suitable image quality so that things are identifiable while using the minimal amount of data, in order to deliver as many frames as possible to as many users as possible. Also, the suggested way was applied and various tests were done, including on: the performance of the server that provides image information; the performance of the client that receives the image information and displays it on the smartphone; and the max. number of simultaneous users supported by the system. When a broadcasting system is implemented using webcams and smartphones, the results of this paper can be used in estimating the suitable system parameters depending on network performance, including the max. number of simultaneous clients supported, the client smartphone performance required, and the number of frames that can be transmitted per second.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.5
• /
• pp.430-437
• /
• 2021

In this paper, we propose a robust face recognition method against soft errors with a deep convolutional generative adversarial network(DCGAN) based compensation method by a cross-layer approach. When soft-errors occur in block data of JPEG files, these blocks can be decoded inappropriately. In previous results, these blocks have been replaced using a mean face, thereby improving recognition ratio to a certain degree. This paper uses a DCGAN-based compensation approach to extend the previous results. When soft errors are detected in an embedded system layer using parity bit checkers, they are compensated in the application layer using compensated block data by a DCGAN-based compensation method. Regarding soft errors and block data loss in facial images, a DCGAN architecture is redesigned to compensate for the block data loss. Simulation results show that the proposed method effectively compensates for performance degradation due to soft errors.

• Journal of Broadcast Engineering
• /
• v.27 no.2
• /
• pp.198-206
• /
• 2022

This paper proposes a method to solve problems that may occur when SPIHT(set partition in hierarchical trees) is used in a dedicated codec for compressing complex holograms with ultra-high resolution. The development of codecs for complex holograms can be largely divided into a method of creating dedicated compression methods and a method of using anchor codecs such as HEVC and JPEG2000 and adding post-processing techniques. In the case of creating a dedicated compression method, a separate conversion tool is required to analyze the spatial characteristics of complex holograms. Zero-tree-based algorithms in subband units such as EZW and SPIHT have a problem that when coding for high-resolution images, intact subband information is not properly transmitted during bitstream control. This paper proposes a method of dividing wavelet subbands to solve such a problem. By compressing each divided subbands, information throughout the subbands is kept uniform. The proposed method showed better restoration results than PSNR compared to the existing method.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.81-89
• /
• 2009

To support dynamic Region-of-Interest(ROI) in JPEG2000, a fast ROI mask generation is needed. In the existing methods of ROI coding, after scanning all the pixels in order and discriminating ROI, an ROI mask has been generated. Our method scans 4 pixels of the corners in one code block, and then based on those informations, scans the edges from the corners to get the boundaries of ROI and background. These informations are consisted of a distributed information of ROI and two coordinates of the pixels, which are the points the edges and the boundaries meet. These informations are transmitted to encoder and supported for fast ROI mask generation. There were no great differences between the proposed method and the existing methods in quality, but the proposed method showed superiority in speed.