• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.311-314
• /
• 2002

This paper has been studied a Image watermarking using PN coding operation where frequency band. By using wavelet transformation, This gets high frequency place HH2 where image watermark puts. Also this places that PN code and binary image are operated. And then, this paper has designed image watermarking index process and extract process, watermarked image which are to add noise is able to extract watermark.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.7
• /
• pp.434-441
• /
• 2003

This paper proposes a new quantitative and objective image quality metric which is essential to verify the performance of block-based DCT image coding. The proposed metric considers not only global distortion of coded image such as spatial frequency sensitivity and channel masking using HVS based multi-channel model, but also structural distortions caused block-based coding. The experimental results show a strong correlation between proposed metric and subjective metric.

• The Transactions of the Korean Institute of Electrical Engineers C
• /
• v.52 no.7
• /
• pp.434-434
• /
• 2003

This paper proposes a new quantitative and objective image quality metric which is essential to verify the performance of block-based DCT image coding The proposed metric considers not only global distortion of coded image such as spatial frequency sensitivity and channel masking using HVS based multi-channel model, but also structural distortions caused block-based coding. The experimental results show a strong correlation between propose(B metric and subjective metric.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.5
• /
• pp.45-51
• /
• 1997

To trnsmit moving image signals by using an object vased coding technique at the rate of 8kbps~11kbps, it is very important to minimize the bit rates used for the compression of the color information of MF-objects. This paper proposes a hybrid coding method which uses the shpae adaptive coding method and the interframe reference method selectively. Gilge's shape adaptive orthogonal coidng method is utilized for shpae adaptive coding. The interfarame reference method approximates the low-passed signals of the image by gilge's shpae adaptive orthogonalization method and then refers the approximation error signals from the high frequency signal components of th eprevious frame. The proposed method achives the bit rates reduction of 17% compared to the gilge's shape adaptive orthogonalization method and 30% rduction compared to the shape adaptive DCT in average.

• Proceedings of the KIEE Conference
• /
• 1988.11a
• /
• pp.477-480
• /
• 1988

A new image coding system called knowledge- based coding is presented which uses positively the knowledge for coding objects. The 3- dimensional model and the psychological knowledge for a person's face can be used as the knowledge for a coding system, when a person's face is coding object. A transmitter analyzes input images and a receiver synthesizes output images using them. The construction of 3-dimensional model and the introduction of the psychological knowledge to the new coding system are discussed. The basic facial expressions are synthesized from a neutral face using them. The synthesized images are very natural.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.80-85
• /
• 2011

In this paper, I propose flexible base point used for a BTC(Block Truncation Coding). Halftoning images are used for printer by reducing the number of pixel depth. During over 20 years, many researches have been studied to apply this techniques to image compression. BTC algorithms are the compression methods using digital halftoning technique about images. In the BTC algorithm, an image block is divided into higher and lower domain compared with the mean of block. then the MAX and MIN representative values are evaluated by calculating the mean of higher and lower domain respectively. At a result, an image block(for example 88 size) is compressed into 64bits pixel representation and 16 bits of the MAX and MIN. And they also have been tried to sustain the image quality high after compression. In this paper, I found that there is some marginal possibility to enhance the image quality by adjusting the base point(generally mean of block) of existing algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.7-14
• /
• 2003

A number of embedded wavelet image coding methods have been proposed since the introduction of EZW(Embedded Zerotree Wavelet) algorithm. A common characteristic of these methods is that they use fundamental ideas found in the EZW algorithm. Especially, one of these methods is the SPIHT(Set Partitioning in Hierarchy Trees) algorithm, which became very popular since it was able to achieve equal or better performance than EZW without having to use an arithmetic encoder. In this paper We propose a recursive set partitioning in hierarchy trees(RSPIHT) algorithm for embedded image coding and evaluate it's effectiveness experimentally. The proposed RSPIHT algorithm takes the simple and regular form and the worst case time complexity of O(n). From the viewpoint of processing time, the RSPIHT algorithm takes about 16.4% improvement in average than the SPIHT algorithm at T-layer over 4 of experimental images. Also from the viewpoint of coding rate, the RSPIHT algorithm takes similar results at T-layer under 7 but the improved results at other T-layer of experimental images.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.127-133
• /
• 1999

The conventional fractal image compression based on discrete wavelet transform uses the fixed block size in fractal coding and reduces PSNR at low bit rate. This paper proposes a fractal image coding based on discrete wavelet transform which improves PSNR by using variable block size in fractal coding. In the proposed method. the absolute values of discrete wavelet transform coefficients are computed. and the discrete wavelet transform coefficients of different highpass subbands corresponding to the same spatial block are assembled. and the fractal code for the range block of each range block level is assigned. and then a decision tree C. the set of choices among fractal coding. "0" encoding. and scalar quantization is generated and a set of scalar quantizers q is chosen. And then the wavelet coefficients. fractal codes. and the choice items in the decision tree are entropy coded by using an adaptive arithmetic coder. This proposed method improved PSNR at low bit rate and could achieve a blockless reconstructed image. As the results of experiment. the proposed method obtained better PSNR and higher compression ratio than the conventional fractal coding method and wavelet transform coding.rm coding.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.56-65
• /
• 2009

Stereoscopic images consist of the left image and the right image. Thus, stereoscopic images have much amounts of data than single image. Then an efficient image compression technique is needed, the DPCM-based predicted coding compression technique is used in most video coding standards. Motion and disparity estimation are needed to realize the predicted coding compression technique. Their performing algorithm is block matching algorithm used in most video coding standards. Full search algorithm is a base algorithm of block matching algorithm which finds an optimal block to compare the base block with every other block in the search area. This algorithm presents the best efficiency for finding optimal blocks, but it has very large computational loads. In this paper, we have proposed fast disparity estimation algorithm using motion and disparity vector information of the prior frame in stereo image coding. We can realize fast disparity vector estimation in order to reduce search area by taking advantage of global disparity vector and to decrease computational loads by limiting search points using motion vectors and disparity vectors of prior frame. Experimental results show that the proposed algorithm has better performance in the simple image sequence than complex image sequence. We conclude that the fast disparity vector estimation is possible in simple image sequences by reducing computational complexities.

• Journal of Korea Society of Industrial Information Systems
• /
• v.21 no.5
• /
• pp.11-17
• /
• 2016

In this paper, we propose a method of correcting depth image by the plane modeling and then improving the coding performance. We model a plane by using the least squares method to the horizontal and vertical directions including the target pixel, and then determine that the predicted plane is suitable from the estimate error. After that, we correct the target pixel by the plane mode. The proposed method can correct not only the depth image composed the plane but also the complex depth image. From the simulation result that measures the entropy power, which can estimate the coding performance, we can see that the coding performance by the proposed method is improved up to 80.2%.