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

Recent Advances in Camera Planning for Large Area Surveillance: A Comprehensive Review

ACM COMPUTING SURVEYS 2016年第1期49卷 6-6页

作者： Liu, Junbin Sridharan, Sridha Fookes, Clinton Queensland Univ Technol Sch Elect Engn & Comp Sci 2 George St Brisbane Qld 4000 Australia

With recent advances in consumer electronics and the increasingly urgent need for public security, camera networks have evolved from their early role of providing simple and static monitoring to current complex systems capable of obtaining extensive video information for intelligent processing, such as target localization, identification, and tracking. In all cases, it is of vital importance that the optimal camera configuration (i.e., optimal location, orientation, etc.) is determined before cameras are deployed as a suboptimal placement solution will adversely affect intelligent video surveillance and video analytic algorithms. The optimal configuration may also provide substantial savings on the total number of cameras required to achieve the same level of utility. In this article, we examine most, if not all, of the recent approaches (post 2000) addressing camera placement in a structured manner. We believe that our work can serve as a first point of entry for readers wishing to start researching into this area or engineers who need to design a camera system in practice. To this end, we attempt to provide a complete study of relevant formulation strategies and brief introductions to most commonly used optimization techniques by researchers in this field. We hope our work to be inspirational to spark new ideas in the field.

关键词： Camera planning camera placement optimization binary integer programming swarm intelligence simulated annealing video surveillance

来源：评论

学校读者我要写书评

暂无评论

Minimum Cost Multi-Way Data Association for Optimizing Multitarget Tracking of Interacting Objects

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2015年第3期37卷 611-624页

作者： Park, Chiwoo Woehl, Taylor J. Evans, James E. Browning, Nigel D. Florida State Univ Dept Ind & Mfg Engn Tallahassee FL 32310 USA Ames Natl Lab Div Mat Sci & Engn Ames IA USA Pacific NW Natl Lab Dept Environm & Mol Sci Richland WA USA Pacific NW Natl Lab Dept Fundamental & Computat Sci Richland WA 99352 USA

This paper presents a general formulation for a minimum cost data association problem which associates data features via one-to-one, m-to-one and one-to-n links with minimum total cost of the links. A motivating example is a problem of tracking multiple interacting nanoparticles imaged on video frames, where particles can aggregate into one particle or a particle can be split into multiple particles. Many existing multitarget tracking methods are capable of tracking non-interacting targets or tracking interacting targets of restricted degrees of interactions. The proposed formulation solves a multitarget tracking problem for general degrees of inter-object interactions. The formulation is in the form of a binary integer programming problem. We propose a polynomial time solution approach that can obtain a good relaxation solution of the binary integer programming, so the approach can be applied for multitarget tracking problems of a moderate size (for hundreds of targets over tens of time frames). The resulting solution is always integral and obtains a better duality gap than the simple linear relaxation solution of the corresponding problem. The proposed method was validated through applications to simulated multitarget tracking problems and a real multitarget tracking problem.

关键词： Data association binary integer programming decomposition lagrange dual relaxation

来源：评论

学校读者我要写书评

暂无评论

An exact algorithm to extract the generalized physical contradiction

引用

INTERNATIONAL JOURNAL OF INTERACTIVE DESIGN AND MANUFACTURING - IJIDEM 2015年第3期9卷 185-191页

作者： Lin, Lei Dubois, Sebastien De Guio, Roland Rasovska, Ivana INSA Strasbourg 24 Bld Victoire F-67000 Strasbourg France ICube UMR 7357 Lab Sci Ingn Informat & Imagerie F-67412 Illkirch Graffenstaden France

Problem solving in design is one of the main studied topic of research, and especially methods for problem solving. Generally, two kinds of methods are differentiated, those dedicated to routine design, and those focused on inventive design. The authors aim at linking the two approaches and building a continuum between both. Thus they studied the link and direct extraction of contradictions out of experiments. To do so they built a generic model of contradictions, the generalized system of contradictions (GSC). This paper proposes an algorithm for identifying and extracting generalized physical contradictions (GPCs), a part of the GSC, from experiments. First, the authors' design methodology to build the continuum from optimization till invention is introduced. The notion of GSC is presented and the focus is made on the notion of GPC. This one is described through binary integer programming and an algorithm is proposed in order to identify and extract complete set of generalized technical contradictions from experiments concerning the inventive problem.

关键词： TRIZ Generalized system of contradictions binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic Adaptive Streaming over Popularity-driven Caching in Information-Centric Networks

Dynamic Adaptive Streaming over Popularity-driven Caching in...

引用

IEEE International Conference on Communications (ICC)

作者： Li, Wenjie Oteafy, Sharief M. A. Hassanein, Hossam S. Queens Univ Sch Comp Kingston ON Canada

ISBN: (纸本)9781467364324

The growing demand for video streaming is straining the current Internet, and mandating a novel approach to future Internet paradigms. The advent of Information-Centric Networks (ICN) promises a novel architecture for addressing this exponential growth in data-intensive services, of which video streaming is projected to dominate (in traffic size). In this paper, we present a novel strategy in ICNs for adaptive caching of variable video contents tailored to different sizes and bit rates. Our objective is to achieve optimal video caching to reduce access time for the maximal requested bit rate for every user. At its core, our approach capitalizes on a rigorous delay analysis and potentiates maximal serviceability for each user. We incorporate predictors for requested video objects based on a popularity index (Zipf distribution). In our proposed model, named DASCache, we present delay queuing analysis for cached objects, providing a cap on expected delay in accessing video content. In DASCache, we present a binary integer programming (BIP) formulation for the cache assignment problem, which operates in rounds based on changes in content requests and popularity scores. DASCache reacts to changes in network dynamics that impact bit rate choices by heterogeneous users and enables users to stream videos, maximizing Quality of Experience (QoE). To evaluate the performance of DASCache, in contrast to current benchmarks in video caching, we present an elaborate performance evaluation carried out on ndnSIM, over NS-3.

关键词： Dynamic adaptive streaming Content-centric network in-network caching Optimization Popularity index Queueing analysis binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Unified PMU Placement Algorithm for Power Systems

Unified PMU Placement Algorithm for Power Systems

引用

North American Power Symposium (NAPS)

作者： Amare, Kunal Centeno, Virgilio A. Pal, Anamitra Virginia Tech Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA Virginia Tech Virginia Bioinformat Inst Network Dynam & Simulat Sci Lab Blacksburg VA 24061 USA

ISBN: (纸本)9781467373890

This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complete observability, complete observability with N - 1 redundancy, different depths of unobservability, multi-stage sequential placement, real-time monitoring of critical buses are the various PMU placement approaches considered in this paper. The required input for the proposed algorithm is system information and other key aspects like locations of existing PMUs, locations unsuitable for PMU placement, and knowledge of critical buses. binary integer programming is used to find the respective PMU placement location and minimum number of PMUs. The algorithm is tested on IEEE 39-bus system, IEEE 118-bus system, and IEEE 300-bus system. The results suggest that the algorithm can be used on any power system network and the suitable PMU placement approach can be implemented for application.

关键词： binary integer programming observability optimal placement phasor measurement units (PMUs)

来源：评论

学校读者我要写书评

暂无评论

Optimal Smart Gateway Deployment for the Internet of Things in Smart Home Environments 4

Optimal Smart Gateway Deployment for the Internet of Things ...

引用

IEEE 4th Global Conference on Consumer Electronics GCCE

作者： Lin, Po-Chiang Yuan Ze Univ Dept Commun Engn Taoyuan Taiwan

ISBN: (纸本)9781479987511

For the Internet of Things in smart home environments, the smart gateway is the key component to collect/disseminate information from/to various sensors/actuators. In this study we investigate the smart gateway deployment problem in smart home environments. This problem is formulated as a constrained optimization problem with the objective to minimize the deployment cost subject to the constraints that all service areas should be covered. The smart gateway deployment problem under consideration is formulated as a binary integer programming problem. We solve it by the branch and bound method which could effectively reduce the complexity.

关键词： Internet of Things (IoT) smart home binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Modeling of a scheduling problem with expected availability of resources

引用

OPSEARCH 2015年第4期52卷 771-781页

作者： Yellapu, Ganesh Penmetsa, Satish Bharat Elect Ltd Cent Res Lab Bangalore 560013 Karnataka India

A Mathematical model is proposed for an offline version of a scheduling problem. The problem comprises various types of jobs (or tasks) with deadlines to be accomplished and various types of resources, whose availability is not continuous and described by a resource calendar, to be used to accomplish the jobs. Further the scheduling must be optimum and must comply various constraints. The proposed model is a typical binary integer programming problem for the scheduling problem subject to various constraints and hence it could be solved using the techniques of binary integer programming. One heuristic method is also discussed to solve the scheduling problem.

关键词： binary integer programming Deadline Effort Offline setting Online setting Resource Resource calendar

来源：评论

学校读者我要写书评

暂无评论

Dynamic Adaptive Streaming over Popularity-driven Caching in Information-Centric Networks

Dynamic Adaptive Streaming over Popularity-driven Caching in...

引用

IEEE International Conference on Communications

作者： Wenjie Li Sharief M. A. Oteafy Hossam S. Hassanein School of Computing Queen's University

ISBN: (纸本)9781467364300

关键词： Dynamic adaptive streaming Content-centric network In-network caching Optimization Popularity index Queueing analysis binary integer programming

来源：评论

学校读者我要写书评

暂无评论

Unified PMU Placement Algorithm for Power Systems

Unified PMU Placement Algorithm for Power Systems

引用

North American Power Symposium

作者： Kunal Amare Virgilio A. Centeno Anamitra Pal Bradley Department of Electrical and Computer Engineering Virginia Tech Network Dynamics and Simulation Science Laboratory Virginia Bioinformatics Institute Virginia Tech

ISBN: (纸本)9781467373906

This paper presents a PMU (phasor measurement unit) placement algorithm that gives the optimal PMU placement location and minimum number of PMUs for any electric network while considering different approaches. Complete observability, complete observability with N-1 redundancy, different depths of unobservability, multi-stage sequential placement, real-time monitoring of critical buses are the various PMU placement approaches considered in this paper. The required input for the proposed algorithm is system information and other key aspects like locations of existing PMUs, locations unsuitable for PMU placement, and knowledge of critical buses. binary integer programming is used to find the respective PMU placement location and minimum number of PMUs. The algorithm is tested on IEEE 39-bus system, IEEE 118-bus system, and IEEE 300-bus system. The results suggest that the algorithm can be used on any power system network and the suitable PMU placement approach can be implemented for application.

关键词： binary integer programming Observability Optimal placement Phasor measurement units (PMUs)

来源：评论

学校读者我要写书评

暂无评论

A PMU Placement Scheme Ensuring Real-Time Monitoring of Critical Buses of the Network

引用

IEEE TRANSACTIONS ON POWER DELIVERY 2014年第2期29卷 510-517页

作者： Pal, Anamitra Sanchez-Ayala, Gerardo A. Centeno, Virgilio A. Thorp, James S. Virginia Polytech Inst & State Univ Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA

This paper presents a phasor measurement unit (PMU) placement scheme that provides real-time monitoring of key buses of the network. High-voltage lines, substations relevant for transient and dynamic stability of the network, and buses with high connectivity are given the highest priority while placing the PMUs. binary integer programming and "depth of unobservability" are used to find the relevant PMU placement set. The placement scheme has been tested on the IEEE 118-bus system, IEEE 300-bus system, a 283-bus model of the Central American Power Transmission System, and a complex 996-bus network describing the Northern and the Eastern power grids of India. The results indicate that the proposed technique will be useful to utilities that want to initially protect the most important buses of their system on their way to attaining complete observability.

关键词： binary integer programming observability phasor measurement units (PMUs) redundancy wide-area measurement system (WAMS)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：