2008
DOI: 10.1134/s1064226908060065
|View full text |Cite
|
Sign up to set email alerts
|

A modified-set partitioning in hierarchical trees algorithm for real-time image compression

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
14
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 10 publications
0
14
0
Order By: Relevance
“…Moreover, a wavelet lifting scheme is adopted to speed up the coding process. A modified SPIHT algorithm for realtime image compression, which requires less execution time and less memory usage than SPIHT, is presented in [33]. Instead of three lists, the authors use merely one list to store the coordinates of wavelet coefficients, and they merge the sorting pass and the refinement pass together as one scan pass.…”
Section: Spiht Background Spiht Introduced Inmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, a wavelet lifting scheme is adopted to speed up the coding process. A modified SPIHT algorithm for realtime image compression, which requires less execution time and less memory usage than SPIHT, is presented in [33]. Instead of three lists, the authors use merely one list to store the coordinates of wavelet coefficients, and they merge the sorting pass and the refinement pass together as one scan pass.…”
Section: Spiht Background Spiht Introduced Inmentioning
confidence: 99%
“…Many attempts to enhance SPIHT features and reduce its limitations have been suggested in the literature, for instance [31][32][33]. In [31], the authors apply the concept of networkconscious image compression to the SPIHT algorithm to improve its performance under lossy conditions.…”
Section: Spiht Background Spiht Introduced Inmentioning
confidence: 99%
“…One well-known tool used in the image compression done in the resource-constrained devices is so-called low complexity Discrete Cosine Transform (DCT) (Ahmed, Natarajan, & Rao, 1974;Amutha, 2013;Bayer & Cintra, 2012;Chandra & Chakrabarty, 2001;da Silveira, Oliveira, Bayer, Cintra, & Madanayake, 2017;Kaddachi et al, 2012;Pearlman, Islam, Nagaraj, & Said, 2004;Pennebaker, Mitchell, Langdon, & Arps, 1988), which was initially developed to be used in very resource-constrained platforms, for example low power processors in the WSNs. Certain applications involve real-time (Akter, Reaz, Mohd-Yasin, & Choong, 2008;Callahan, 1995) image compression performed directly on-board (Yu, Vladimirova, & Sweeting, 2009) used in several missions to meet the specialized needs of (for example) deep-space applications while achieving state-of-the-art compression effectiveness.…”
Section: Related Workmentioning
confidence: 99%
“…However, 1D SPIHT memory access counts are too high during the process of repetitively arranging key data in bit manipulations after wavelet transform for transmission, resulting in excessive power consumption. Several studies have been conducted to reduce memory accesses and improve compression ratio of 1D SPIHT [19][20][21][22], including line-based backward coding of wavelet trees (L-BCWT) [23,24] and zero memory set partitioned embedded block (ZM-SPECK) [25]. However, energy efficiency of systems after adopting these modified SPIHT methods needs to be further improved to satisfy energy requirements of low-power IoT devices.…”
Section: Introductionmentioning
confidence: 99%