Merged quadtree fractal image compression

Yigang Wang; Yiwen Jin; Qunsheng Peng

doi:10.1117/1.601749

1 August 1998 Merged quadtree fractal image compression

Yigang Wang, Yiwen Jin, Qunsheng Peng

Author Affiliations +

Optical Engineering, Vol. 37, Issue 8, (August 1998). https://doi.org/10.1117/1.601749

The quadtree method is usually used in fractal block coding, but its efficiency is very low. We propose a new scheme, merged quadtree partitioning (MQP), for efficient image compression. It is an improved quadtree method, and can merge the quadtree nodes on the same level and on the different levels to share one transformation. As the merged nodes describe irregular regions with boundaries approximating the image edges, which need only one transformation, the total number of transformations required by MQP is much less than by the quadtree method. Thus, we obtain a greater compression ratio. In addition, we speed up MQP method by using the relationship between the search of the merged range and that of its parent range, and obtain a shorter encoding time than with other partitioning schemes.

Citation Download Citation

Yigang Wang, Yiwen Jin, and Qunsheng Peng "Merged quadtree fractal image compression," Optical Engineering 37(8), (1 August 1998). https://doi.org/10.1117/1.601749

Published: 1 August 1998

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE