Filetype
In this paper, we present a system for drone detection and positioning. The approach uses a system composed of an audio detection rig with a set of microphones, a set of fixed cameras with a large combined field of view and a Pan-TiltZoom camera. We present how this system can be defined in an efficient and modular way with a number of parallel sensing modules. The focus of this work is the audio
We study mixed-integer optimal control problem using indirect approaches. The proposed method relies on splitting algorithms which separate the mixed problem into two solvable pieces and then iteratively alternating between the two. The algorithm gives approximated local solutions, and provides lower and upper bounds estimations of the global optimum. Simulations are provided to validate our appro
Summativ, formativ och utspridd examination En summativ bedömning summerar en persons samlade kunskaper vid ett specifikt tillfälle. Inom högre utbildning görs en sådan bedömning av studenters kunskaper ofta genom en examination av något slag i slutet av en kurs, och ligger då till grund för betygsättning. En formativ bedömning är istället en löpande bedömning som sker under lärandeprocessens gång
Stereoscopic rendering and 3D stereo displays are quickly becoming mainstream. The natural extension is autostereoscopic multi-view displays, which by the use of parallax barriers or lenticular lenses, can accommodate many simultaneous viewers without the need for active or passive glasses. As these displays, for the foreseeable future, will support only a rather limited number of views, there is
Abstract in UndeterminedIn this article, we present a constraint programming approach for solving hard design problems present when automatically designing specialized processor extensions. Specifically, we discuss our approach for automatic selection and synthesis of processor extensions as well as efficient application compilation for these newly generated extensions. The discussed approach is i
In this paper, we derive compact representations of the depth function for a triangle undergoing motion or defocus blur. Unlike a static primitive, where the depth function is planar, the depth function is a rational function in time and the lens parameters. Furthermore, we show how these compact depth functions can be used to design an efficient depth buffer compressor/decompressor, which signifi
In this paper, we present a meshing scheme for the implementation of an adaptive tessellation of triangular meshes on the graphics processing unit (GPU). Tessellation is performed according to a local test to generate primitives dynamically. The refinement procedure does not require the pre-computation of any refinement pattern. The resulting adaptive procedure is efficient and simple, and generat
We present user-controllable and plausible defocus blur for a stochastic rasterizer. We modify circle of confusion coefficients per vertex to express more general defocus blur, and show how the method can be applied to limit the foreground blur, extend the in-focus range, simulate tilt-shift photography, and specify per-object defocus blur. Furthermore, with two simplifying assumptions, we show th
Given a stochastic shadow map rendered with motion blur, our goal is to render an image from the eye with motion-blurred shadows with as little noise as possible. We use a layered approach in the shadow map and reproject samples along the average motion vector, and then perform lookups in this representation. Our results include substantially improved shadow quality compared to previous work and a
When rendering effects such as motion blur and defocus blur, shading can become very expensive if done in a naive way, i.e. shading each visibility sample. To improve performance, previous work often decouple shading from visibility sampling using shader caching algorithms. We present a novel technique for reusing shading in a stochastic rasterizer. Shading is computed hierarchically and sparsely
Computing accurate visibility for thin primitives, such as hair strands, fur, grass, at all scales remains difficult or expensive. To that end, we present an efficient visibility algorithm based on spatial line sampling, and a novel intersection algorithm between line sample planes and Bezier splines with varying thickness. Our algorithm produces accurate visibility both when the projected width o
Edge aliasing continues to be one of the most prominent problems in real-time graphics, e.g., in games. We present a novel algorithm that uses shared memory between the GPU and the CPU so that these two units can work in concert to solve the edge aliasing problem rapidly. Our system renders the scene as usual on the GPU with one sample per pixel. At the same time, our novel edge aliasing algorithm
Dataflow descriptions are a natural match to application areas such as signal processing, cryptography, networking, image processing, and media coding. This paper addresses the problem of efficiently executing the basic elements of a dataflow program, its actors, written in a language such as MPEG's RVC-CAL. Using actor machines as an execution model for dataflow actors, we devise a metric for mea
This paper presents the development of a non-dimensional model of a continuous cross-flow atomic layer deposition (ALD) reactor with temporally separated precursor pulsing and a structured model-based methodology for scaling up the substrate dimensions. The model incorporates an ALD gas–surface reaction kinetic mechanism for the deposition of thin ZnO films from Zn(C2H5)2 and H2O precursors that w
EUROPRISE is a Network of Excellence sponsored from 2007 to 2011 by the European Commission within the 6th Framework Program. The Network encompasses a wide portfolio of activities ranging from an integrated research program in the field of HIV vaccines and microbicides to training, dissemination and advocacy. The research program covers the whole pipeline of vaccine and microbicide development fr
A fundamental part of many computer algorithms involves traversing a binary tree. One notable example is traversing a space-partitioning acceleration structure when computing ray-traced images. Traditionally, the traversal requires a stack to be temporarily stored for each ray, which results in both additional storage and memory-bandwidth usage. We present a novel algorithm for traversing a binary
Popular Abstract in Swedish Det religiösa landskapet i Europa genomsyras av rituell kreativitet - inom teater, psykoterapi och religiösa samfund laborerar individer och grupper med rituella former under mer eller mindre obundna förutsättningar. En stor del av det rituella nyskapandet återfinns emellertid utanför de etablerade religiösa institutionerna och traditionens ortopraxi. Här ses ritualer oRitual creativity may seem like a contradiction in terms, yet the religious landscape in contemporary Euro-America is permeate with experimentation of ritual forms, different modalities of action, imagination and play as routes to authenticity. The present study examines different settings in Europe involved in such ritual creativity, which would commonly be classified as postmodern spirituality,
In this paper, we present a new color buffer compression algorithm for floating-point buffers. It can operate in either an approximate (lossy) mode or in an exact (lossless) mode. The approximate mode is error-bounded and the amount of introduced accumulated error is controlled via a few parameters. The core of the algorithm lies in an efficient representation and color space transform, followed b
