24 August 1999 Fast fractal image compression based on HV partition
Author Affiliations +
Proceedings Volume 3846, Multimedia Storage and Archiving Systems IV; (1999) https://doi.org/10.1117/12.360451
Event: Photonics East '99, 1999, Boston, MA, United States
Abstract
This paper presents a new scheme to speed up fractal image compression based on HV partition. In this scheme, we propose a new approach based on character track that can speed up the process of searching appropriate domain blocks. In this technique we first abstract the range block's characters, then when we searching in the domain block pool, only domain blocks which characters are exactly fit with the range block could transact the process of matching. The experimental result shows that with this technique we can improve the speed of encoding more one hundred times than the original algorithm.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Guorui Jiang, Guorui Jiang, Yuzhuo Zhong, Yuzhuo Zhong, Shi-Qiang Yang, Shi-Qiang Yang, Bo Yuan, Bo Yuan, } "Fast fractal image compression based on HV partition", Proc. SPIE 3846, Multimedia Storage and Archiving Systems IV, (24 August 1999); doi: 10.1117/12.360451; https://doi.org/10.1117/12.360451
PROCEEDINGS
9 PAGES


SHARE
RELATED CONTENT

Wavelet-based fractal image compression
Proceedings of SPIE (September 25 2003)
Domain indexing for fractal image compression
Proceedings of SPIE (May 30 2000)
Solution of fractal equation
Proceedings of SPIE (March 03 1995)
IFS-based image geometry transform
Proceedings of SPIE (November 29 2007)
Fast fractal image compression with triangulation wavelets
Proceedings of SPIE (October 19 1998)

Back to Top