• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.12
• /
• pp.11-19
• /
• 1999

Fractal image compression algorithm has been studied mostly not in the view of hardware but software. However, a general processor by software can't decode fractal compressed images in real-time. Therefore, it is necessary that we develop a fast dedicated hardware. However, design examples of dedicated hardware are very rare. In this paper, we designed a quadtree fractal-based compressed image decoder which can decode $256{\times}256$ gray-scale images in real-time and used two power-down methods. The first is a hardware-optimized simple post-processing, whose role is to remove block effect appeared after reconstruction, and which is easier to be implemented in hardware than non-2' exponents weighted average method used in conventional software implementation, lessens costs, and accelerates post-processing speed by about 69%. Therefore, we can expect that the method dissipates low power and low energy. The second is to design a power dissipation in the multiplier can be reduced by about 28% with respect to a general array multiplier which is known efficient for low power design in the size of 8 bits or smaller. Using the above two power-down methods, we designed decoder's core block in 3.3V, 1 poly 3 metal, $0.6{\mu}m$ CMOS technology.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1057-1065
• /
• 1998

This paper describes a new fractal image coding algorithm to shorten time to take on fractal image encoding by using limited search area method and scaling method. First, the original image is contracted respectively by half and by quarter with the scaling method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. This searched block is used in encoding. Also, we propose an algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image quality than Jacquin's method.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.1085-1092
• /
• 2002

Studies on image information processing have been performed since long time ago because in daily life most of information are acquired by the since of sight. Since there should be a lot of data to describe image as a digital form, data compression is required in order to store or transmit digital image. Lately among most of image compression methods adopted on image compression standards, transform coding methods have been primarily used which transforms the correlations between pixels of image on frequency domain before image compression. It is blown that the standard methods using especially DCT features blocking effect which is the major cause of degrading the quality of image at high compression rate. Fractal encoding using quadtree partition is applied after reducing original image, and we are to find a optimal encoding for the number of scaling bit and offset bit.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.64-69
• /
• 2000

This paper proposes a novel fractal coding method for fast encoding and high compression to shorten time to take on fractal encoding by using limited search area. First. the original image is contracted respectively by half and by quarter with the scaling method and bit-plane method. And then, the corresponding domain block of the quarter-sized image which is most similar with one range block of the half-sized image is searched within the limited area in order to reduce the encoding time extremely. As the result of the evaluation, the proposed algorithm provided much shorter encoding time and better compression ratio with a little degradation of the decoded image qualify than Jacquin's method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.335-343
• /
• 2001

The conventional wavelet-based fractal image coding has the disadvantage that the encoding takes a long time, since each range block finds the best domain in the image. In this Paper, we propose wavelet-based fractal image coding using SAS(Self Affine System) method and multi-scale factor. It consists of the range and domain blocks in DWT(discrete wavelet transform) region. Using SAS method, the proposed method is that the searching process of the domain block is not required, and the range block selects the domain which is relatively located the same position in the upper level. The proposed method can perform a fast encoding by reducing the computational complexity in the encoding process. In order to improve the disadvantage of SAS method which is reduced image qualify, the proposed method is improved image qualify using the different scale factors for each level. As a result, there is not influence on an image quality, the proposed method is enhanced the encoding time and compression ratio, and it is able to the progressive transmission.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.19-27
• /
• 2001

The conventional fractal image compression based on wavelet transform has the disadvantage that the encoding takes many time, since it finds the optimum domain for all the range blocks. In this paper, we propose the fractal image compression based on wavelet transform using the SAS(Self Affine System) techniques. It consists of the range and domain blocks in the wavelet transform, and the range blocks select the domain which is located the relatively same position. In the encoding process, the proposed methods introduce SAS techniques that the searching process of the domains blocks is not required. Therefore, it can perform a fast encoding by reducing the computational complexity. And, the image quality is improved using the different scale factors for each level and the sub-tree in the decoding. As a result, the image quality and the compression ratio are adjustable by the scale factors.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.351-354
• /
• 2003

이미지 압축에서 레인지 블록들을 분할하는 것은 매우 중요한 문제이다. 본 논문에서는 프랙탈 이미지 압축기법에서 사용하는 분할-합병 기법을 동영상의 압축에 적용하였다. Quad-tree 방식은 top-down 방식으로 유사한 도메인 블록을 찾지 못하였을 경우 그 레인지를 4 등분하여 각각의 도메인 블록을 찾는 방식이다. 분할-합병 기법은 bottom-up 방식으로 Quad-tree 방식과 달리 주어진 크기의 원자 블록(atomic block)들을 도메인과의 유사성에 따라 연결함으로써 레인지를 불규칙적인 형태로 합병할 수 있다. 이 방식을 이용하여 동영상에서의 화질과 압축률의 개선을 기대할 수 있다.

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

This paper proposes a novel video coding system with rate control based on fractal algorithm To overcome the demerits of excessive amounts of coded bit generated by previous fractal coding methodology. the proposed system classifies the Image into three classes such as background, motion compensation, and fractal coding area. The motion vector for motion compensation, and the fractal offset value that is difference value between the predicted offset and the least-square approximated value are coded with variable length code The decision method which determines threshold value of partitioning quadtree is applied to the bit-rate control algorithm considering the quantity of currently generated bits and fixed channel bandwidth Experimental result shows that the proposed system enhances compression ratio 1.8 times higher than previous method for the same image quality, and performs efficient rate control for fixed channel bandwidth.

• Journal of the Korean Society of Radiology
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same compression rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.708-714
• /
• 2000

In this paper, an one-dimensional VLSI array for high speed processing of fractal image compression algorithm based the quad-tree partitioning method is proposed. First of all, the single assignment code algorithm is derived from the sequential Fisher's algorithm, and then the data dependence graph(DG) is obtained. The two-dimension array is designed by projecting this DG along the optimal direction and the one-dimensional VLSI array is designed by transforming the obtained two-dimensional array. The number of Input/Output pins in the designed one-dimensional array can be reduced and the architecture of process elements(PEs) can he simplified by sharing the input pins of range and domain blocks and internal arithmetic units of PEs. Also, the utilization of PEs can be increased by reusing PEs for operations to the each block-size. For fractal image compression of 512X512gray-scale image, the proposed array can be processed fastly about 67 times more than sequential algorithm. The operations of the proposed one-dimensional VLSI array are verified by the computer simulation.