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

In this paper, a fractal image coding based on discrete wavelet transform is proposed to improve PSNR at low bit rates and reduce computational complexity of encoding process. The proposed method takes the absolute value of discrete wavelet transform coefficients, and then constructs significant coefficients trees, which indicate the positions and signs of the significant coefficients. This method improves PSNR and reduces computational complexity of mapping contracted domain pool onto range block, by matching only the significant coefficients of range block to coefficients of contracted domain block. Also, this paper proposes a classification scheme which minimizes the number of contracted domain blocks compared with range block. This scheme significantly reduces the number of range and contracted domain block comparison.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.28-38
• /
• 2000

This paper proposes a fractal compression method using the domain classification and local searching, which utilize DCT coefficient characteristic Generally, the fractal Image encoding method has a time consuming process to search a domain to be matched with range block In order to reduce computation complexity, the domain and range regions are respectively classified into 4 category by using the characteristics of DCT coefficients and each range region is encoded by a method suitable for the property of its category Since the bit amount of the compressed image depends on the number of range blocks, the matching of domain block and range block is induced on the large range block by using local search, so that compression ratio is increased by reducing the number of range block In the local search, the searching complexity is reduced by determining the direction and distance of searching using the characteristics of DCT coefficients The experimental results shows that the proposed algorithm have 1 dB higher PSNR and 0 806 higher compression ratio than previous algorithm.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.409-418
• /
• 1999

The fractal image compression is based on the self-similarity that some area in an image exhibits a very similar shape with other areas. This compression technique has very long encoding time although it has high compression ratio and fast decompression. To cut-off the encoding time, most researches have restricted the search of domain blocks for a range block. These researches have been mainly focused on the coherence between a domain block and a range block, while they have not utilized the coherence among range blocks well. Therefore, we give an analysis on the coherence among range blocks in order to develope an efficient fractal Image compression algorithm. We analysis the range blocks according to not only measures for defining the range block coherence but also threshold of each measure. If these results are joined in a prior work of other fractal compression algorithms, it will give a great effectiveness in encoding time.

• Journal of the Korean Society of Radiology
• /
• v.13 no.4
• /
• pp.509-516
• /
• 2019

In the linear transformation method, the original image is divided into a plurality of range blocks, and a partial transform system for finding an optimal domain block existing in the image for each range block is used to adjust the performance of the compression ratio and the picture quality, The nonlinear transformation method uses only the rotation transformation among eight shuffle transforms. Since the search is performed only in the limited domain block, the coding time is faster than the linear transformation method of searching the domain block for any block in the image, Since the optimal domain block for the range block can not be selected in the image, the performance may be lower than other methods. Therefore, the nonlinear transformation method improves the performance by increasing the approximation degree of the brightness coefficient conversion instead of selecting the optimal domain block, The smaller the size of the block, the higher the PSNR value, The higher the compression ratio is increased groups were quadtree block divided to encode the image at best.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1665-1670
• /
• 2004

The general fractal image compression provides a high compression rate, but it requires a large encoding time. In order to overcome this disadvantage, many researchers have introduced various methods that reduce the total number of domain blocks considering their block similarities or control the number of searching domain block depending on its distribution. In this paper, we propose a method that can reduce the number of searching domain blocks employing the variance coherence of intensity values and also the number of range blocks requiring the domain block search through the classification of range blocks. This proposed method effectively reduces the encoding time and also a negligible drop of the quality as compared with the previous methods requiring the search of all range blocks.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.93-96
• /
• 1996

Structured laser light is a widely used method for obtaining 3D range information in Machine Vision. However, The structured laser light method is based on assumption that the surface of objects is Lambertian. When the observed surfaces are highly specularly reflective, the laser light can be detected in various parts on the image due to a specular reflection and secondary reflection. This makes wrong range data and the image sensor unusable for the specular objects. To discriminate wrong range data from obtained image data, we have proposed a new algorithm by using the cross section of image block. To show the performance of the proposed method, a series of experiments was, carried out on: the simple geometric shaped objects. The proposed method shows a dramatic improvement of 3D range data better than the typical structured laser light method.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.589-598
• /
• 2003

In the conventional fractal image compression in the DWT(discrete wavelet transform), the domain and range blocks were classified as B${\times}$B block size first before all domain block for each range block was searched. The conventional method has a disadvantages that the encoding time takes too long, since the domain block for entire image was searched. As an enhancement to such inefficiencies and image quality, this paper proposes wavelet-based fractal image compression with multiscale factors. Thus, this proposed method uses multiscale factor along each level and band to enhance an overall image quality. In encoding process of this method, the range blocks are not searched for all the domain blocks; however, using the self affine system the range blocks are selected from the blocks in the upper level. The image qualify of the conventional method is 32.30[dB], and the proposed method is 35.97[dB]. The image quality is increased by 3.67[dB].

• Structural Engineering and Mechanics
• /
• v.19 no.3
• /
• pp.347-359
• /
• 2005

This paper attempts to develop the analytical model of estimating the fatigue damage using a linear elastic fracture mechanics method. The stress history on a welding member, when a truck passed over a bridge, was defined as a block loading and the crack closure theory was used. These theories explain the influence of a load on a structure. This study undertook an analysis of the stress range frequency considering both dead load stress and crack opening stress. A probability method applied to stress range frequency distribution and the probability distribution parameters of it was obtained by Maximum likelihood Method and Determinant. Monte Carlo Simulation which generates a probability variants (stress range) output failure block loadings. The probability distribution of failure block loadings was acquired by Maximum likelihood Method and Determinant. This can calculate the fatigue reliability preventing the fatigue failure of a welding member. The failure block loading divided by the average daily truck traffic is a predictive remaining life by a day. Fatigue reliability analysis was carried out for the welding member of the bottom flange of a cross beam and the vertical stiffener of a steel box bridge by the proposed model. Results showed that the primary factor effecting failure time was crack opening stress. It was important to decide the crack opening stress for using the proposed model. Also according to the 50% reliability and 90%, 99.9% failure times were indicated.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.265-268
• /
• 2001

In this paper, we designed one-dimensional VLSI array with high speed processing in Fractal image compression. fractal image compression algorithm partitions the original image into domain blocks and range blocks then compresses data using the self similarity of blocks. The image is partitioned into domain block with 50% overlapping. Domain block is reduced by averaging the original image to size of range block. VLSI array is trying to search the best matching between a range block and a large amount of domain blocks. Adjacent domain blocks are overlapped, so we can improve of each block's processing speed using the reuse of the overlapped data. In our experiment, proposed VLSI array has about 25% speed up by adding the least register, MUX, and DEMUX to the PE.

• Journal of Korean Society for Atmospheric Environment
• /
• v.16 no.2
• /
• pp.165-178
• /
• 2000

In this study the effects of block distance have been investigated on the particle deposition efficiency in the collecting cell of two-stage electrostatic precipitator by numerical analysis. Particle trajectories have been changed by the electrostatic and inertial force of particle with the inlet velocity electrostatic number and particle diameter. The total deposition efficiency has a minimum value by the interaction between the effect of particle inertial force and electrostatic force in the collecting cell. The increase of block distance makes the total deposition efficiency decrease under the range of the particle size which has the minimum deposition efficiency. However beyond the range of particle size which has minimum deposition efficiency total deposition efficiency has no trend with the variation of block distance.