Computer Graphics & A Fast Fractal Image Compression Using The Normalized Variance 


Vol. 8,  No. 4, pp. 499-502, Dec.  2001
10.3745/KIPSTA.2001.8.4.499


PDF
  Abstract

Fractal image coding suffers from the long search time of domain pool although it provides many promising properties including the high compression ratio. We find that the normalized variance of a block is independent of contrast, brightness. Using this observation, we introduce a self similar block searching method employing the -dimensional nearest neighbor searching. This method takes O(log N)time for searching the self similar domain blocks for each range block where is the number of domain blocks. PSNR (Peak Signal Noise Ratio) of this method is similar to that of the full search method that requires O(N) time for each range block. Moreover, the image quality of this method is independent of the number of edges in the image.

  Statistics
  Cite this article

[IEEE Style]

J. K. Kim, D. Y. Hamn, Y. C. Wee, H. J. Kimn, "Computer Graphics & A Fast Fractal Image Compression Using The Normalized Variance," The KIPS Transactions:PartA, vol. 8, no. 4, pp. 499-502, 2001. DOI: 10.3745/KIPSTA.2001.8.4.499.

[ACM Style]

Jong Koo Kim, Do Yong Hamn, Young Cheul Wee, and Ha Jine Kimn. 2001. Computer Graphics & A Fast Fractal Image Compression Using The Normalized Variance. The KIPS Transactions:PartA, 8, 4, (2001), 499-502. DOI: 10.3745/KIPSTA.2001.8.4.499.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals