Full-view area coverage in camera sensor networks: Dimension reduction and near-optimal solutions

Shibo He, Dong Hoon Shin, Junshan Zhang, Jiming Chen, Youxian Sun

Research output: Contribution to journalArticle

105 Citations (Scopus)

Abstract

We study the problem of minimum-number full-view area coverage in camera sensor networks, i.e., how to select the minimum number of camera sensors to guarantee the full-view coverage of a given region. Full-view area coverage is challenging because the full-view coverage of a 2-D continuous domain has to be considered. To tackle this challenge, we first study the intrinsic geometric relationship between the full-view area coverage and the full-view point coverage and prove that the full-view area coverage can be guaranteed, as long as a selected full-view ensuring set of points is full-view covered. This leads to a significant dimension reduction for the full-view area coverage problem. Next, we prove that the minimum-number full-view point coverage is NP-hard and propose two approximation algorithms to solve it from two different perspectives, respectively: 1) By introducing a full-view coverage ratio function, we quantify the "contribution" of each camera sensor to the full-view coverage through which we transform the full-view point coverage into a submodular set cover problem and propose a greedy algorithm (GA); and 2) by studying the geometric relationship between the full-view coverage and the traditional coverage, we propose a set-cover-based algorithm (SCA). We analyze the performance of these two approximation algorithms and characterize their approximation ratios. Furthermore, we devise two distributed algorithms that obtain the same approximation ratios as GA and SCA, respectively. Finally, we provide extensive simulation results to validate our analysis.

Original languageEnglish (US)
Article number7321040
Pages (from-to)7448-7461
Number of pages14
JournalIEEE Transactions on Vehicular Technology
Volume65
Issue number9
DOIs
StatePublished - Sep 1 2016

Fingerprint

Dimension Reduction
Sensor networks
Sensor Networks
Coverage
Optimal Solution
Camera
Cameras
Approximation algorithms
Sensors
Set Cover
Parallel algorithms
Greedy Algorithm
Approximation Algorithms
Sensor
Approximation
Distributed Algorithms
Set of points
Quantify
NP-complete problem

Keywords

  • Camera sensor network
  • Distributed algorithms
  • Full-view area coverage
  • Full-view point coverage

ASJC Scopus subject areas

  • Automotive Engineering
  • Aerospace Engineering
  • Computer Networks and Communications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Full-view area coverage in camera sensor networks : Dimension reduction and near-optimal solutions. / He, Shibo; Shin, Dong Hoon; Zhang, Junshan; Chen, Jiming; Sun, Youxian.

In: IEEE Transactions on Vehicular Technology, Vol. 65, No. 9, 7321040, 01.09.2016, p. 7448-7461.

Research output: Contribution to journalArticle

He, Shibo ; Shin, Dong Hoon ; Zhang, Junshan ; Chen, Jiming ; Sun, Youxian. / Full-view area coverage in camera sensor networks : Dimension reduction and near-optimal solutions. In: IEEE Transactions on Vehicular Technology. 2016 ; Vol. 65, No. 9. pp. 7448-7461.
@article{f8f35d2c9a2a4159b6d771ec51eb0a83,
title = "Full-view area coverage in camera sensor networks: Dimension reduction and near-optimal solutions",
abstract = "We study the problem of minimum-number full-view area coverage in camera sensor networks, i.e., how to select the minimum number of camera sensors to guarantee the full-view coverage of a given region. Full-view area coverage is challenging because the full-view coverage of a 2-D continuous domain has to be considered. To tackle this challenge, we first study the intrinsic geometric relationship between the full-view area coverage and the full-view point coverage and prove that the full-view area coverage can be guaranteed, as long as a selected full-view ensuring set of points is full-view covered. This leads to a significant dimension reduction for the full-view area coverage problem. Next, we prove that the minimum-number full-view point coverage is NP-hard and propose two approximation algorithms to solve it from two different perspectives, respectively: 1) By introducing a full-view coverage ratio function, we quantify the {"}contribution{"} of each camera sensor to the full-view coverage through which we transform the full-view point coverage into a submodular set cover problem and propose a greedy algorithm (GA); and 2) by studying the geometric relationship between the full-view coverage and the traditional coverage, we propose a set-cover-based algorithm (SCA). We analyze the performance of these two approximation algorithms and characterize their approximation ratios. Furthermore, we devise two distributed algorithms that obtain the same approximation ratios as GA and SCA, respectively. Finally, we provide extensive simulation results to validate our analysis.",
keywords = "Camera sensor network, Distributed algorithms, Full-view area coverage, Full-view point coverage",
author = "Shibo He and Shin, {Dong Hoon} and Junshan Zhang and Jiming Chen and Youxian Sun",
year = "2016",
month = "9",
day = "1",
doi = "10.1109/TVT.2015.2498281",
language = "English (US)",
volume = "65",
pages = "7448--7461",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Full-view area coverage in camera sensor networks

T2 - Dimension reduction and near-optimal solutions

AU - He, Shibo

AU - Shin, Dong Hoon

AU - Zhang, Junshan

AU - Chen, Jiming

AU - Sun, Youxian

PY - 2016/9/1

Y1 - 2016/9/1

N2 - We study the problem of minimum-number full-view area coverage in camera sensor networks, i.e., how to select the minimum number of camera sensors to guarantee the full-view coverage of a given region. Full-view area coverage is challenging because the full-view coverage of a 2-D continuous domain has to be considered. To tackle this challenge, we first study the intrinsic geometric relationship between the full-view area coverage and the full-view point coverage and prove that the full-view area coverage can be guaranteed, as long as a selected full-view ensuring set of points is full-view covered. This leads to a significant dimension reduction for the full-view area coverage problem. Next, we prove that the minimum-number full-view point coverage is NP-hard and propose two approximation algorithms to solve it from two different perspectives, respectively: 1) By introducing a full-view coverage ratio function, we quantify the "contribution" of each camera sensor to the full-view coverage through which we transform the full-view point coverage into a submodular set cover problem and propose a greedy algorithm (GA); and 2) by studying the geometric relationship between the full-view coverage and the traditional coverage, we propose a set-cover-based algorithm (SCA). We analyze the performance of these two approximation algorithms and characterize their approximation ratios. Furthermore, we devise two distributed algorithms that obtain the same approximation ratios as GA and SCA, respectively. Finally, we provide extensive simulation results to validate our analysis.

AB - We study the problem of minimum-number full-view area coverage in camera sensor networks, i.e., how to select the minimum number of camera sensors to guarantee the full-view coverage of a given region. Full-view area coverage is challenging because the full-view coverage of a 2-D continuous domain has to be considered. To tackle this challenge, we first study the intrinsic geometric relationship between the full-view area coverage and the full-view point coverage and prove that the full-view area coverage can be guaranteed, as long as a selected full-view ensuring set of points is full-view covered. This leads to a significant dimension reduction for the full-view area coverage problem. Next, we prove that the minimum-number full-view point coverage is NP-hard and propose two approximation algorithms to solve it from two different perspectives, respectively: 1) By introducing a full-view coverage ratio function, we quantify the "contribution" of each camera sensor to the full-view coverage through which we transform the full-view point coverage into a submodular set cover problem and propose a greedy algorithm (GA); and 2) by studying the geometric relationship between the full-view coverage and the traditional coverage, we propose a set-cover-based algorithm (SCA). We analyze the performance of these two approximation algorithms and characterize their approximation ratios. Furthermore, we devise two distributed algorithms that obtain the same approximation ratios as GA and SCA, respectively. Finally, we provide extensive simulation results to validate our analysis.

KW - Camera sensor network

KW - Distributed algorithms

KW - Full-view area coverage

KW - Full-view point coverage

UR - http://www.scopus.com/inward/record.url?scp=84990931786&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84990931786&partnerID=8YFLogxK

U2 - 10.1109/TVT.2015.2498281

DO - 10.1109/TVT.2015.2498281

M3 - Article

AN - SCOPUS:84990931786

VL - 65

SP - 7448

EP - 7461

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 9

M1 - 7321040

ER -