• Title/Summary/Keyword: fractal image coding

Search Result 63, Processing Time 0.021 seconds

Wavelet-Based Fractal Image Coding Using SAS Method and Multi-Scale Factor (SAS 기법과 다중 스케일 인자를 이용한 웨이브릿 기반 프랙탈 영상 압축)

  • Jeong, Tae Il;Gang, Gyeong Won;Mun, Gwang Seok;Gwon, Gi Yong;Kim, Mun Su
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.4
    • /
    • pp.11-11
    • /
    • 2001
  • 기존의 웨이브릿 기반 프랙탈 압축 방법은 전 영역에 대하여 최적의 정의역을 탐색하므로, 부호화 과정에서 많은 탐색시간이 소요되는 단점이 있다. 그래서 본 논문에서는 웨이브릿 변환영역에서 SAS(Self Affine System) 기법과 다중 스케일 인자를 이용한 웨이브릿 변환 기반 프랙탈 영상 압축 방법을 제안한다. 웨이브릿 기반 영역에서 정의역과 치역을 구성하고, 각각의 치역 블럭에 대해 모든 정의역 블럭을 탐색하는 것이 아니라, 정의역 탐색과정이 필요 없는 SAS 기법을 도입하여 공간적으로 같은 위치에 있는 상위 레벨 블록을 정의역으로 선택한다 그래서 부호화 과정에서 곱셈 계산량을 감소시켜 고속 부호화를 가능하게 한다. 그리고 SAS 기법의 단점인 화질이 떨어지는 단점을 개선하기 위해, 각 레벨별로 서로 다른 스케일 인자를 사 용하여 화질을 개선한다. 그 결과 화질에는 영향을 미치지 않고 부호화 시간과 압축률이 개선되고, 점진적 전송이 가능한 알고리듬을 제안한다.

Image Compression by Linear and Nonlinear Transformation of Computed Tomography (전산화단층촬영의 선형과 비선형변환에 의한 영상압축)

  • Park, Jae-Hong;Yoo, Ju-Yeon
    • 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.

Gaussian Noise Reduction Algorithm using Self-similarity (자기 유사성을 이용한 가우시안 노이즈 제거 알고리즘)

  • Jeon, Yougn-Eun;Eom, Min-Young;Choe, Yoon-Sik
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.5
    • /
    • pp.1-10
    • /
    • 2007
  • Most of natural images have a special property, what is called self-similarity, which is the basis of fractal image coding. Even though an image has local stationarity in several homogeneous regions, it is generally non-stationarysignal, especially in edge region. This is the main reason that poor results are induced in linear techniques. In order to overcome the difficulty we propose a non-linear technique using self-similarity in the image. In our work, an image is classified into stationary and non-stationary region with respect to sample variance. In case of stationary region, do-noising is performed as simply averaging of its neighborhoods. However, if the region is non-stationary region, stationalization is conducted as make a set of center pixels by similarity matching with respect to bMSE(block Mean Square Error). And then do-nosing is performed by Gaussian weighted averaging of center pixels of similar blocks, because the set of center pixels of similar blocks can be regarded as nearly stationary. The true image value is estimated by weighted average of the elements of the set. The experimental results show that our method has better performance and smaller variance than other methods as estimator.