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

IEEE IVMSP Workshop: Perception and Visual Signal Analysis

作者： Bernhard, M. Zhang, L. Wimmer, M. Vienna University of Technology Institute of Computer Graphics and Algorithms Favoritenstr. 9-11 Vienna Austria

ISBN: (纸本)9781457712869

In computer games, a user's attention is focused on the current task, and task-irrelevant details remain unnoticed. This behavior, known as inattentional blindness, is a main problem for the optimal placement of information or advertisements. We propose a guiding principle based on Wolfe's theory of Guided Search, which predicts the saliency of objects during a visual search task. Assuming that computer games elicit visual search tasks frequently, we applied this model in a "reverse" direction: Given a target item (e.g., advertisement) which should be noticed by the user, we choose a frequently searched game item and modify it so that it shares some perceptual features (e.g., color or orientation) with the target item. A memory experiment with 36 participants showed that in an action video game, advertisements were more noticeable to users when this method is applied. © 2011 IEEE.

关键词： computer games

来源：评论

学校读者我要写书评

暂无评论

Shape classification according to LBP persistence of critical points 19th

Shape classification according to LBP persistence of critica...

引用

19th IAPR International Conference on Discrete Geometry for computer Imagery, DGCI 2016

作者： Janusch, Ines Kropatsch, Walter G. Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms TU Wien Vienna Austria

ISBN: (纸本)9783319323596

This paper introduces a shape descriptor based on a combination of topological image analysis and texture information. Critical points of a shape’s skeleton are determined first. The shape is described according to persistence of the local topology at these critical points over a range of scales. The local topology over scale-space is derived using the local binary pattern texture operator with varying radii. To visualise the descriptor, a new type of persistence graph is defined which captures the evolution, respectively persistence, of the local topology. The presented shape descriptor may be used in shape classification or the grouping of shapes into equivalence classes. Classification experiments were conducted for a binary image dataset and the promising results are presented. Because of the use of persistence, the influence of noise or irregular shape boundaries (e.g. due to segmentation artefacts) on the result of such a classification or grouping is bounded. © Springer International Publishing Switzerland 2016.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

Delocalized unsteady vortex region detectors

Delocalized unsteady vortex region detectors

引用

13th International Fall Workshop Vision, Modeling, and Visualization 2008, VMV 2008

作者： Fuchs, Raphael Peikert, Ronald Sadlo, Filip Alsallakh, Bilal Gröller, Meister Eduard Institute of Computer Graphics and Algorithms TU Vienna Austria VRVis Research Center for Virtual Reality and Visualization Vienna Austria Computer Graphics Laboratory ETH Zurich Switzerland

ISBN: (纸本)9781586039219

In this paper we discuss generalizations of instantaneous, local vortex criteria. We incorporate information on spatial context and temporal development into the detection process. The presented method is generic in so far that it can extend any given Eulerian criterion to take the Lagrangian approach into account. Furthermore, we present a visual aid to understand and steer the feature extraction process. We show that the delocalized detectors are able to distinguish between connected vortices and help understanding regions of multiple interacting vortex structures. The delocalized detectors extract smoother structures and reduce noise in the vortex detection result.

关键词： Vortex flow

来源：评论

学校读者我要写书评

暂无评论

Generation as method for explorative learning in computer science education

Generation as method for explorative learning in computer sc...

引用

ITiCSE 2004 - 9th Annual SIGCSE Conference on Innovation and Technology in computer Science Education

作者： Kerren, Andreas Institute of Computer Graphics and Algorithms Vienna University of Technology Favoritenstraße 9-11 A-1040 Vienna Austria

The use of generic and generative methods for the development and application of interactive educational software is a relatively unexplored area in industry and education. Advantages of generic and generative techniques are, among other things, the high degree of reusability of systems parts and the reduction of development costs. Furthermore, generative methods can be used for the development or realization of novel learning models. In this paper, we discuss such a learning model that propagates a new way of explorative learning in computer science education with the help of generators. A realization of this model represents the educational software GANIFA on the theory of generating finite automata from regular expressions. In addition to the educational system's description, we present an evaluation of this system. Copyright 2004 ACM.

关键词： Engineering education

来源：评论

学校读者我要写书评

暂无评论

A PILOT/VND/GRASP hybrid for the static balancing of public bicycle sharing systems

A PILOT/VND/GRASP hybrid for the static balancing of public ...

引用

14th International Conference on computer Aided Systems Theory, EUROCAST 2013

作者： Papazek, Petrina Raidl, Günther R. Rainer-Harbach, Marian Hu, Bin Institute of Computer Graphics and Algorithms Vienna University of Technology Favoritenstrae 9-11/1861 1040 Vienna Austria

ISBN: (纸本)9783642538551

Due to varying user demands in bicycle sharing systems, operators need to actively shift bikes between stations by a fleet of vehicles. We address the problem of finding efficient vehicle tours by an extended version of an iterated greedy construction heuristic following the concept of the PILOT method and GRASP and applying a variable neighborhood descend (VND) as local improvement. Computational results on benchmark instances derived from the real-world scenario in Vienna with up to 700 stations indicate that our PILOT/GRASP hybrid especially scales significantly better to very large instances than a previously proposed variable neighborhood search (VNS) approach. Applying only one iteration, the PILOT construction heuristic followed by the VND provides good solutions very quickly, which can be potentially useful for urgent requests. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

A variable neighborhood search approach for the two-echelon location-routing problem

A variable neighborhood search approach for the two-echelon ...

引用

12th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2012

作者： Schwengerer, Martin Pirkwieser, Sandro Raidl, Günther R. Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria Destion - IT Consulting OG Vienna Austria

ISBN: (纸本)9783642291234

We consider the two-echelon location-routing problem (2E-LRP), a well-known problem in freight distribution arising when establishing a two-level transport system with limited capacities. The problem is a generalization of the location routing problem (LRP), involving strategic (location), tactical (allocation) and operational (routing) decisions at the same time. We present a variable neighborhood search (VNS) based on a previous successful VNS for the LRP, accordingly adapted as well as extended. The proposed algorithm provides solutions of high quality in short time, making use of seven different basic neighborhood structures parameterized with different perturbation size leading to a total of 21 specific neighborhood structures. For intensification, two consecutive local search methods are applied, optimizing the transport costs efficiently by considering only recently changed solution parts. Experimental results clearly show that our method is at least competitive regarding runtime and solution quality to other leading approaches, also improving upon several best known solutions. © 2012 Springer-Verlag.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Solving the bi-objective prize-collecting Steiner tree problem with the ε-constraint method

引用

Electronic Notes in Discrete Mathematics 2013年 41卷 181-188页

作者： Leitner, Markus Ljubić, Ivana Sinnl, Markus Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria Department of Statistics and Operations Research University of Vienna Vienna Austria

In this paper, we study the bi-objective prize-collecting Steiner tree problem, whose goal is to find a subtree that minimizes the edge costs for building that tree, and, at the same time, to maximize the collected node revenues. We propose to solve the problem using an ε-constraint algorithm. This is an iterative mixed-integer-programming framework that identifies one solution for every point on the Pareto front. In this framework, a branch-and-cut approach for the single-objective variant of the problem is enhanced with warm-start procedures that are used to (i) generate feasible solutions, (ii) generate violated cutting planes, and (iii) guide the branching process. Standard benchmark instances from the literature are used to assess the efficacy of our method. © 2013 Elsevier B.V.

关键词： ε-constraint method Bi-objective combinatorial optimization Steiner tree problem

来源：评论

学校读者我要写书评

暂无评论

Reeb graphs through local binary patterns 10

Reeb graphs through local binary patterns

引用

10th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2015

作者： Janusch, Ines Kropatsch, Walter G. Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria

ISBN: (纸本)9783319182230

This paper presents an approach to derive critical points of a shape, the basis of a Reeb graph, using a combination of a medial axis skeleton and features along this skeleton. A Reeb graph captures the topology of a shape. The nodes in the graph represent critical points (positions of change in the topology), while edges represent topological persistence. We present an approach to compute such critical points using Local Binary Patterns. For one pixel the Local Binary Pattern feature vector is derived comparing this pixel to its neighbouring pixels in an environment of a certain radius. We start with an initial segmentation and a medial axis representation. Along this axis critical points are computed using Local Binary Patterns with the radius, defining the neighbouring pixels, set a bit larger than the radius according to the medial axis transformation. Critical points obtained in this way form the node set in a Reeb graph, edges are given through the connectivity of the skeleton. This approach aims at improving the representation of flawed segmented data. In the same way segmentation artefacts, as for example single pixels representing noise, may be corrected based on this analysis. © Springer International Publishing Switzerland 2015.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem

引用

European Workshop Applications of Evolutionary Computing, EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM

作者： Ljubic, Ivana Raidl, Giinther R. Institute for Computer Graphics and Algorithms Vienna University of Technology Favoritenstrafie 9-11/186 Vienna1040 Austria

ISBN: (纸本)3540419209

Augmenting an existing network with additional links to achieve higher robustness and survivability plays an important role in network design. We consider the problem of augmenting a network with links of minimum total cost in order to make it edge-biconnected, i.e. the failure of a single link will never disconnect any two nodes. A new evolutionary algorithm is proposed that works directly on the set of additional links of a candidate solution. Problem-specific initialization, recombination, and mutation operators use a stochastic hill-climbing procedure. With low computational effort, only locally optimal, feasible candidate solutions are produced. Experimental results are significantly better than those of a previous genetic algorithm concerning final solutions’ qualities and especially execution times. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Particle therapy patient scheduling: First heuristic approaches 11

Particle therapy patient scheduling: First heuristic approac...

引用

11th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2016

作者： Maschler, Johannes Riedler, Martin Stock, Markus Raidl, Günther R. Institute of Computer Graphics and Algorithms TU Wien Vienna Austria EBG MedAustron GmbH Wiener Neustadt Austria

ISBN: (纸本)9780992998417

The Particle Therapy Patient Scheduling Problem arises in radiotherapy used for cancer treatment. Previous contributions in the existing literature primarily dealt with photon and electron therapy with a one-to-one correspondence of treatment rooms and accelerators. In particle therapy, however, a single accelerator serves multiple rooms in an interleaved way. This leads to a novel scenario in which the main challenge is to utilize the particle beam as well as possible. Switching between rooms allows to reduce idle time of the beam that emerges as a consequence of preparation steps. In this work we present first algorithms for solving this problem. In particular, we address the midterm planning variant which involves a time horizon of a few months but also requires detailed scheduling within each day. We formalize the problem via a mixed integer linear programming model, which, however, turns out to be intractable in practice. Consequently, we start with a construction heuristic featuring a forward-looking mechanism. Based upon this fast method we further study a Greedy Randomized Adaptive Search Procedure as well as an Iterated Greedy metaheuristic. A computational comparison of these algorithms is performed on benchmark instances created in a way to reflect the most important aspects of a real-world scenario. © PATAT *** rights reserved.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：