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

K-Coverage Estimation for Irregular Targets in Wireless visual sensor networks Deployed in Complex Region of Interest

引用

IEEE sensorS JOURNAL 2025年第10期25卷 18370-18383页

作者： Liu, Zhimin Jiang, Guiyan Wu, Youke Wang, Tian Liu, Shukun Ouyang, Zhangdong Hunan First Normal Univ Sch Comp Sci Changsha 410205 Peoples R China Hunan First Normal Univ Sch Business Changsha 410205 Peoples R China Wuyi Univ Sch Econ & Management Jiangmen 529020 Guangdong Peoples R China Beijing Normal Univ Inst Artificial Intelligence & Future Networks Zhuhai 519000 Peoples R China Hunan Womens Univ Sch Comp Sci & Technol Changsha 410004 Peoples R China Hunan First Normal Univ Sch Math & Stat Changsha 410205 Peoples R China

In wireless visual sensor networks (WVSNs), coverage estimation is essential for optimizing network energy consumption and reducing deployment costs. In recent years, the majority of literature primarily focuses on small-scale networks, and typically assumes that visual sensors are either predetermined or randomly deployed in obstacle-free regions of interest (RoI). However, in real-world scenarios, these sensors are frequently deployed in challenging-to-access environments that contain irregular obstacles. Moreover, the targets in these environments exhibit considerable diversity in shape and size. To address these challenges, this article presents an issue of irregular targets K coverage with obstacles (K-ITCO) in WVSNs deployed in irregular RoI. In addition, we account for the probability that targets are unobstructed and consider the boundary effects. We derive two K-ITCO estimation models and their respective solving methods [K-ITCO ratio with boundary effects (K-ITCO-BEs) and K-ITCO ratio no boundary effects (K-ITCO-noBEs)] that predict a specified coverage ratio with a high probability. To validate the effectiveness and accuracy of our proposed models, multiple sets of simulations are designed to analyze the numerical and simulation results. Our findings demonstrate a high degree of consistency with the simulation outcomes, and indicate that the model can effectively estimate K-ITCO ratio.

关键词： sensors visualization Shape Wireless sensor networks Estimation Numerical models Intelligent sensors Wireless communication Optimization Surveillance Critical sensor density irregular target K-coverage estimation obstacles visual sensor networks

来源：评论

学校读者我要写书评

暂无评论

E-TPE: Efficient Thumbnail-Preserving Encryption for Privacy Protection in visual sensor networks

引用

ACM TRANSACTIONS ON sensor networks 2024年第4期20卷 1-26页

作者： Zhao, Ruoyu Zhang, Yushu Wen, Wenying Lan, Rushi Xiang, Yong Nanjing Univ Aeronaut & Astronaut Coll Comp Sci & Technol Jiangjun Rd Nanjing 211106 Jiangsu Peoples R China Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Shucun Rd Beijing 100085 Peoples R China Jiangxi Univ Finance & Econ Sch Informat Management Yuping Ave Nanchang 330032 Jiangxi Peoples R China Guilin Univ Elect Technol Guangxi Key Lab Image & Graph Intelligent Proc Guilin 541004 Guangxi Peoples R China Deakin Univ Sch Informat Technol Burwood Hwy Burwood Vic 3125 Australia

When visual sensor networks (VSNs) enter daily life in society, they not only bring great convenience but also cause people to worry about privacy. Traditional image encryption uses the snowflake effect to protect the privacy, but this can compromise the usability of directly browsing images captured by nodes in VSNs. Recently, thumbnail-preserving encryption (TPE) has been proposed to balance image usability and privacy. However, the Markov chain’s limited connectivity and high time cost, which result in low efficiency, may preclude its application in VSNs. Motivated by this, we propose a novel TPE scheme to protect the image collected in VSNs’ privacy efficiently. We first deeply study the bijective relationship between the three-pixel group and its rank, and then propose a new number method for both, based on which we design the efficient rank mapping. Subsequently, an efficient thumbnail-preserving image encryption via three-pixel rank mapping (E-TPE) is designed, achieving NR security and enhancing the Markov chain’s connectivity. The experiments demonstrate the scheme’s efficiency; that is, it is currently the quickest ideal-TPE scheme with NR security, and a good balance is achieved between usability and privacy.

关键词： Privacy protection usability security visual sensor networks

来源：评论

学校读者我要写书评

暂无评论

Maximal Weighted Coverage Deployment of UAV-Enabled Rechargeable visual sensor networks

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2023年第10期24卷 11293-11307页

作者： Zhu, Xiaojian Zhou, MengChu Changshu Inst Technol Sch Comp Sci & Engn Changshu 215500 Peoples R China Zhejiang Gongshang Univ Sch Informat & Elect Engn Hangzhou 310018 Peoples R China New Jersey Inst Technol Helen & John C Hartmann Dept Elect & Comp Engn Newark NJ 07102 USA

Due to the generation and transmission of video data, the high energy consumption rates of wireless nodes result in short lifetime of a visual sensor network, which has been commonly deployed in 3D space. In many applications, lots of targets need to be covered, but the budgets of both deployment and maintenance are limited. Therefore, how to maximize total weighted target coverage while prolonging network lifetime is of great significance. This work investigates the maximum weighted target coverage deployment of a rechargeable visual sensor network charged by an unmanned aerial vehicle (UAV) in 3D space, which should ensure network permanence and satisfy the budgets of both deployment and maintenance. In this problem, since UAV has a limited energy capacity, it is allowed to return to the depot for energy replenishment more than once in each charging period of wireless nodes so as to increase target coverage. After formulating this problem as a mixed integer nonlinear program, this work proposes a greedy heuristic and a particle swarm optimizer to approximately solve this NP-hard problem. Extensive simulation results reveal that the latter can deliver a better solution despite consuming more time than the former.

关键词： visual sensor networks 3D coverage UAV scheduling node deployment wireless charging

来源：评论

学校读者我要写书评

暂无评论

An Optimised Indoor Deployment of visual sensor networks 16

An Optimised Indoor Deployment of Visual Sensor Networks

引用

16th International Conference on Signal-Image Technology and Internet-Based Systems (SITIS)

作者： Faga, Yves Abdou, Wahabou Dubois, Julien Univ Bourgogne Franche Comte ImViA Lab Dijon France Univ Bourgogne Franche Comte LIB Lab Dijon France

ISBN: (纸本)9781665464956

This paper deals with the problem of deploying a sensor network to monitor an area. More specifically, we consider sensor nodes that are equipped with smart cameras. We refer to this network as visual sensor network (VSN). The cameras used in this study are directional and must be placed along the walls to ensure better coverage in an indoor environment. The optimisation problem has two objective functions: (i) maximise the overall coverage of the study area and (ii) maximise the coverage of some spots called areas of interest. To deal with this problem, we propose an approach based on a genetic algorithm and a simulation tool to measure the cameras' fields of view (based on ray tracing). The results obtained show that the algorithm adapts well to the presence of obstacles and/or areas of interest. Moreover, the algorithm succeeds in simultaneously optimising the two objective functions without being trapped by local optima.

关键词： sensor deployment visual sensor networks multi-objective optimisation

来源：评论

学校读者我要写书评

暂无评论

Efficient Image Transmission over Cluster-Based Cooperative visual sensor networks 6

Efficient Image Transmission over Cluster-Based Cooperative ...

引用

6th International Conference for Convergence in Technology (I2CT)

作者： Lakshmi, A. Vijaya Reddy, K. Sripal Vardhaman Coll Engn Dept ECE Hyderabad India

ISBN: (纸本)9781728188768

Traditional dual-hop cooperative communication may not suitable for the clustered based cooperative wireless networks, since the intermediate nodes with improper channel condition may become the bottleneck of the overall communication. To address this problem, a cluster-based cooperative framework was presented in this paper. In this framework, all the candidate relays are divided into two clusters: relays near to the source (called source cluster) and nodes near to the destination (named as destination cluster). Further, to improve the performance, an algorithm for the efficient image transmission methodology was presented. Generally, in image transmission, Discrete Wavelet Transforms (DWT) is widely used for image compression. Since the DWT is a convolution-based approach, designing the hardware circuit for floating-point numbers is difficult. Here, we adopt lifting based discrete wavelet transform to reduce the hardware implementation complexity for the compression. Through the simulation results, we show the performance improvement of the proposed method against state-of-art approaches in terms of peak signal to noise ratio, mean square error, structural similarity index and bit error rate.

关键词： Cooperative communication visual sensor networks Cluster based cooperative wireless networks Discrete wavelet transform

来源：评论

学校读者我要写书评

暂无评论

A learning automata-based algorithm to solve imbalanced k-coverage in visual sensor networks

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2020年第3期39卷 2817-2829页

作者： Bakht, Ahmad Javan Motameni, Homayun Mohamadi, Hosein Islamic Azad Univ Dept Comp Engn Sari Branch Sari Iran Islamic Azad Univ Dept Comp Engn Azadshahr Branch Azadshahr Iran

One of the most important problems in directional sensor networks is k-coverage in which the orientation of a minimum number of directional sensors is determined in such a way that each target can be monitored at least k times. This problem has been already considered in two different environments: over provisioned where the number of sensors is enough to cover all targets, and under provisioned where there are not enough sensors to do the coverage task (known as imbalanced k-coverage problem). Due to the significance of solving the imbalanced k-coverage problem, this paper proposes a learning automata (LA)-based algorithm capable of selecting a minimum number of sensors in a way to provide k-coverage for all targets in a balanced way. To evaluate the efficiency of the proposed algorithm performance, several experiments were conducted and the obtained results were compared to those of two greedy-based algorithms. The results confirmed the efficiency of the proposed algorithm in terms of solving the problem.

关键词： visual sensor networks balanced coverage k-coverage learning automata

来源：评论

学校读者我要写书评

暂无评论

Accurate and Flexible Calibration Method for a Class of visual sensor networks

引用

IEEE sensorS JOURNAL 2020年第6期20卷 3257-3269页

作者： Deng, Heng Yang, Kun Quan, Quan Cai, Kai-Yuan Beihang Univ Sch Automat Sci & Elect Engn Beijing 100191 Peoples R China

Accurate and flexible calibration is a prerequisite for visual sensor networks to retrieve metric information from image data. This paper presents the design and implementation of an accurate and flexible calibration method for a class of visual sensor networks intended for 3D measurement and tracking in large volumes. The proposed method employs a generic camera model that is applicable for wide-angle lens cameras as well as for conventional cameras. It does not require all the employed cameras to share a common field of view, and only pairwise overlap is needed. In the calibration process, the poses between stereo cameras are first initialized using essential matrix decomposition and then optimized by the Levenberg-Marquardt algorithm. A weighted vision graph is proposed to select optimal transformation paths among cameras by using Dijkstra's shortest path algorithms for multi-camera calibration. Then, the global coordinates are constructed using a four-marker calibration triangle. Finally, a Unity3D-based virtual platform, in which the total number and configurations of cameras, as well as the environment scene, can be arbitrarily edited, is designed to test the proposed calibration algorithms. Extensive experiments based on synthetic and real data are performed to demonstrate the effectiveness of the proposed multi-camera calibration method. Experimental results show that the multi-camera calibration method is accurate and easy-to-implement in the presence of noise.

关键词： Cameras Calibration sensors visualization Three-dimensional displays Two dimensional displays Lenses visual sensor networks multi-camera calibration 1D calibration pattern vision graph bundle adjustment

来源：评论

学校读者我要写书评

暂无评论

Decentralized and resource-efficient self-calibration of visual sensor networks

引用

AD HOC networks 2019年 88卷 112-128页

作者： Simonjan, Jennifer Rinner, Bernhard Alpen Adria Univ Klagenfurt Inst Networked & Embedded Syst Klagenfurt Austria

Many multi-camera applications rely on the knowledge of the spatial relationship among the individual nodes. However, establishing such a network-wide calibration is typically a time-consuming task and requires user interaction. In this paper we present a decentralized and resource-aware algorithm for estimating the poses of all network nodes without any user interaction. This self-calibration of the network is achieved in two steps: First, overlapping camera pairs estimate relative positions and orientations by exchanging locally measured distances and angles to detected objects. Second, calibration information of overlapping cameras is spread throughout the network such that poses of non-overlapping cameras can also be estimated. Our approach does not rely on a priori topological information and delivers the extrinsic camera parameters with respect to a common coordinate system. In a simulation study we analyze the performance of our approach concerning the achieved spatial accuracy and computational effort considering noisy measurements and different communication schemes. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Smart cameras visual sensor networks Self-calibration Topology estimation Distributed systems Communication efficiency Resource-awareness

来源：评论

学校读者我要写书评

暂无评论

A prediction-based approach for features aggregation in visual sensor networks

引用

AD HOC networks 2019年 83卷 55-67页

作者： Redondi, Alessandro Enrico Cesana, Matteo Fratta, Luigi Capone, Antonio Borgonovo, Flaminio Politecn Milan Dipartimento Elettron Informaz & Bioingn Milan Italy

visual sensor networks (VSNs) constitute a key technology for the implementation of several visual analysis tasks. Recent studies have demonstrated that such tasks can be efficiently performed following an operative paradigm where cameras transmit to a central controller local image features, rather than pixel-domain images. Furthermore, features from multiple camera views may be efficiently aggregated exploiting the spatial redundancy between overlapping views. In this paper we propose a routing protocol designed for supporting aggregation of image features in a VSN. First, we identify a predictor able to estimate the efficiency of local features aggregation between different cameras in a VSN. The proposed predictor is chosen so as to minimize the prediction error while keeping the network overhead cost low. Then, we harmonically integrate the proposed predictor in the Routing Protocol for Low-Power and Lossy networks (RPL) in order to support the task of in-network feature aggregation. We propose a RPL objective function that takes into account the predicted aggregation efficiency and build the routes from the camera nodes to a central controller so that either energy consumption or used network bandwidth is minimized. Extensive experimental results confirm that the proposed approach can be used to increase the efficiency of VSNs. (C) 2018 Published by Elsevier B.V.

关键词： visual sensor networks Multi-view features compression RPL

来源：评论

学校读者我要写书评

暂无评论

Maximisation of the number of β-view covered targets in visual sensor networks

引用

INTERNATIONAL JOURNAL OF sensor networks 2019年第4期29卷 226-241页

作者： Guo, Ling Li, Deying Wang, Yongcai Zhang, Zhao Tong, Guangmo Wu, Weili Du, Dingzhu Northwest Univ Sch Informat Sci & Technol Xian 710127 Shaanxi Peoples R China Renmin Univ China Sch Informat Beijing 100872 Peoples R China Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Zhejiang Peoples R China Univ Texas Dallas Dept Comp Sci Dallas TX 75080 USA

In some applications using visual sensor networks (VSNs), the facing directions of targets are bounded. Therefore existing full-view coverage (all the facing directions of a target constitutes a disk) is not necessary. We propose a novel model called beta-view coverage model through which only necessary facing directions of a target are effectively viewed. This model uses much fewer cameras than those used by full-view coverage model. Based on beta-view coverage model, a new problem called beta-view covered target maximisation (BVCTM) problem is proposed to maximise the number of beta-view covered targets given some fixed and freely rotatable camera sensors. We prove its NP-hardness and transform it into an Integer Linear Programming problem equivalently. Besides, a (1 - e(-1))-factor approximate algorithm and a camera-utility based greedy algorithm are given for this problem. Finally, we conduct many experiments and investigate the influence of many parameters on these two algorithms.

关键词： VSNs visual sensor networks target coverage beta view coverage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：