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

3-D Compression-Oriented Image Content Correlation Model for Wireless Visual Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…There are also other works proposing solutions from other perspectives which could improve the network nodes’ energy efficiency. For example, a clustering based data prediction transmission scheme was proposed in paper [ 16 ]. In this scheme, according to mathematical relationship of the expected seamless coverage ratio and the number of required cluster heads, the initial probability for the nodes to contend for the cluster heads are restrained.…”
Section: Methodsmentioning
confidence: 99%
“…There are also other works proposing solutions from other perspectives which could improve the network nodes’ energy efficiency. For example, a clustering based data prediction transmission scheme was proposed in paper [ 16 ]. In this scheme, according to mathematical relationship of the expected seamless coverage ratio and the number of required cluster heads, the initial probability for the nodes to contend for the cluster heads are restrained.…”
Section: Methodsmentioning
confidence: 99%
“…However, the authors did not consider the construction of a defense barrier. Yang et al [12] introduced the concept of weighted barrier graph (WBG) aiming to model the barrier coverage problem. They demonstrated that the problem of finding the number of visual sensors is equivalent to the problem of constructing the shortest path from the source node to the destination node on the WBG.…”
Section: B Barrier Coverage In Wvsnsmentioning
confidence: 99%
“…As an extension of study [12], Wang et al [13] further proved that the construction of a barrier with k-coverage is equivalent to finding k vertex-disjoint paths with the minimum total length on the WBG. Then, an algorithm based on previous work, called Vertex-Disjoint Path approach, was proposed for solving the problem of k-barrier coverage.…”
Section: B Barrier Coverage In Wvsnsmentioning
confidence: 99%
“…The supply of smart devices with high performance and the rapid development of cameras with good quality enabled the general public to easily and freely acquire video data through the high-speed wired and wireless Internet. Such image data include various kinds of video big data such as photos, CCTV videos, black box images of cars, UCC (user created contents), and movies [1][2][3][4][5]. In addition, the acquired image big data are useful in a variety of related practical applications such as robot vision, content-based image retrieval, real-time surveillance, human-computer interaction, face detection, and autonomous driving [6][7][8][9][10].…”
Section: Introductionmentioning
confidence: 99%