Filtyp
Abstract in UndeterminedDataflow descriptions have been used ina wide range of Digital Signal Processing (DSP)applications, such as multi-media processing, andwireless communications. Among various forms ofdataflow modeling, Synchronous Dataflow (SDF) isgeared towards static scheduling of computationalmodules, which improves system performance andpredictability. However, many DSP applicationsdo no
The oxidation of biogenic volatile organic compounds (BVOCs) gives a range of products, from semi-volatile to extremely low-volatility compounds. To treat the interaction of these secondary organic vapours with the particle phase, global aerosol microphysics models generally use either a thermodynamic partitioning approach (assuming instant equilibrium between semi-volatile oxidation products and
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
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
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
This article contains a study of how spatial errors and receiver imperfections affect the angle of arrival estimation accuracy for virtual antenna arrays. A virtual antenna array consists of one receiver element whose location is tracked as the element is moved and in this work, linear arrays are studied. If the location of the receiver is tracked using an inertial measurement unit, an interesting
In this paper we examine the idea of implementing communicating sequential processes (CSP) constructs on a Java embedded chip multiprocessor (CMP). The approach is intended to reduce the memory bandwidth pressure on the shared memory, by employing a dedicated network-on-chip (NoC). The presented solution is scalable and also specific for our limited resources and real-time predictability requireme
While research on the design of heterogeneous concurrent systems has a long and rich history, a unified design methodology and tool support has not emerged so far, and thus the creation of such systems remains a difficult, time-consuming and error-prone process. The absence of principled support for system evaluation and optimization at high abstraction levels makes the quality of the resulting im
Since the 1960s, product designers, architects, lighting planners, gamers and scientific visualizaiton specialists have craved the ability to work in real-time three-dimensional photorealistic virtual worlds. The authors, one specializing in making computer graphics more convincing and the other focusing on making them faster, present the achievements and challenges in the race for real-time photo
The parallel structure of dataflow programs and their support for processing streams of data make dataflow programming an interesting tool for doing stream processing on parallel processing architectures. The computational kernels, the actors, of a dataflow program communicate with other actors via FIFO channels. The actors in the dataflow model used in this paper may perform different actions dep
This paper addresses design space exploration for streaming applications (such as MPEG) running on multi-processor platforms with guaranteed service interconnects. In particular, we solve mapping, path selection and router configuration problems. Given the complexity of these problems, state of the art approaches in this area largely rely on greedy heuristics, which do not guarantee optimality. Ou
