2018
DOI: 10.3390/s18041231
|View full text |Cite
|
Sign up to set email alerts
|

An Energy-Efficient Compressive Image Coding for Green Internet of Things (IoT)

Abstract: Aimed at a low-energy consumption of Green Internet of Things (IoT), this paper presents an energy-efficient compressive image coding scheme, which provides compressive encoder and real-time decoder according to Compressive Sensing (CS) theory. The compressive encoder adaptively measures each image block based on the block-based gradient field, which models the distribution of block sparse degree, and the real-time decoder linearly reconstructs each image block through a projection matrix, which is learned by … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 25 publications
0
11
0
Order By: Relevance
“…After that, the base JND threshold for each N x N block is computed using the following formula: where i, j are the horizontal and vertical indices of the DCT coefficient at location (i; j) for i; j = 0,…….,N -1 and a = 1.33, b = 0.11, c = 0.18, d = 0.6, e = 0.25. Also, i φ and j φ are defined as: (2) and the spatial frequency of the (i, j)-th DCT coefficient is defined as…”
Section: Methodsmentioning
confidence: 99%
“…After that, the base JND threshold for each N x N block is computed using the following formula: where i, j are the horizontal and vertical indices of the DCT coefficient at location (i; j) for i; j = 0,…….,N -1 and a = 1.33, b = 0.11, c = 0.18, d = 0.6, e = 0.25. Also, i φ and j φ are defined as: (2) and the spatial frequency of the (i, j)-th DCT coefficient is defined as…”
Section: Methodsmentioning
confidence: 99%
“…The same measurement matrix measures the raster scan vector of each block. Since different blocks contain different amounts of valuable information, adaptive block compressed sensing (ABCS) methods [7][8][9][10][11][12][13][14][15][16] have been proposed to make full use of limited measurement resources.…”
Section: Introductionmentioning
confidence: 99%
“…Zhang et al [19] used the standard deviations of blocks as the allocation factor. Many other image features are also effective for ABCS, such as the spatial entropy of blocks [20], the error between blocks [21], the block-based gradient field [11], the block boundary variation [12], and the statistical texture distinctiveness [9]. Moreover, some researchers combined multiple features to allocate the sampling rate of each block.…”
Section: Introductionmentioning
confidence: 99%
“…Compared with the above-mentioned DR techniques, random projection [ 23 , 24 ] is a better choice, since it avoids the model training, but it is still a challenge to store random projections due to the huge dimensionality of text feature. Compressive sensing (CS) [ 25 27 ], which has recently been rapidly developing, can be regarded as a random projection technique specially for sparse vectors, and it proves that the perfect recovery of sparse vector can be realized by several random projections. CS retains the advantages of random projection in DR and further overcomes the problem of memory with the help of structural random matrices (SRMs) [ 28 , 29 ], which makes CS a potential DR technique for text classification.…”
Section: Introductionmentioning
confidence: 99%