Arjan Kuijper

Fraunhofer IGD, Management, Faculty Member

Technische Universität Darmstadt, Computer Science, Faculty Member

Followers

Following

Co-authors

Public Views

Visual computing, Image Analysis, Image Processing, Scale Space, PDE Methods, Pattern Recognition, Computer Vision, Computer Graphics, Symmetry Sets, white math
Address: TU Darmstadt
Fraunhofer IGD

less

InterestsView All (7)

Uploads

Papers by Arjan Kuijper

Effective Dynamic Scheduling on Heterogeneous Multi/Manycore Desktop Platforms

by Arjan Kuijper, Dieter Fellner, Andre Stork, and Carlos Eduardo Pereira

2010 22nd International Symposium on Computer Architecture and High Performance Computing Workshops, 2010

GPUs (Graphics Processing Units) have become one of the main co-processors that contributed to de... more GPUs (Graphics Processing Units) have become one of the main co-processors that contributed to desktops towards high performance computing. Together with multicore CPUs and other co-processors, a powerful heterogeneous execution platform is built on a desktop for data intensive calculations. In our perspective, we see the modern desktop as a heterogeneous cluster that can deal with several applications&amp;amp;amp;amp;amp;amp;amp;#39;tasks at the

Visual analysis of large graphs

by Arjan Kuijper, Dieter Fellner, and Tobias Schreck

Page 1. EUROGRAPHICS '0x/ NN and NN STAR State of The Art Report Visual Analysis of Large ... more

3D Reconstruction from Line Drawings

by Dieter Fellner, Arjan Kuijper, and Andre Stork

ABSTRACT In this work we introduce an approach for reconstructing digital 3D models from multiple... more ABSTRACT In this work we introduce an approach for reconstructing digital 3D models from multiple perspective line drawings. One major goal is to keep the required user interaction simple and at a minimum, while making no constraints to the objects shape. Such a system provides a useful extension for digitalization of paper-based styling concepts, which today is still a time consuming process. In the presented method the line drawings are first decomposed in curves assembling a network of curves. In a second step, the positions for the endpoints of the curves are determined in 3D, using multiple sketches and a virtual camera model given by the user. Then the shapes of the 3D curves between the reconstructed 3D endpoints are inferred. This leads to a network of 3D curves, which can be used for first visual evaluations in 3D. During the whole process only little user interaction is needed, which only takes place in the pre- and post-processing phases. The approach has been applied on multiple sketches and it is shown that the approach creates plausible results within reasonable timing.

Towards precise real-time 3D difference detection for industrial applications

by Arjan Kuijper and Dieter Fellner

Computers in Industry, 2013

ABSTRACT 3D difference detection is the task to verify whether the 3D geometry of a real object e... more ABSTRACT 3D difference detection is the task to verify whether the 3D geometry of a real object exactly corresponds to a 3D model of this object. We present an approach for 3D difference detection with a hand-held depth camera. In contrast to previous approaches, with the presented approach geometric differences can be detected in real-time and from arbitrary viewpoints. The 3D difference detection accuracy is improved by two approaches: first, the precision of the depth camera&#39;s pose estimation is improved by coupling the depth camera with a high precision industrial measurement arm. Second, the influence of the depth measurement noise is reduced by integrating a 3D surface reconstruction algorithm. The effects of both enhancements are quantified by a ground-truth based quantitative evaluation, both for a time-of-flight (SwissRanger 4000) and a structured light depth camera (Kinect). With the proposed enhancements, differences of few millimeters can be detected from 1 m measurement distance.

Adapting precomputed radiance transfer to real-time spectral rendering

by Dieter Fellner and Arjan Kuijper

Spectral rendering takes the full visible spectrum into account when calculating light-surface in... more Spectral rendering takes the full visible spectrum into account when calculating light-surface interaction and can overcome the well-known deficiencies of rendering with tristimulus color models. We present a variant of the precomputed radiance transfer algorithm that is tailored towards real-time spectral rendering on modern graphics hardware. Our method renders diffuse, self-shadowing objects with spatially varying spectral reflectance properties under distant, dynamic, full-spectral illumination. To achieve real-time frame rates and practical memory requirements we split the light transfer function into an achromatic part that varies per vertex and a wavelengthdependent part that represents a spectral albedo texture map. As an additional optimization, we project reflectance and illuminant spectra into an orthonormal basis. One area of application for our research is virtual design applications that require relighting objects with high color fidelity at interactive frame rates.

Download

An Effective Dynamic Scheduling Runtime and Tuning System for Heterogeneous Multi and Many-Core Desktop Platforms

by Arjan Kuijper, Dieter Fellner, Andre Stork, and Carlos Eduardo Pereira

2011 IEEE International Conference on High Performance Computing and Communications, 2011

ABSTRACT A personal computer can be considered as a one-node heterogeneous cluster that simultane... more ABSTRACT A personal computer can be considered as a one-node heterogeneous cluster that simultaneously processes several application tasks. It can be composed by, for example, asymmetric CPU and GPUs. This way, a high-performance heterogeneous platform is built on a desktop for data intensive engineering calculations. In our perspective, a workload distribution over the Processing Units (PUs) plays a key role in such systems. This issue presents challenges since the cost of a task at a PU is non-deterministic and can be affected by parameters not known a priori. This paper presents a context-aware runtime and tuning system based on a compromise between reducing the execution time of engineering applications - due to appropriate dynamic scheduling - and the cost of computing such scheduling applied on a platform composed of CPU and GPUs. Results obtained in experimental case studies are encouraging and a performance gain of 21.77% was achieved in comparison to the static assignment of all tasks to the GPU.

Visual Analysis of Large Graphs: State-of-the-Art and Future Research Challenges

by Arjan Kuijper, Dieter Fellner, and Tobias Schreck

Computer Graphics Forum, 2011

The analysis of large graphs plays a prominent role in various fields of research and is relevant... more The analysis of large graphs plays a prominent role in various fields of research and is relevant in many important application areas. Effective visual analysis of graphs requires appropriate visual presentations in combination with respective user interaction facilities and algorithmic graph analysis methods. How to design appropriate graph analysis systems depends on many factors, including the type of graph describing the data, the analytical task at hand, and the applicability of graph analysis methods. The most recent surveys of graph visualization and navigation techniques cover techniques that had been introduced until 2000 or concentrate only on graph layouts published until 2002. Recently, new techniques have been developed covering a broader range of graph types, such as time-varying graphs. Also, in accordance with ever growing amounts of graph-structured data becoming available, the inclusion of algorithmic graph analysis and interaction techniques becomes increasingly important. In this State-of-the-Art Report, we survey available techniques for the visual analysis of large graphs. Our review firstly considers graph visualization techniques according to the type of graphs supported. The visualization techniques form the basis for the presentation of interaction approaches suitable for visual graph exploration. As an important component of visual graph analysis, we discuss various graph algorithmic aspects useful for the different stages of the visual graph analysis process. We also present main open research challenges in this field.

Download

Iterative SLE Solvers over a CPU-GPU Platform

by Arjan Kuijper, Dieter Fellner, Andre Stork, and Carlos Eduardo Pereira

2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC), 2010

AbstractGPUs (Graphics Processing Units) have become one of the main co-processors that contribu... more

Computing Symmetry Sets from 3D Shapes

In this paper we discuss the implementation of 3D Symmetry Sets. It describes how the Symmetry Se... more In this paper we discuss the implementation of 3D Symmetry Sets. It describes how the Symmetry Set can be derived given a parametrized shape, as well as given an unorganized point cloud. It presents a geometric method to derive the Symmetry Set, that is an extension of the one given in deliverable 10. Just as in the 2D case, level

Logical Filtering in Scale Space

Developmental Biology, 2002

Using a Gaussian scale space, one can use the extra dimension, viz. scale, for investigation of “... more Using a Gaussian scale space, one can use the extra dimension, viz. scale, for investigation of “built-in” properties of the image in scale space. We show that one of such induced properties is the nesting of special iso-intensity manifolds, that yield an implicit present hierarchy of the critical points and regions of their influence, in the original image. Its very

The Application of Catastrophe Theory to Image Analysis

Siam Journal on Numerical Analysis, 2001

In order to investigate the deep structure of Gaussian scale space images, one needs to understan... more In order to investigate the deep structure of Gaussian scale space images, one needs to understand the behaviour of critical points under the in flence of blurring. We show how the mathematical framework of catastrophe theory can be used to describe the various different types of annihilations and the creation of pairs of critical points and how this knowledge can

User Similarity and Deviation Analysis for Adaptive Visualizations

Lecture Notes in Computer Science, 2014

Measuring context relevance for adaptive semantics visualizations

Proceedings of the 14th International Conference on Knowledge Technologies and Data-driven Business - i-KNOW '14, 2014

Text and image area classification in mobile scanned digitised documents

International Journal of Applied Pattern Recognition, 2014

ABSTRACT Post processing and automatic interpretation of images plays an increasingly important r... more ABSTRACT Post processing and automatic interpretation of images plays an increasingly important role in the mobile area. Both for the efficient compression and for the automatic evaluation of text, it is useful to store text content as textual information rather than as graphics information. For this purpose pictures from magazines are recorded with the camera of a smartphone and classified according to text and image areas. In this work established desktop procedures are presented and analysed in terms of their applications on mobile devices. Based on these methods, an approach for image segmentation and classification on mobile devices is developed, taking into account the limited resources of these mobile devices.

Multi-view Photometric Stereo by Example

2014 2nd International Conference on 3D Vision, 2014

Inbound interdomain traffic engineering with LISP

39th Annual IEEE Conference on Local Computer Networks, 2014

A Benchmarking Model for Sensors in Smart Environments

Lecture Notes in Computer Science, 2014

In smart environments, developers can choose from a large variety of sensors supporting their use... more In smart environments, developers can choose from a large variety of sensors supporting their use case that have specific advantages or disadvantages. In this work we present a benchmarking model that allows estimating the utility of a sensor technology for a use case by calculating a single score, based on a weighting factor for applications and a set of sensor features. This set takes into account the complexity of smart environment systems that are comprised of multiple subsystems and applied in non-static environments. We show how the model can be used to find a suitable sensor for a use case and the inverse option to find suitable use cases for a given set of sensors. Additionally, extensions are presented that normalize differently rated systems and compensate for central tendency bias. The model is verified by estimating technology popularity using a frequency analysis of associated search terms in two scientific databases.

Download

Recognition of Bed Postures Using Mutual Capacitance Sensing

Lecture Notes in Computer Science, 2014

Screen-Space Ambient Occlusion Using A-Buffer Techniques

2013 International Conference on Computer-Aided Design and Computer Graphics, 2013

Computing ambient occlusion in screen-space (SSAO) is a common technique in real-time rendering a... more Computing ambient occlusion in screen-space (SSAO) is a common technique in real-time rendering applications which use rasterization to process 3D triangle data. However, one of the most critical problems emerging in screenspace is the lack of information regarding occluded geometry which does not pass the depth test and is therefore not resident in the G-buffer. These occluded fragments may have an impact on the proximity-based shadowing outcome of the ambient occlusion pass. This not only decreases image quality but also prevents the application of SSAO on multiple layers of transparent surfaces where the shadow contribution depends on opacity.

Download

Spatial data structures for accelerated 3D visibility computation to enable large model visualization on the web

Proceedings of the Nineteenth International ACM Conference on 3D Web Technologies - Web3D '14, 2014

ABSTRACT The visualization of massive 3D models is an intensively examined field of research. Due... more ABSTRACT The visualization of massive 3D models is an intensively examined field of research. Due to their rapidly growing complexity of such models, visualisation them in real-time will never be possible through a higher speed of rasterization alone. Instead, a practical solution has to reduce the amount of data to be processed, using a fast visibility determination. In recent years, the combination of Javascript and WebGL raised attention for the possibility of rendering hardware-accelerated 3D graphics directly in the browser. However, when compared to desktop applications, they are still fighting with their disadvantages of a generally slower execution speed, or a downgraded set of functionality. We demonstrate the integration of spatial data structures, computed on the client side, using latest technology trends to mitigate the shortcomings of the 3D Web environment. We employ comparably small bounding volume hierarchies to accelerate our visibility determination, as well as to enable specific culling techniques. This allows for an interactive visualization of such massive 3D data sets. Our in-depth analysis of different data structures and environments shows which combination of data structure and visibility determination techniques are currently the best fit for the Web.

Arjan Kuijper

Uploads

Papers by Arjan Kuijper

Log In