• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.691-700
• /
• 1995

Most fractal image codings using fractal concept require long encoding time because a large amount of computation is needed to find an optimal affine transformation point. Such a problem can be solved by designing a block classifier fitted to characteristics of image blocks. In general, it is possible to predict more precise and various types of blocks in frequency domain than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform). This classifier has merits to enhance the quality of decoded images as well as to reduce the encoding time meeting fractal features. AC coefficient values in frequency domain make it possible to predict various types of blocks. As the results, the number of comparisons between a range block and the correspoding domain blocks to reach an optimal affine transformation point can be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two isometric transformations by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.365-372
• /
• 2000

he paper introduces evolutionary computing to Fractal Image Compression(FIC). In Fractal Image Compression(FIC) a partitioning of the image into ranges is required. As a solution to this problem there is a propose that evolution computation should be applied in image partitionings. Here ranges are connected sets of small square image blocks. Populations consist of $N_p$ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces $\sigma$ children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion Collage Theorem. As the optimum image includes duplication in image data, it gets smaller in saving space more efficient in speed and more capable in image quality than any other technique in which other coding is used. Fractal Image Compression(FIC) using evolution computation in multimedia image processing applies to such fields as recovery of image and animation which needs a high-quality image and a high image-compression ratio.

• The Journal of the Korea Contents Association
• /
• v.9 no.4
• /
• pp.27-33
• /
• 2009

Selection of the Lagrangian multiplier is a key factor to determine the performance of Rate-Distortion Optimization (RDO) in video coding. JM, reference S/W of H.264, employs only one RDO model for all macroblock. However, since the characteristics of macroblocks are different, RDO model adaptive to their characteristics can give some performance improvement. In this paper, we propose an RDO algorithm adaptive to characteristics of macroblocks. We empirically obtain the optimal Lagrangian multipliers considering characteristics of macroblocks. For performance evaluation, the proposed method is applied to JM10.2 and, as a result, we have PSNR gain of 0.2dB on average.

• Journal of the Korean Society of Radiology
• /
• v.12 no.4
• /
• pp.505-510
• /
• 2018

In this study, we allocate bits by quantizing these fractal coefficients through a quantizer which can extract the probability distribution. In the coding process of IFS, a variable size block method is used to shorten the coding time and improve the compression ratio. In the future, it will be necessary to further improve the coding time and the compression rate while maintaining the best image quality in the fractal coding process.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.598-601
• /
• 2011

스케일러블 비디오 코딩은 레이어간 예측 기능을 이용하여 시뮬케스트 코딩에 비해 코딩 효율을 높인다. 하지만 스케일러블 비디오 코딩의 레이어간 예측으로는, 인트라 픽셀(inta pixel). 모션 정보(motion vector information), 레지듀얼(residual)등의 예측이 수행되는데, 이는 많은 계산 시간을 소요하게 되며, 시뮬케스트에 비해 코딩 시간이 증가하게 된다. 특히 인코더의 경우, 가장 최적의 모드를 선택하기 위하여, 기존 H.264 AVC에서 사용하는 예측을 수행한 뒤, 부가적으로 스케일러블 비디오 코딩의 레이어간 예측을 수행하기 때문에, 하나의 영상이 많은 레이어를 포함할수록 인코딩에 의한 계산부하가 매우 증가하게 된다. 본 논문에서는 이를 해결하기 위해, 멀티 코어 이용하여 레이어별로 병렬처리가 가능하도록 하는 스케일러블 비디오 인코더의 구조를 제안한다. 이로써 하나의 영상이 포함하는 레이어의 수가 증가함에 따라 발생하는 인코딩 계산 부하를 줄이도록 하였다. 그리하여 본 논문에서 제안하는 구조를 적용하였을 때, 2개의 공간영역으로의 스케일러빌리티를 가지는 영상들에 대해서는 평균 24.8%의 속도가 향상되었고, 1개의 공간영역과 1개의 화질 영역으로의 스케일러빌리티를 가지는 영상들에 대해서는 평균 82%의 속도 향상을 보였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1383-1391
• /
• 1999

This paper presents a rate control method that minimizes global distortion under given target bit rates for video communication. This method makes the quality of reconstructed images better than that of the conventional ones based on R-D model at the same bit rates. Given a set of quantizers, a sequence of macroblocks to be quantized selects the optimal quantizer for each macroblock so that the total cost measure is minimized and the finite buffer is never in overflow. To solve this problem we provide a heuristic algorithm based on Lagrangian optimization using an operational rate-distortion framework and a quantization method follows H.263recommendation.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.362-368
• /
• 2005

This paper is related to the fast block matching algorithm, especially a method for expanding the search pattern using the second local matching point in the adaptive hexagonal search. To reduce the local minima problem in fast motion estimation, the proposed method expands the search pattern by adding new searching points selected by using the second local matching point to conventional search pattern formed by the first local matching point in the adaptive hexagonal search. According to estimating the motion vector by applying block matching algorithm based on hexagonal search to the expanded search pattern, the proposed method can effectively carry out fast motion estimation to improve the performance in terms of compensated image quality.

• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.23-29
• /
• 2002

This paper suggest the image compression that is needed to process PACS in medical information system. The image decoding method is used Linear-predictor and Lloyd-Max quantizer(quantization) in the Wavelet transform domain. Wavelet Transform Method is processed the multi-resolution by dividing image into 10 sub-bands of 3 levels. Low frequency domain that is sensitive to human visual characteristic is encoded by DPCM which is lossless encoding methods, and Lloyed-Max quantizer, the optimal quantizer for reducing ringing and aliasing in the image of inter sub-band, is used in the remaining high frequency domain of sub-band. The examination verifies that decompressed images are superior by the result that PSNR is 28.53dB on the input image, 512$\times$152 abdominal CT image and Chest image.

• Journal of radiological science and technology
• /
• v.35 no.4
• /
• pp.293-298
• /
• 2012

In digital mammography, Exposure factor were automatically chosen using by measurement breast thickness and the density of mammary gland. It may cause a increase glandular dose. The purpose of this study was to investigate optimal image quality in digital magnification mammography to decrease radiation exposure of patient dose. Auto mode gives the best image quality however, AGD showed better image quality. Image quality of manual mode passed phantom test and SNR at 55% mAs of auto mode commonly used in the digital magnification mammography. Also it could reduce AGD. According to result, manual mode may reduce the unnecessary radiation exposure in digital magnification mammography.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.98-100
• /
• 2012

본 논문에서는 좌우 해상도가 서로 다른 융합형 3DTV 시스템에서 합성된 3D 영상의 화질을 개선하는 방법인 조건부 대체 알고리듬에 적용하기 위한 비트율 제어기법을 제안한다. 조건부 대체 알고리듬에서는 쿼드트리 형태의 가변크기 블록마다 좌우 영상간의 양안시차 정보를 활용하되, 이 정보의 전송을 위해서 부가적인 대역폭이 요구되기 때문에 전송 대역폭의 상황에 따라 부가 정보의 양을 효율적으로 조절할 필요가 있다. 이를 위해 비용함수를 정의하고 가중치를 적용하여 최적의 모드를 결정하는 방법을 제안한다.