Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Fast image domain fractal compression by DCT domain block matching

Fast image domain fractal compression by DCT domain block matching

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

Fractal image compression entails a computationally costly search for matching image blocks. It is proposed that a block be represented by its DCT coefficients, which may be made invariant to many of the usual block transforms. Owing to the energy packing properties of the DCT, the efficiency of an existing multidimensional nearest neighbour search is improved.

Inspec keywords: discrete cosine transforms; image coding; data compression; fractals; image matching

Other keywords: fractal image compression; DCT coefficients; multidimensional nearest neighbour search; DCT domain block matching; fast image domain fractal compression

Subjects: Other numerical methods; Codes; Optical information, image and video signal processing; Pattern recognition; Information theory; Other numerical methods

References

    1. 1)
      • R.C. Gonzales , R.E. Woods . (1993) Digital image processing.
    2. 2)
      • A.E. Jacquin . Image coding based on a fractal theory of iterated contractive imagetransformations. IEEE Trans. , 18 - 30
    3. 3)
      • Saupe, D.: `Breaking the time complexity of fractal image compression', Technical, 1994.
    4. 4)
      • Fisher, Y., Shen, T.P., Rogovin, D.: `A comparison of fractal methods with DCT (JPEG) and wavelets (EPIC)', Proc. SPIE, Neural and Stochastic Methods in Image and SignalProcessing III, 28–29 July 1994, 2304–16San Diego, CA, .
    5. 5)
      • J.H. Friedman , J.L. Bentley , R.A. Finkel . An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. , 209 - 226
    6. 6)
      • Barthel, K.U., Voyé, T.: `Adaptive fractal image coding in the frequency domain', Proc. Int. Workshop on Image Processing, Theory, Methodology,Systems and Applications, June 1993, Budapest, Hungary.
    7. 7)
      • Y. Fisher , E. Jacobs , R. Boss , J.A. Storer . (1992) Fractal image compression using iterated transforms, Image and text compression.
    8. 8)
      • W.B. Pennebaker , J.L. Mitchell . (1993) JPEG still image data compression standard.
    9. 9)
      • Y. Zhao , B. Yuan . Image compression using fractals and discrete cosine transform. Electron. Lett. , 6 , 474 - 475
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19950582
Loading

Related content

content/journals/10.1049/el_19950582
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address