2003
DOI: 10.1016/s0923-5965(03)00049-3
|View full text |Cite
|
Sign up to set email alerts
|

Significance map pruning and other enhancements to SPIHT image coding algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 21 publications
0
12
0
Order By: Relevance
“…The coding results of the EZBC [8], Stack X-tree [5], enhanced SPIHT [3], Modified SFQ [2] and EBCOT [15] are listed in Table 2. Note that the PSNR results for Goldhill are not present in [15], we take them from [8], by considering the JPEG2000 Generic Scalable modality.…”
Section: Summary Of Coding Algorithm and Experimental Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The coding results of the EZBC [8], Stack X-tree [5], enhanced SPIHT [3], Modified SFQ [2] and EBCOT [15] are listed in Table 2. Note that the PSNR results for Goldhill are not present in [15], we take them from [8], by considering the JPEG2000 Generic Scalable modality.…”
Section: Summary Of Coding Algorithm and Experimental Resultsmentioning
confidence: 99%
“…The zerotree idea was first introduced by Shapiro's embedded zerotree wavelet (EZW) [14] and then reformulated with the set partitioning in hierarchical trees (SPIHT) algorithm by Said and Pearlman [13]. Since the idea of embedded zerotree coding is so attractive, many improved schemes [8,5,3] have been proposed since then. Because EZW-like coders can provide efficient coding for still images and visual textures, the MPEG-4 standard also uses it in the visual texture mode [10].…”
Section: Introductionmentioning
confidence: 99%
“…C(i, j) is the wavelet coefficient value at position (i, j). In a pass p, the decision for a coefficient is made as follows [8]:…”
Section: B Spiht Encodermentioning
confidence: 99%
“…Though this type of method has improved the rate-distortion performance greatly at some truncation points, it cannot optimize rate-distortion at any arbitrary truncation point. SMPAOET_SPIHT [4] partitions bitplanes into passes, and optimized rate-distortion performances with rate-distortion contributions for these passes are estimated by pre-coding. However, SMPAOET_SPIHT has high complexity because it estimates the rate-distortion contribution of every pass by pre-coding.…”
Section: Rate-distortion Optimization Using Context-based Weightingmentioning
confidence: 99%
“…Danyali proposed highly scalable image compression based on SPIHT for network applications [3], which can produce a quick preview. Bayazit proposed an enhanced SPIHT image coding algorithm using R-D optimization and high-order context arithmetic coding [4]. The above three methods are all based on the zerotree algorithm of spatial trees, and they all make full use of inter-band correlation.…”
Section: Introductionmentioning
confidence: 99%