学术探索
学术期刊
新闻热点
数据分析
智能评审

A new method of robust image compression based on the embedded zerotree wavelet algorithm

被引：116
作者：
Creusere, CD
机构：
[1] Naval Air Warfare Center Weapons Division, China Lake
来源：
IEEE TRANSACTIONS ON IMAGE PROCESSING | 1997年 / 6卷 / 10期
关键词：
coefficient partitioning; embedded bitstream; error resilience; image compression; low complexity; wavelets;
D O I：
10.1109/83.624967
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We propose here a wavelet-based image compression algorithm that achieves robustness to transmission errors by partitioning the transform coefficients into groups and independently processing each group using an embedded coder. Thus, a bit error in one group does not affect the others, allowing more uncorrupted information to reach the decoder.
引用
收藏
页码：1436 / 1442
页数：7
相关论文
共 10 条
[1]  
[Anonymous], 1993, Ten Lectures of Wavelets
[2]   BROADCAST CHANNELS [J].
COVER, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (01) :2-+
[3]  
CRENSERE CD, 1996, P DAT COMPR C SNOWB, P432
[4]  
CRENSERE CD, 1996, P SOC PHOTO-OPT INS, V2825, P890
[5]   Image coding using parallel implementations of the embedded zerotree wavelet algorithm [J].
Creusere, CD .
DIGITAL VIDEO COMPRESSION: ALGORITHMS AND TECHNOLOGIES 1996, 1996, 2668 :82-92
[6]   PARALLELIZING MALLAT ALGORITHM FOR 2-D WAVELET TRANSFORMS [J].
LU, J .
INFORMATION PROCESSING LETTERS, 1993, 45 (05) :255-259
[7]   A new, fast, and efficient image codec based on set partitioning in hierarchical trees [J].
Said, A ;
Pearlman, WA .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 1996, 6 (03) :243-250
[8]   EMBEDDED IMAGE-CODING USING ZEROTREES OF WAVELET COEFFICIENTS [J].
SHAPIRO, JM .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1993, 41 (12) :3445-3462
[9]   MULTIRATE 3-D SUBBAND CODING OF VIDEO [J].
TAUBMAN, D ;
ZAKHOR, A .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 1994, 3 (05) :572-588
[10]   ARITHMETIC CODING FOR DATA-COMPRESSION [J].
WITTEN, IH ;
NEAL, RM ;
CLEARY, JG .
COMMUNICATIONS OF THE ACM, 1987, 30 (06) :520-540
1