• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2789-2800
• /
• 1996

Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.2
• /
• pp.93-99
• /
• 2013

Fractal theory has been adopted as an effective tool for modelling complex and irregular natural phenomena facing in the fields of Computer Science, Engineering, Medical, Climatology and so on. In this paper, we presents an algorithm which enhances the performance of the triangular prism method(TPM) which has been widely used for fractal dimension extraction of natural terrains and images. For this, existing sampling methods are analyzed and a new sampling method which takes their merits is proposed. The effectiveness of the proposed algorithm is tested on fractal terrain maps and its performance is compared with that of other methods.

• The Journal of Natural Sciences
• /
• v.7
• /
• pp.67-73
• /
• 1995

In this paper, a new texture segmentation-based image coding technique which performs segmentation based on properties of the human visual system (HVS) is presented. This method solves the problems of a segmentation-based image coding technique with constant segments by proposing a methodology for segmenting an image into texturally homogeneous regions with respect to the degree of roughness as perceived by the HVS. The segmentation is accomplished by thresholding the fractal dimension so that textural regions are classified into three texture classes; perceived constant intensity, smooth texture, and rough texture. It is very important to determine the proper block size for estimating the fractal dimension. Good quality reconstructed images are obtained with about 0.1 to 0.25 bit per pixel (bpp) for many different types of imagery.

• Journal of Digital Contents Society
• /
• v.5 no.3
• /
• pp.199-204
• /
• 2004

A problem of many fractal image compression algorithms providing good quality at low bit rate is that the decoding time rests on an iterative procedure whose complexity is imag-dependent. This paper proposes an iterative-free fractal image decoding algorithm to reduce the decoding time. In the proposed method, under the encoder previously with the same codebook image as an initial image to be used at the decoder, the fractal coefficients are obtained through calculating the similarity between the codebook image and an input image to be encoded. As the decoding time could be remarkably reduced. For verifying the validity and universality of proposed method, We evaluated and analyzed the performance of decoding time and image quality for a number of still images and a moving picture with different distributed characteristics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.296-306
• /
• 2003

In this paper, algorithm for non-iterative decoding method is proposed and fractal image decoder based on non-iterative fractal decoding algorithm used general purpose digital signal processors is designed and implemented. The algorithm is showed that the attractor image can be obtained analytically whe n the image is encoded using the fractal algorithm proposed by Monro and Dudbridge, in which the corresponding domain block for a range block is fifed. Using the analytical formulas, we can obtain the attractor image without iteration procedure. And we get general formulas of obtained analytical formulas. Computer simulation results for various test images show that we can increase the image decoding speed by more than five times when we use the analytical formulas compared to the previous iteration methods. The fractal image decoder contains two ADSP2181's and perform image decoding by three stage pipeline structure. The performance tests of the implemented decoder is elapsed 31.2ms/frame decoding speed for QCIF data when all the frames are decoded. The results enable us to process the real-time fractal decoding over 30 frames/sec.

• Imaging Science in Dentistry
• /
• v.53 no.2
• /
• pp.153-159
• /
• 2023

Purpose: The objective of this study was to assess the fractal dimension, lacunarity, trabecular microarchitecture parameters, and cortical linear measurements in the mandibles of male and female individuals to identify differences between them. Materials and Methods: In total, 116 cone-beam computed tomography scans of healthy individuals of different ages (57 men and 59 women, aged between 20 and 60 years) were selected. The following bone parameters were measured: 1) buccal, lingual, and basal cortical bone thickness in 5 standard parasagittal sections (the midline, the left and right sides of the lower lateral incisors, and the left and right sides of the lower canines); 2) the bone volume fraction of 10 sequential axial sections from each patient by creating a volume of interest in the area between the lower canines; and 3) fractal dimension and lacunarity using grayscale images of the same region of the volume of interest in the anterior mandible. Spearman correlation coefficients and the Mann-Whitney test were used. Results: A significant and positive correlation was found between age and cortical thickness, especially in the region of the central incisors. Significant differences between sexes in terms of fractal dimension, lacunarity, and bone volume were found. Women revealed lower fractal dimension values and higher lacunarity and bone volume ratio values than men. Conclusion: Fractal dimension, lacunarity, trabecular bone volume, and cortical thickness were different between men and women of different ages.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2005.03a
• /
• pp.1205-1210
• /
• 2005

The behavior of rock mass and solute(e.g. groundwater, radioactivity) flow in fractured rock can be directly influenced by joint roughness. The characteristics of joint roughness is also a main factor for the rock classification(e.g. RMR, Q system) which is usually used in tunnel design. Nevertheless, most of JRC estimation has been carried out only by the examination with the naked eye. This JRC estimation has a lack of objectivity because each investigator judges JRC by his subjective opinion. Therefore, it will be desirable that the assessment of JRC is performed by a numerical analysis which can give a quantitative value corresponding to the characteristics of a roughness curve. Meanwhile, roughness curves for joint surfaces which are observed in drill cores have been obtained only along linear profiles. Although roughness curves are measured in the same joint surface, they can frequently show diverse aspects in a standpoint of roughness characteristics. If roughness curves can be measured along the elliptical circumferences of joint surfaces from core scanning images or Televiewer images, they will certainly be more comprehensive than those measured along linear profiles for roughness characteristics of joint surfaces. This study is focus on dealing with (1) extracting automatically roughness curves from core scan image or Televiewer image, (2) improving the accuracy of quantitative assessment of JRC using fractal dimension concept.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.816-820
• /
• 2009

In landscape simulatin, it is necessary to express very realistic image generated by computer graphics. One solution is to use texture mapping; however, it needs a lot of work and time to obtain images for texture mapping since there are huge variety of images for buildings, roads, stations and so on, and the landscape image is diverse due to the weather and time. Especially, weathered images such as stain on walls, crack on roads and so forth, are needed to make the landscape image very realistic. These weathered images do not have to be strict so that it saves a lot of work and time for obtaining the images for texture mapping if we can generate a variety of weathered images automatically. Therefore, this paper describes how to generate a variety of weathered images automatically by changing the weathered shape of the original image.

• Journal of IKEEE
• /
• v.2 no.2 s.3
• /
• pp.185-193
• /
• 1998

Fractal-based monochrome image coding method can be easily applied for color image compression by splitting the color image into different primary spectral channels such as RGB, YIQ or $YC_bC_r$, and encoding each channel independently According to this method, it needs to repeat the fractal coding for each channel, so it have the problem of encoding time. In this paper, a fractal-based coder for color still image is proposed which features the enhancement of compression rate and the reduction of coding time. As the result of the experiment where the proposed algorithm is applied far color images, the compression rate is enhanced by 28 : 1 above with average PSNR value $28{\sim}29[dB]$, do not lossless encoding process using JPEG. And the encoding time is reduced by maximum 11.5 %.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.3 no.3
• /
• pp.177-182
• /
• 2002

In this paper, we present a mathematical theory and algorithm consoucting some fractal sets. Among such fractal sets, the degree-n bifurcation set as well as the Julia sets is defined by extending the concept of the Mandelbrot set to the complex polynomial $Z^n$+c($c{\epsilon}C$, $n{\ge}2$). Some properties of the degree-n bifurcation set and the Julia sets have been theoretically investigated including the symmetry, periodicity, boundedness, and connectedness. An efficient algorithm constructing both the degree-n bifurcation let and the Julia sets is proposed using theoretical results. The mouse-operated software called "MANJUL" has been developed for the effective construction of the degree-n bifurcation set and the Julia sets in graphic environments with C++ programming language under the windows operating system. Simple mouse operations can construct ann magnify the degree-n bifurcation set as well af the Julia sets. They not only compute the component period but also save the images of the degree-n bifurcation set and the Julia sets to visually confirm various properties and the geometrical structure of the sets. A demonstration has verified the useful versatility of MANJUL.of MANJUL.