Share Email Print
cover

Proceedings Paper

Image compression using quad-tree coding with morphological dilation
Author(s): Weiwei Jiang; Licheng Jiao; Lei Wang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we propose a new algorithm which integrates morphological dilation operation to quad-tree coding, the purpose of doing this is to compensate each other's drawback by using quad-tree coding and morphological dilation operation respectively. New algorithm can not only quickly find the seed significant coefficient of dilation but also break the limit of block boundary of quad-tree coding. We also make a full use of both within-subband and cross-subband correlation to avoid the expensive cost of representing insignificant coefficients. Experimental results show that our algorithm outperforms SPECK and SPIHT. Without using any arithmetic coding, our algorithm can achieve good performance with low computational cost and it's more suitable to mobile devices or scenarios with a strict real-time requirement.

Paper Details

Date Published: 14 November 2007
PDF: 6 pages
Proc. SPIE 6790, MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications, 67904U (14 November 2007); doi: 10.1117/12.750012
Show Author Affiliations
Weiwei Jiang, Xidian Univ. (China)
Licheng Jiao, Xidian Univ. (China)
Lei Wang, Xidian Univ. (China)


Published in SPIE Proceedings Vol. 6790:
MIPPR 2007: Remote Sensing and GIS Data Processing and Applications; and Innovative Multispectral Technology and Applications

© SPIE. Terms of Use
Back to Top