• Journal of the Institute of Convergence Signal Processing
• /
• v.17 no.1
• /
• pp.10-17
• /
• 2016

GPS location information storage included in the HD black box is using a unique manner for each manufacturer does not have a specific standard. In this paper, in order to overcome the limitations of the storage space and thereby the image quality according to store GPS position information deteriorate to solve the problems that cause, we propose the location information concealment method included in the HDTV video content using a essential hidden region. HDTV video content is a Border Extender of 8 lines in the frame to the bottom of the compression will be required. This was inserted into the image of a gray scale used in block form in order to space the current position information is concealed to prevent image degradation. The proposed method was confirmed using real HD black box, there are more difficult to interpret the format of the ASCII code re-edit the location information when the compression effect disappears with the existing security zones added. Therefore, the proposed method is suitable for location-based services, such as Facebook or Youtube videos.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.227-239
• /
• 2014

This paper proposes an enhance prediction for conventional near-lossless coder to effectively lower external memory bandwidth in image processing SoC. First, we utilize an already reconstructed green component as a base of predictor of the other color component because high correlation between RGB color components usually exists. Next, we can improve prediction performance by applying variable block size prediction. Lastly, we use minimum internal memory and improve a temporal prediction performance by using a template dictionary that is sampled in previous frame. Experimental results show that the proposed algorithm shows better performance than the previous works. Natural images have approximately 30% improvement in coding efficiency and CG images have 60% improvement on average.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.15-24
• /
• 1998

In this paper, we present new method of fractal image coding based on iterated function system(IFS) suggested by Barnsley. In previous Fractal coding using full searching algorithm, the quality of reconstructed image was better than other fractal coding method's, but it took a long time in that algorithm for searching domain blocks matched. And it is performed through linear affine transform, therefore it is difficult to approximate the complex range blocks. In this paper, using quadtree partitioning, complex blocks are divided into more smaller blocks, and simple blocks are merged to more larger blocks. So, we can got more precisely approximated range blocks and reduce the number of transformations. Hence, we have improved the compression ratio. In addition, we restrict the region of searching domains in order to reduce the searching time and coding time. Compared with full searching algorithm, we reduced coding time drastically, and quality of reconstructed image was better in terms subjective criteria. And compared with Monro's, our method is slower, but we could obtain a reconstructed image with better quality.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2036-2039
• /
• 2007

This paper proposes an enhanced adaptive mode decision scheme for fast H.264 encoders. By efficiently predicting AZCB (All Zero Coefficient Block), the proposed scheme can encode motion pictures in H.264 up to 2.86 and 1.68 times faster than JM9.3 and AMD [1], respectively. Besides, this scheme significantly reduces the encoding performance fluctuation of AMD across tested bit-rates and video sequences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.258-268
• /
• 2001

The compression method is necessarily used to send the high quality moving picture that contains a number of data in image processing. In the field of moving picture compression method, the motion estimation algorithm is used to reduce the temporal redundancy. Block matching algorithm to be usually used is distinguished partial search algorithm with full search algorithm. Full search algorithm be used in this paper is the method to compare the reference block with entire block in the search window. It is very efficient and has simple data flow and control circuit. But the bigger the search window, the larger hardware size, because large computational operation is needed. In this paper, we design the full search block matching motion estimator. Using the DCT DC values, we decide luminance. And we apply 3 bit compare-selector using bit plane to I(Intra coded) picture, not using 8 bit luminance signals. Also it is suggested that use the same selective bit for the P(Predicted coded) and B(Bidirectional coded) picture. We compare based full search method with PSNR(Peak Signal to Noise Ratio) for C language modeling. Its condition is the reference block 8$\times$8, the search window 24$\times$24 and 352$\times$288 gray scale standard video images. The result has small difference that we cannot see. And we design the suggested motion estimator that hardware size is proved to reduce 38.3％ for structure I and 30.7％ for structure II. The memory is proved to reduce 31.3％ for structure I and II.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1687-1693
• /
• 2013

This paper addresses an adaptive postprocessing technique to remove blocking effects of the highly compressed images. The proposed technique removes blocking effects selectively by applying filters with different strength according to block analysis based on the directional activity. One-dimensional filters which are used to remove grid noises accomplish the adaptive filtering to the signal itself as well as to the directionality of the block. Moreover, we propose a detection method of the staircase noises and corner outliers and a two-dimensional directional filter to remove them. Experimental results for various images and bitrates show that the proposed method outperforms the conventional methods in PSNR for the objective performance and GBIM for the subjective quality evaluation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.1
• /
• pp.16-26
• /
• 2000

The proposed method inserts a watermark information not mto a whole Image region but only into regions of interest(ROIs) To extract the ROIs, we divide an original Image into sub-blocks and use modified Shi-Kuo Chang's PIM(picture information measure) as the criteria to select the ROIs Considering the directional information and frequency bands, we insert the watermark information into sub-blocks m the DCT domain. The proposed method can reduce the distortion in comparison With the other methods which utilize the whole Image as an nor The proposed method makes much less damaged Images m comparison to the other methods And those Images processed by the proposed algorithm are more robust to the changes caused by signal processing operations such as resampling, clipping. noise, and so on Also due to the block-based watermark insertion, the proposed method has the robustness to the Image compression processes such as JPEG and MPEG.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2313-2327
• /
• 1994

As the communication environment evolves, there is an increasing need for multiresolution image coding. To meet this need, the entrophy constratined vector quantizer(ECVQ) for coding of image pyramids by spline wavelet transform is introduced in this paper. This paper proposes a new scheme for image compression taking into account psychovisual feature both in the space and frequency domains : this proposed method involves two steps. First we use spline wavelet transform in order to obtain a set of biorthogonal subclasses of images ; the original image is decomposed at different scale using a pyramidal algorithm architecture. The decomposition is along the vertical and horizontal directions and maintains constant the number of pixels required the image. Second, according to Shannon's rate distortion theory, the wavelet coefficients are vectored quantized using a multi-resolution ECVQ(entropy-constrained vector quantizer) codebook. The simulation results showed that the proposed method could achieve higher quality LENA image improved by about 2.0 dB than that of the ECVQ using other wavelet at 0.5 bpp and, by about 0.5 dB at 1.0 bpp, and reduce the block effect and the edge degradation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1051-1077
• /
• 2021

The secure communication of information is a major concern over the internet. The information must be protected before transmitting over a communication channel to avoid security violations. In this paper, a new hybrid method called compressed encrypted data embedding (CEDE) is proposed. In CEDE, the secret information is first compressed with Lempel Ziv Welch (LZW) compression algorithm. Then, the compressed secret information is encrypted using the Advanced Encryption Standard (AES) symmetric block cipher. In the last step, the encrypted information is embedded into an image of size 512 × 512 pixels by using image steganography. In the steganographic technique, the compressed and encrypted secret data bits are divided into pairs of two bits and pixels of the cover image are also arranged in four pairs. The four pairs of secret data are compared with the respective four pairs of each cover pixel which leads to sixteen possibilities of matching in between secret data pairs and pairs of cover pixels. The least significant bits (LSBs) of current and imminent pixels are modified according to the matching case number. The proposed technique provides double-folded security and the results show that stego image carries a high capacity of secret data with adequate peak signal to noise ratio (PSNR) and lower mean square error (MSE) when compared with existing methods in the literature.

• The Journal of the Korea Contents Association
• /
• v.9 no.8
• /
• pp.91-98
• /
• 2009

This paper presents a solution to error avalanche of deciphering where radio noise brings random bit errors in encrypted image data under ubiquitous environment. The image capturing module is to be made comprising data compression and encryption features to reduce data traffic volume and to protect privacy. Block cipher algorithms may experience error avalanche: multiple pixel defects due to single bit error in an encrypted message. The new fault tolerant scheme addresses error avalanche effect exploiting a three-dimensional data shuffling process, which disperses error bits on many frames resulting in sparsely isolated errors. Averaging or majority voting with neighboring pixels can tolerate prominent pixel defects without increase in data volume due to error correction. This scheme has 33% lower data traffic load with respect to the conventional Hamming code based approach.