检索结果-内蒙古大学图书馆

2nd IEEE International Conference on Computer and Communications (ICCC)

作者： Li, Chaoyang Rosen, Andrew Johnson, Caroline Bourgeois, Anu G. Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9781467390262

In this paper, we address the full-view coverage holes detection problem and healing solutions. Among many problems confronted in designing camera sensor networks (CSNs), the coverage challenge stands out as one of most fundamental problems. Some CSNs applications such as environment monitoring and animal tracking require covering each point of the target area. However, even if we can deploy camera sensor nodes to make the entire target region fully full-view covered at the very beginning, the nodes can die due to battery drain or environmental causes, which may generate full-view coverage holes in the region. Also, nodes may deviate from their initially assigned locations due to uncontrollable elements, leaving some areas not full-view covered. full-view coverage holes reduce the ability of CSNs to detect events and network reliability. Consequently, it is critical to equip sensor nodes with efficient hole detection and recovery capabilities to ensure whole full-view coverage of the target field. We develop a novel full-view coverage analytical theory to address the full-view coverage holes detections problem, where coordinate system is applied to manipulate equations for fullview covered points, curves, and area. On the other hand, fullview coverage holes can be detected by this theory. The hole's boundary can be represented precisely by coordinates and the area of holes can be calculated quantitatively. This theory can also be utilized to study the relationship between the sensing range or the effective angle of cameras and fullview coverage area, therefore, it can serve as a guideline for designing full-view coverage camera sensor networks.

关键词： camera sensor networks full-view coverage algorithms

来源：评论

学校读者我要写书评

暂无评论

full-view coverage Quasi-Mobile Camera Sensor Network for Maritime Surveillance 10

Full-View Coverage Quasi-Mobile Camera Sensor Network for Ma...

引用

10th International Wireless Communications & Mobile Computing Conference (IWCMC)

作者： Manoufali, Mohamed Kong, Peng-Yong Jimaa, Shihab Khalifa Univ Sci Technol & Res Elect & Comp Engn Dept ECE Brussels Belgium

ISBN: (纸本)9781479909599

coverage of a camera sensor network (CSN) is a critical issue in deploying such network in maritime environment. In such environment, camera sensors will not be stationary after the initial deployment due to the hostile sea environment. Hence, the mobility pattern poses a major limitation on identifying the time-varying coverage. In full-view coverage, target's facing direction has been introduced to judge whether a target's facing direction is guaranteed to be captured. To this end, we exploit full-view coverage in CSN, since image shots at the frontal viewpoint of a given target considerably increase the possibility to detect and recognize the target. In this paper, we have developed a mobility pattern based on wind speed and spring relaxation technique which are used to characterize the total displacement of a given buoy. Furthermore, the average percentage of full-view coverage has been evaluated based on different parameters such as equilateral triangle grid length, sensing radius of camera, wind speed and wave height. Consequently, the proposed model has been validated through MATLAB simulation platform.

关键词： full-view coverage buoy spring and sea wave

来源：评论

学校读者我要写书评

暂无评论

full-view coverage PROBLEMS IN CAMERA SENSOR NETWORKS

FULL-VIEW COVERAGE PROBLEMS IN CAMERA SENSOR NETWORKS

引用

作者： Chaoyang Li Georgia State University

学位级别：博士

Camera Sensor Networks (CSNs) have emerged as an information-rich sensing modality with many potential applications and have received much research attention over the past few years. One of the major challenges in research for CSNs is that camera sensors are different from traditional scalar sensors, as different cameras from different positions can form distinct views of the object in question. As a result, simply combining the sensing range of the cameras across the field does not necessarily form an effective camera coverage, since the face image (or the targeted aspect) of the object may be missed. The angle between the object's facing direction and the camera's viewing direction is used to measure the quality of sensing in CSNs instead. This distinction makes the coverage verification and deployment methodology dedicated to conventional sensor networks unsuitable. A new coverage model called full-view coverage can precisely characterize the features of coverage in CSNs. An object is full-view covered if there is always a camera to cover it no matter which direction it faces and the camera's viewing direction is sufficiently close to the object's facing direction. In this dissertation, we consider three areas of research for CSNS: 1. an analytical theory for full-view coverage; 2. energy efficiency issues in full-view coverage CSNs; 3. Multi-dimension full-view coverage theory. For the first topic, we propose a novel analytical full-view coverage theory, where the set of full-view covered points is produced by numerical methodology. Based on this theory, we solve the following problems. First, we address the full-view coverage holes detection problem and provide the healing solutions. Second, we propose $k$-full-view-coverage algorithms in camera sensor networks. Finally, we address the camera sensor density minimization problem for triangular lattice based deployment in full-view covered camera sensor networks, where we argue that there is a flaw in the previou

关键词： full-view coverage Algorithm Networking Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Effect of realistic sea surface movements in achieving full-view coverage camera sensor network

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2016年第6期29卷 1091-1115页

作者： Manoufali, Mohamed Kong, Peng-Yong Jimaa, Shihab Khalifa Univ Sci Technol & Res Elect & Comp Engn Dept ECE Abu Dhabi U Arab Emirates

In stationary camera sensor networks (CSNs), when the deployment characteristics and sensing models are defined, the coverage can be deduced and remain unchanged over time. However, in the maritime environment, the rough and random sea condition can move CSN from the initial location. We envisage that camera sensors are mounted on quasi-mobile platforms such as buoys. Hence, it is important to understand the effect of realistic sea surface movements in achieving full-view coverage because in full-view coverage, target's facing direction is taken into account to judge whether a target is guaranteed to be captured because image shot at the frontal viewpoint of a given target considerably increases the possibility to detect and recognize the target. To accurately emulate the maritime environment, the movement of the buoy, which is attached with a cable that is nailed at the sea floor, has been characterized based on the sea wave that is created by the wind, and it is limited by the cable. The average percentage of full-view coverage has been evaluated based on different parameters such as equilateral triangle grid length, sensing radius of camera, wind speed and wave height. Furthermore, a method to improve the target detection and recognition has been proposed in the presence of poor link quality using cooperative transmission with low power consumption. In some parameter scenario, the cooperative transmission method has achieved around 70% improvement in the average percentage of full-view coverage of a given target and total reduction of around 13% for the total transmission power P-Total(Q). Copyright (c) 2015 John Wiley & Sons, Ltd.

关键词： camera sensor network maritime environment buoy full-view coverage cooperative transmission

来源：评论

学校读者我要写书评

暂无评论

Optimizing Node Deployment in Rechargeable Camera Sensor Networks for full-view coverage

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第13期9卷 11396-11407页

作者： Zhu, Xiaojian Zhou, Mengchu Abusorrah, Abdullah Changshu Inst Technol Sch Comp Sci & Engn Changshu 215500 Peoples R China New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA King Abdulaziz Univ Ctr Res Excellence Renewable Energy & Power Syst Jeddah 21481 Saudi Arabia King Abdulaziz Univ Fac Engn Dept Elect & Comp Engn Ctr Res Excellence Renewable Energy & Power Syst Jeddah 21481 Saudi Arabia King Abdulaziz Univ KA Care Energy Res & Innovat Ctr Jeddah 21481 Saudi Arabia

full-view coverage realized by camera sensor networks (CSNs) is highly demanded for monitoring and recognizing objects appearing at target points. However, it aggravates the energy shortage in CSNs as caused by the need to generate and process much sensed data. Undoubtedly, enabling CSN nodes to be rechargeable and harvest energy from their surroundings is an effective method to overcome the energy limitation of a CSN and ensuring its perpetual operation. Moreover, using rechargeable nodes can avoid the replacement of batteries, and thus can reduce network maintenance cost. In this article, we investigate how to design and deploy a rechargeable CSN with the fewest nodes to achieve full-view coverage of all target points while guaranteeing its connectivity and perpetual operation. We first formulate the problem as an integer linear program and prove its NP-hardness, and then propose a greedy heuristic and a differential evolution algorithm to solve it. Extensive simulation results reveal that the latter is able to achieve a larger success rate and higher solution quality but spends more time than the former.

关键词： Sensors Cameras Heuristic algorithms Wireless sensor networks Costs Internet of Things Surveillance Camera sensor networks (CSNs) deployment optimization full-view coverage network connectivity rechargeable nodes

来源：评论

学校读者我要写书评

暂无评论

Orientation Optimization for full-view coverage Using Rotatable Camera Sensors

引用

IEEE INTERNET OF THINGS JOURNAL 2019年第6期6卷 10508-10518页

作者： Chen, Jiming Liu, Haoyu Zhang, Qi He, Shibo Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Zhejiang Peoples R China

Recently, full-view coverage has been introduced to capture intruders from multiple directions in the camera sensor networks. It is more efficient than traditional coverage in identifying the intruders. However, full-view coverage typically calls for a large number of camera sensors. Hence, we exploit limited mobility or orientation to improve the performance of full-view coverage since camera sensors typically can rotate to cover more areas without being relocated after installation. Observing that target points may not be full-view covered constantly due to the sensor rotation, we emphasize the importance of the fairness-based coverage maximization problem, i.e., how to schedule the orientations of camera sensors to maximize the minimum cumulative full-view coverage time of target points. To solve this issue, we first try to reduce the dimension space of orientations by dividing the orientation space into a set of discrete directions. We then study how to select the minimum number of sensing regions that camera sensors should rotate to cover in order to ensure the full-view coverage of all target points. Next, we unveil the relationship between the full-view coverage and target points, which are spatially correlated. Based on these results, we devise a centralized algorithm to solve the problem based on "largest demand first serve" principle, by which the target points with less cumulative full-view coverage time will be preferentially selected to be full-view covered with a higher probability. We further design a distributed solution as a counterpart of the centralized algorithm. Extensive simulations are presented to show the performances of the proposed algorithms. Results show that exploiting limited mobility of sensor rotation has good potential in promoting the efficiency and reducing the cost of ensuring full-view coverage.

关键词： Camera sensor networks full-view coverage scheduling

来源：评论

学校读者我要写书评

暂无评论

Dynamic time window based full-view coverage maximization in CSNs

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年第5期48卷 1-18页

作者： Su, Jingfang Li, Zeqing Du, Hongwei Liu, Shengxin Harbin Inst Technol Shenzhen Sch Comp Sci & Technol Shenzhen 518055 Peoples R China

In order to maximize full-view coverage of moving targets in Camera Sensor Networks (CSNs), a novel method known as "group set cover" is presented in this research. Choosing the best camera angles and placements to accomplish full-view coverage of the moving targets is one of the main focuses of the research in CSNs. Discretize the target into multiple views of [0, 2 pi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pi $$\end{document}], use a set of views of targets to represent the sensing direction of the camera sensor, and use a group set of views of targets to represent the position of the camera sensor. The total number of targets in a dynamic time window that is visible in full view is calculated. A mixed integer linear programming formulation is employed, which is then approximated using a random rounding method. This approximation approach offers a global estimation of local optimality, particularly for non-submodular optimization problems. Two methods for maximizing overall full-view coverage within a dynamic time window are proposed TSC-FTC-DTW and FTC-TW-DTW. Finally, the proposed methods are verified through experiments.

关键词： Camera sensor networks full-view coverage Dynamic time windows Group set cover

来源：评论

学校读者我要写书评

暂无评论

Lifetime and full-view coverage Guarantees Through Distributed Algorithms in Camera Sensor Networks 31

Lifetime and Full-View Coverage Guarantees Through Distribut...

引用

31st IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPS)

作者： Li, Chaoyang Bourgeois, Anu G. Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

ISBN: (纸本)9780769561493

When a vast number of camera sensors are randomly placed in a target field, how can we produce a sleep/activate schedule for camera sensors to maximize the lifetime of target coverage in the target field? This well-known problem is called Maximum Lifetime coverage Problem (MLCP), which has been explored extensively in the literature. However, MLCP in full-view coverage camera sesnor networks are far more complicated since each target should be full-view covered by a group of camera sensors instead of a single sensor as in conventional scenarios. In this paper we address the full-view covered target problem, with the objective of maximizing the lifetime of a power constrained camera sensor network deployed for full-view coverage of targets with known location. We consider that a large number of camera sensors are placed randomly in close proximity of targets and each camera sensor sends the collected data to a base station. We define the camera sensor network lifetime as the time interval the targets are full-view covered by a camera sensor cover. Our contributions include: (1) an efficient data structure to represent a family of camera sensor cover, each of which full-view cover all targets with consideration of the lifetime of each camera sensor;(2) an energy efficient monitoring scheme where only the camera sensors from the current active set are responsible for monitoring all targets and for transmitting the collected data, while all other camera sensors are in a low-energy sleep mode;(3) formulating the maximizing camera sensor network lifetime problem into a packing linear programming problem, where a modified Garg-Konemann Algorithm to find the near optimal solution is applied.

关键词： Camera sensor networks full-view coverage energy optimization

来源：评论

学校读者我要写书评

暂无评论

Achieving full-view coverage in Camera Sensor Networks

引用

ACM TRANSACTIONS ON SENSOR NETWORKS 2013年第1期10卷 3-3页

作者： Wang, Yi Cao, Guohong Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

Camera sensors are different from traditional scalar sensors, as cameras at different positions can form very different views of the object. However, traditional coverage model does not consider this intrinsic property of camera sensors. To address this issue, a novel model called full-view coverage is proposed. It uses the angle between the object's facing direction and the camera's viewing direction to measure the quality of coverage. An object is full-view covered if there is always a camera to cover it no matter which direction it faces and the camera's viewing direction is sufficiently close to the object's facing direction. An efficient method is proposed for full-view coverage detection in any given camera sensor networks, and a sufficient condition on the sensor density needed for full-view coverage in a random uniform deployment is derived. In addition, the article shows a necessary and sufficient condition on the sensor density for full-view coverage in a triangular lattice-based deployment. Based on the full-view coverage model, the article further studies the barrier coverage problem. Existing weak and strong barrier coverage models are extended by considering direction issues in camera sensor networks. With these new models, weak/strong barrier coverage verification problems are introduced, and new detection methods are proposed and evaluated.

关键词： Design Algorithms Theory Camera sensor networks full-view coverage barrier coverage coverage verification

来源：评论

学校读者我要写书评

暂无评论

Toward Optimal Deployment for full-view Point coverage in Camera Sensor Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第21期9卷 22008-22021页

作者： Shi, Kun Liu, Shuxian Li, Chao Liu, Haoyu He, Shibo Zhang, Qi Chen, Jiming Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Peoples R China China State Shipbldg Corp Syst Engn Res Inst Beijing 100036 Peoples R China NetEase Games Fuxi AI Lab Hangzhou 310052 Peoples R China

Recent years have witnessed the fast proliferation of camera sensors networks (CSNs) in numerous Internet of Things (IoT) applications. In order to a capture distinct image of targets from interesting directions, we leverage a special type of coverage called full-view coverage. full-view coverage guarantees to obtain the images of a point from every direction, whereas it demands much more sensors than a conventional coverage. To this end, we investigate the problem of deploying the minimum number of rotatable camera sensors to achieve the full-view coverage of a set of target points, namely, optimal deployment for the full-view point coverage (OFP) problem. In this work, camera sensors are capable of rotating freely with infinite orientations, thus not only the deployment locations but also the orientations for each camera sensor are required to be optimized. To tackle this challenging problem, we first prove that the OFP problem is NP-hard. Then, we propose two approximation algorithms-iterative screening algorithm (ISA) and improved ISA (IISA) to solve the OFP. We further perform extensive simulations and conduct physical testings to demonstrate the superiority and effectiveness of our proposed solutions. Experimental results show that IISA can generally reduce the total number of required camera sensors by more than 20% compared with the state-of-the-art work.

关键词： Cameras Sensors Internet of Things Approximation algorithms Testing Redundancy Image recognition Camera sensor network full-view coverage optimal deployment

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：