Referenced Items are not available for this document.
A problem of speeding-up the fractal compression of still images is discussed. The techniques based on analysis of local variance for range blocks and domain blocks are proposed and considered. An algorithm for fast search of domain blocks corresponding to the range block in the best manner is described. It is shown that a reduction of search CPU time by several times can be provided and the obtained benefit depends upon the complexity of image to be compressed and the range block size. The proposed procedure for speeding up the fractal compression does not result in additional losses in recovered image quality
Published in:
Image Processing, 2001. Proceedings. 2001 International Conference on
(Volume:2
)
Date of Conference: 7-10 Oct 2001
- Page(s):
- 419 - 422 vol.2
- Meeting Date :
- 07 Oct 2001-10 Oct 2001
- Print ISBN:
- 0-7803-6725-1
- INSPEC Accession Number:
- 7211136
- Conference Location :
- Thessaloniki
- Digital Object Identifier :
- 10.1109/ICIP.2001.958517
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
