2016
DOI: 10.1109/jsen.2016.2519600
|View full text |Cite
|
Sign up to set email alerts
|

ZM-SPECK: A Fast and Memoryless Image Coder for Multimedia Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 44 publications
(20 citation statements)
references
References 44 publications
0
20
0
Order By: Relevance
“…Although L-BCWT can reduce the complexity of repeated tree-scanning, bit-plane coding, and dynamic lists management of conventional 1D SPIHT, its compression performance remains marginal. ZM-SPECK [25] can remove state-maps and dynamic lists in the existing SPIHT algorithm using linear indexing property of wavelet tree and merged refinement technique. This method can reduce both computational complexity and memory accesses related to dynamic lists.…”
Section: Conventional Compression Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Although L-BCWT can reduce the complexity of repeated tree-scanning, bit-plane coding, and dynamic lists management of conventional 1D SPIHT, its compression performance remains marginal. ZM-SPECK [25] can remove state-maps and dynamic lists in the existing SPIHT algorithm using linear indexing property of wavelet tree and merged refinement technique. This method can reduce both computational complexity and memory accesses related to dynamic lists.…”
Section: Conventional Compression Algorithmsmentioning
confidence: 99%
“…Although the proposed compression method used only one additional line memory and slightly higher operation counts than the FALC method, it achieved better Table 4 Energy complexity of each compression algorithm (sum of microprocessor operation and memory accesses) Type SPIHT [18] L-BCWT [23] ZM-SPECK [25] VLC_NUQ [26] FALC [27] Proposed method 8L JPEG [40] 4L H.264 [13] 4L HEVC [15] #CPU operations (energy cost/frame)…”
Section: Comparison Of Power Consumption Changesmentioning
confidence: 99%
See 1 more Smart Citation
“…The difference between SPECK and SPIHT is that, SPECK does not use trees and spatial structure which span and exploit the similarity across different subbands of a wavelet decomposition; instead, it makes use of sets in the form of blocks of contiguous coefficients within subbands to exploit the clustering of energy in frequency and space in hierarchical structures of the transformed signal. In [10], a modified low-memory implementation of SPECK algorithm (ZM-SPECK) has proposed for quantization and coding of the DWT coefficients. The proposed method completely eliminates the linked lists and only use registers to perform low-level arithmetic/logical operations.…”
Section: Related Workmentioning
confidence: 99%
“…(21,22) With MRA, the original signal was transferred by discrete wavelet decomposition (DWD) and decomposed into a low-frequency approximation (A1) and a high-frequency detail (D1). (23)(24)(25) Then, the first lowfrequency approximation (A1) is decomposed again into a high-frequency detail (D2) and a lowfrequency approximation (A2); similar decompositions can be obtained in accordance with the actual needs of wavelet decomposition layers as shown in Fig. 6.…”
Section: Feature Extraction By Dwt Decomposition For Emg Signalsmentioning
confidence: 99%