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

IEEE International Conference on Multimedia and Expo (ICME)

作者： A. Aner-Wolf Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

A new approach for bridging over the semantic gap is presented. This approach is based solely on the extraction of low-level illumination features, and by using well defined film rules regarding scene lighting, it generates high level semantic descriptors for scenes. These illumination descriptors could be further combined with other descriptors like motion and shot tempo, to generate a more complete automatic semantic analysis of video media.

关键词： Atmosphere Layout Lighting Motion analysis Mood computer science Rhythm Atmospheric modeling Art Eyes

来源：评论

学校读者我要写书评

暂无评论

Multi-frame alignment of planes

Multi-frame alignment of planes

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： L. Zelnik-Manor M. Irani Department of Computer Science and Applied Math Weizmann Institute of Science Rehovot Israel

Traditional plane alignment techniques are typically performed between pairs of frames. In this paper we present a method for extending existing two-frame planar-motion estimation techniques into a simultaneous multi-frame estimation, by exploiting multi-frame geometric constraints of planar surfaces. The paper has three main contributions: (i) we show that when the camera calibration does not change, the collection of all parametric image motions of a planar surface in the scene across multiple frames is embedded in a low dimensional linear subspace; (ii) we show that the relative image motion of multiple planar surfaces across multiple frames is embedded in a yet lower dimensional linear subspace, even with varying camera calibration; and (iii) we show how these multi-frame constraints can be incorporated into simultaneous multi-frame estimation of planar motion, without explicitly recovering any 3D information, or camera calibration. The resulting multi-frame estimation process is more constrained than the individual two-frame estimations, leading to more accurate alignment, even when applied to small image regions.

关键词： Motion estimation Subspace constraints Cameras Calibration Layout computer science Visualization Object detection Robustness Geometry

来源：评论

学校读者我要写书评

暂无评论

Computing Moments by Prefix Sums

引用

Journal of VLSI signal processing systems for signal, image and video technology 2005年第1期25卷 5-17页

作者： Zhou, Feng Kornerup, Peter Department of Information and Electronic Eng. Zhejiang University People's Republic of China Department of Math. and Computer Science SDU/Odense University Denmark

Moments of images are widely used in pattern recognition, because in suitable form they can be made invariant to variations in translation, rotation and size. However the computation of discrete moments by their definition requires many multiplications which limits the speed of computation. In this paper we express the moments as a linear combination of higher order prefix sums, obtained by iterating the prefix sum computation on previous prefix sums, starting with the original function values. Thus the p′th moment $$m_p = \sum\nolimits_{x = 1}^N {} x^p f(x)$$ can be computed by O (N · p) additions followed by p multiply-adds. The prefix summations can be realized in time O(N) using p + 1 simple adders, and in time O(p log N) using parallel prefix computation and O(N) adders. The prefix sums can also be used in the computation of two-dimensional moments for any intensity function f(x,y). Using a simple bit-serial addition architecture, it is sufficient with 13 full adders and some shift registers to realize the 10 order 3 image moment computations $$(m_{00} ,m_{01} ,m_{10} ,m_{02} ,m_{20} ,m_{12} ,m_{21} ,m_{03} ,m_{30} )$$ for a 512 × 512 size image at the TV rate. In 1986 Hatamian published a computationally equivalent algorithm, based on a cascade of filters performing the summations. Our recursive derivation allows for explicit expressions and recursive equations for the coefficients used in the final moment calculation. Thus a number of alternative forms for the moment computation can be derived, based on different sets of prefix sums. It is also shown that similar expressions can be obtained for the moments introduced by Liao and Pawlak in 1996, forming better approximations to the exact geometric moments, at no extra computational cost.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Global t-Sweep Coverage Problem with Minimum Interference

Global t-Sweep Coverage Problem with Minimum Interference

引用

International Conference on Information Technology

作者： B. K. Bhatta S. K. Jena Computer Science and Application Group Department of Mathematics Indian Institute of Technology Delhi School of Math.-Stat-Computer Science Utkal University

ISBN: (纸本)9781509004881

Sweep coverage is one of the important and recent issue for network monitoring in wireless sensor network (WSN). Sweep coverage is efficiently applicable where periodic monitoring is sufficient than continuous monitoring. Interference minimization is another main objective of topology control problem in wireless sensor network. Reducing interference in turn reduces the number of collision and packet retransmission, which decreases the energy consumption and increases lifetime of the network. In this paper, we introduce the Interference minimization global t-Gsweep coverage problem (IMGtSCP) where the objective is to minimize the interference number induced by set of mobile and static sensors with the constraint that the given set of point of interests (PoIs) guarantee t-Gsweep coverage. We prove that the IMGtSCP problem is NP-hard and cannot be approximated with a factor 2. We propose a new heuristic called Interference Minimization Sweep Coverage with Static and Mobile Sensors. We have shown that the time complexity of this heuristics is O(n~3 log n), We also conduct simulation to show the performance of our proposed algorithm.

关键词： Wireless Sensor Networks Topology Control Minimum Spanning Tree Graph Algorithms Sweep Coverage K-MST Mobile Sensors Interference

来源：评论

学校读者我要写书评

暂无评论

Towards a theory of movie database queries

Towards a theory of movie database queries

引用

International Workshop on Temporal Representation and Reasoning (TIME)

作者： B. Kuijpers J. Paredaens D. Van Gucht Department WNI University of Limburg Belgium Department of Math. & Computer Science University of Antwerp Antwerp Belgium Computer Science Department Indiana University Bloomington IN USA

We present a data model for movies and movie databases. A movie is considered to be a 2D semi-algebraic figure that can change in time. We give a number of computability results concerning movies: it can be decided whether a frame of a movie is only a topologically transformation of another frame; a movie has a finite number of scenes and cuts and these can be effectively computed. Based on these computability results we define an SQL-like query language for movie databases. This query language supports most movie editing operations like cutting, pasting and selection of scenes.

关键词： Motion pictures Layout Data models Spatial databases Polynomials computer science Database languages Solid modeling Terminology

来源：评论

学校读者我要写书评

暂无评论

On the maximum number of implicants needed to cover a multiple-valued logic function using window literals

On the maximum number of implicants needed to cover a multip...

引用

International Symposium on Multiple-Valued Logic

作者： G.W. Dueck G.H.J. van Rees Department of Math. & Computer Science Saint Francis Xavier University Antigonish NS Canada Department of Computer Science University of Manitoba Winnipeg MAN Canada

Some bounds on the maximum number of implicants needed in a minimal sum of products expression using window literals and the truncated sum, operation are investigated. Functions with one input variable require at most r implicants in their minimum sum of products expression, where r is the radix of the function. Two variable functions with radix less than eight are analyzed. No firm bounds could be established for two variable functions with radix greater than four.< >

关键词： Logic functions Input variables Programmable logic arrays Minimization methods Cost function Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Provable benefits of actor-critic methods for offline reinforcement learning

arXiv

引用

arXiv 2021年

作者： Zanette, Andrea Wainwright, Martin J. Brunskill, Emma Inst. for Comp. and Math. Engineering Department of Statistics EECS Department of Computer Science Stanford University

Actor-critic methods are widely used in offline reinforcement learning practice, but are not so well-understood theoretically. We propose a new offline actor-critic algorithm that naturally incorporates the pessimism principle, leading to several key advantages compared to the state of the art. The algorithm can operate when the Bellman evaluation operator is closed with respect to the action value function of the actor's policies;this is a more general setting than the low-rank MDP model. Despite the added generality, the procedure is computationally tractable as it involves the solution of a sequence of second-order programs. We prove an upper bound on the suboptimality gap of the policy returned by the procedure that depends on the data coverage of any arbitrary, possibly data dependent comparator policy. The achievable guarantee is complemented with a minimax lower bound that is matching up to logarithmic factors. Copyright © 2021, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Runtime verification with state estimation

Runtime verification with state estimation

引用

2nd International Conference on Runtime Verification, RV 2011

作者： Stoller, Scott D. Bartocci, Ezio Seyster, Justin Grosu, Radu Havelund, Klaus Smolka, Scott A. Zadok, Erez Department of Computer Science Stony Brook University United States Department of Applied Math and Statistics Stony Brook University United States Jet Propulsion Laboratory California Institute of Technology United States

ISBN: (纸本)9783642298592

We introduce the concept of Runtime Verification with State Estimation and show how this concept can be applied to estimate the probability that a temporal property is satisfied by a run of a program when monitoring overhead is reduced by sampling. In such situations, there may be gaps in the observed program executions, thus making accurate estimation challenging. To deal with the effects of sampling on runtime verification, we view event sequences as observation sequences of a Hidden Markov Model (HMM), use an HMM model of the monitored program to "fill in" sampling-induced gaps in observation sequences, and extend the classic forward algorithm for HMM state estimation (which determines the probability of a state sequence, given an observation sequence) to compute the probability that the property is satisfied by an execution of the program. To validate our approach, we present a case study based on the mission software for a Mars rover. The results of our case study demonstrate high prediction accuracy for the probabilities computed by our algorithm. They also show that our technique is much more accurate than simply evaluating the temporal property on the given observation sequences, ignoring the gaps. © 2012 Springer-Verlag.

关键词： State estimation

来源：评论

学校读者我要写书评

暂无评论

Consistent code generation from UML models

Consistent code generation from UML models

引用

2005 Australian Software Engineering Conference ASWEC 2005

作者： Long, Quan Liu, Zhiming Li, Xiaoshan Jifeng, He International Institute for Software Technology United Nations University Macao China Department of Informatics School of Math. Peking University Beijing China Faculty of Science and Technology University of Macau Macao China Department of Computer Science University of Leicester United Kingdom East China Normal University China

ISBN: (纸本)0769522572

Relational Calculus of Object Systems (rCOS) is an OO-language which is equipped with an observation-oriented semantics and a refinement calculus based on the Hoare and He's Unifying Theories of Programming (UTP). In this paper, we give syntactic definitions for class diagrams and sequence diagrams in UML 2.0. Based on these definitions, we give an algorithm for checking the consistency of a class diagram and a sequence diagram. Furthermore, we develop an algorithm to generate rCOS code from any given consistent class diagram and sequence diagram. © 2005 IEEE.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Collaborative Control of Aerial Robots for Inferring Human Intent from Gaze Following

Collaborative Control of Aerial Robots for Inferring Human I...

引用

2023 IEEE Conference on Control Technology and Applications, CCTA 2023

作者： Chipade, Vishnu S. Gilbert, Alia Harari, Daniel Panagou, Dimitra University of Michigan Department of Aerospace Engineering Ann ArborMI United States University of Michigan Department of Robotics Ann ArborMI United States Weizmann Institute of Science Weizmann Ai Center Department of Computer Science and Applied Math Israel

ISBN: (纸本)9798350335446

In an ideal human-robot collaboration, autonomous robots work side-by-side with humans in a joint workspace, often performing complementary tasks to the humans. A robotic ability to infer human intention and goals directly from human behavior will facilitate the collaboration and maximize its efficiency. In this paper, we focus on inferring which object the human wants picked up next, based on what the human is looking at, by visually following the human gaze and head orientation. We develop a coordination protocol for a team of aerial robots to extract effective human head and gaze cues. The aerial robots are controlled to navigate around the human and collect data that improves the detection of the human's gaze and hence the intended object to be picked up. The effectiveness of the approach is shown using simulations in AirSim, a photo-realistic simulator. © 2023 IEEE.

关键词： Antennas

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：