loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 IEEE International Conference on Multimedia and Expo
Block-based Fast Compression for Compound Images
Toronto, ON, Canada
July 09-July 12
ISBN: 1-4244-0366-7
Wenpeng Ding, Dept. of Computer Science, Email: wpding3@mail.ustc.edu.cn
Dong Liu, Dept. of Electronic Science and Technology, University of Science and Technology of China. Email: liud@mail.ustc.edu.cn
Yuwen He, Microsoft Research Asia, Beijing 100080 China. Email: heyuwen@tsinghua.org.cn
Feng Wu, Microsoft Research Asia, Beijing 100080 China. Email: fengwu@microsoft.com
This paper presents a novel block-based fast compression (BFC) algorithm for compound images that contain graphics, text and natural images. The images are divided to blocks, which are classified into four different types - smooth blocks, text blocks, hybrid blocks and picture blocks with a fast and effective block-based classification algorithm. Four different coding algorithms are carefully designed for each block type according to their different statistical properties to maximize the compression performance. Simulations show that the BFC algorithm we propose has much lower complexity than DjVu with significant better visual quality at high bit rate, and it also outperforms the popular lossy image coding method JPEG.
Citation:
Wenpeng Ding, Dong Liu, Yuwen He, Feng Wu, "Block-based Fast Compression for Compound Images," icme, pp.809-812, 2006 IEEE International Conference on Multimedia and Expo, 2006
Usage of this product signifies your acceptance of the Terms of Use.