Full Papers 2012 - CGF 31-Issue 2

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/13884

Browse

Now showing 1 - 20 of 67

3D Material Style Transfer
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Nguyen, Chuong H.; Ritschel, Tobias; Myszkowski, Karol; Eisemann, Elmar; Seidel, Hans-Peter; P. Cignoni and T. Ertl
This work proposes a technique to transfer the material style or mood from a guide source such as an image or video onto a target 3D scene. It formulates the problem as a combinatorial optimization of assigning discrete materials extracted from the guide source to discrete objects in the target 3D scene. The assignment is optimized to fulfill multiple goals: overall image mood based on several image statistics; spatial material organization and grouping as well as geometric similarity between objects that were assigned to similar materials. To be able to use common uncalibrated images and videos with unknown geometry and lighting as guides, a material estimation derives perceptually plausible reflectance, specularity, glossiness, and texture. Finally, results produced by our method are compared to manual material assignments in a perceptual study.
Advected Tangent Curves: A General Scheme for Characteristic Curves of Flow Fields
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Weinkauf, Tino; Hege, Hans-Christian; Theisel, Holger; P. Cignoni and T. Ertl
We present the first general scheme to describe all four types of characteristic curves of flow fields - stream, path, streak, and time lines - as tangent curves of a derived vector field. Thus, all these lines can be obtained by a simple integration of an autonomous ODE system. Our approach draws on the principal ideas of the recently introduced tangent curve description of streak lines. We provide the first description of time lines as tangent curves of a derived vector field, which could previously only be constructed in a geometric manner. Furthermore, our scheme gives rise to new types of curves. In particular, we introduce advected stream lines as a parameterfree variant of the time line metaphor. With our novel mathematical description of characteristic curves, a large number of feature extraction and analysis tools becomes available for all types of characteristic curves, which were previously only available for stream and path lines. We will highlight some of these possible applications including the computation of time line curvature fields and the extraction of cores of swirling advected stream lines.
Analytic Anti-Aliasing of Linear Functions on Polytopes
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Auzinger, Thomas; Guthe, Michael; Jeschke, Stefan; P. Cignoni and T. Ertl
This paper presents an analytic formulation for anti-aliased sampling of 2D polygons and 3D polyhedra. Our framework allows the exact evaluation of the convolution integral with a linear function defined on the polytopes. The filter is a spherically symmetric polynomial of any order, supporting approximations to refined variants such as the Mitchell-Netravali filter family. This enables high-quality rasterization of triangles and tetrahedra with linearly interpolated vertex values to regular and non-regular grids. A closed form solution of the convolution is presented and an efficient implementation on the GPU using DirectX and CUDA C is described.
Automatically Rigging Multi-component Characters
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Bharaj, Gaurav; Thormählen, Thorsten; Seidel, Hans-Peter; Theobalt, Christian; P. Cignoni and T. Ertl
Rigging an arbitrary 3D character by creating an animation skeleton is a time-consuming process even for experienced animators. In this paper, we present an algorithm that automatically creates animation rigs for multicomponent 3D models, as they are typically found in online shape databases. Our algorithm takes as input a multi-component model and an input animation skeleton with associated motion data. It then creates a target skeleton for the input model, calculates the rigid skinning weights, and a mapping between the joints of the target skeleton and the input animation skeleton. The automatic approach does not need additional semantic information, such as component labels or user-provided correspondences, and succeeds on a wide range of models where the number of components is significantly different. It implicitly handles large scale and proportional differences between input and target skeletons and can deal with certain morphological differences, e.g., if input and target have different numbers of limbs. The output of our algorithm can be directly used in a retargeting system to create a plausible animated character.
Black is Green: Adaptive Color Transformation For Reduced Ink Usage
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Shapira, Lior; Oicherman, Boris; P. Cignoni and T. Ertl
A vast majority of color transformations applied to an image in the digital press industry are static and precalculated. In order to achieve the best quality on a wide variety of different images, these transformations tend to be highly conservative with respect to the use of black ink. This results in excessive use of inks, which has a negative economic and environmental impact. We present a method for dynamic computation of color transformation based on image content, with the aim to reduce ink usage. We analyze the image, and predict areas in which quality artifacts that may result from such a reduction will be masked by the image content. These areas include detailed textures, noisy areas and structure. We then replace the image CMYK values by a new combination with increased black. Our algorithm ensures negligible color shifts in the resulting image, and no visible reduction in quality. We achieve an average of over 10% ink savings.
A Cell-Based Light Interaction Model for Human Blood
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Yim, Daniel; Baranoski, Gladimir V. G.; Kimmel, Brad W.; Chen, T. Francis; Miranda, Erik; P. Cignoni and T. Ertl
The development of predictive appearance models for organic tissues is a challenging task due to the inherent complexity of these materials. In this paper, we closely examine the biophysical processes responsible for the appearance attributes of whole blood, one the most fundamental of these materials. We describe a new appearance model that simulates the mechanisms of light propagation and absorption within the cellular and fluid portions of this specialized tissue. The proposed model employs a comprehensive, and yet flexible first principles approach based on the morphological, optical and biochemical properties of blood cells. This approach allows for environment driven changes in the cells' anatomy and orientation to be appropriately included into the light transport simulations. The correctness and predictive capabilities of the proposed model are quantitatively and qualitatively evaluated through comparisons of modeled results with actual measured data and experimental observations reported in the scientific literature. Its incorporation into rendering systems is illustrated through images of blood samples depicting appearance variations controlled by physiologically meaningful parameters. Besides the contributions to the modeling of material appearance, the research presented in this paper is also expected to have applications in a wide range of biomedical areas, from optical diagnostics to the visualization and noninvasive imaging of blood-perfused tissues.
Centroidal Voronoi Tessellation of Line Segments and Graphs
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Lu, Lin; Lévy, Bruno; Wang, Wenping; P. Cignoni and T. Ertl
Centroidal Voronoi Tessellation (CVT) of points has many applications in geometry processing, including remeshing and segmentation, to name but a few. In this paper, we generalize the CVT concept to graphs via a variational characterization. Given a graph and a 3D polygonal surface, our method optimizes the placement of the vertices of the graph in such a way that the graph segments best approximate the shape of the surface. We formulate the computation of CVT for graphs as a continuous variational problem, and present a simple, approximate method for solving this problem. Our method is robust in the sense that it is independent of degeneracies in the input mesh, such as skinny triangles, T-junctions, small gaps or multiple connected components. We present some applications, to skeleton fitting and to shape segmentation.
Coding Depth through Mask Structure
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Fortunato, Horacio E.; Oliveira, Manuel M.; P. Cignoni and T. Ertl
We present a coded-aperture method based on a family of masks obtained as the convolution of one "hole" with a structural component consisting of an arrangement of Dirac delta functions. We call the arrangement of delta functions the structural component of the mask, and use it to efficiently encode scene distance information. We illustrate the potential of our approach by analyzing a family of masks defined by a circular hole component and a structural component consisting of a linear combination of three Dirac deltas. We show that the structural component transitions from well conditioned to ill conditioned as the relative weight of the central peak varies with respect to the lateral ones. For the well-conditioned structural components, deconvolution is efficiently performed by inverse filtering, allowing for fast estimation of scene depth. We demonstrate the effectiveness of our approach by constructing a mask for distance coding and using it to recover pairs of distance maps and structurally-deconvolved images from single photographs. For this application, we obtain significant speedup, and extended range and depth resolution compared to previous techniques.
Coherent Spatiotemporal Filtering, Upsampling and Rendering of RGBZ Videos
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Richardt, Christian; Stoll, Carsten; Dodgson, Neil A.; Seidel, Hans-Peter; Theobalt, Christian; P. Cignoni and T. Ertl
Sophisticated video processing effects require both image and geometry information. We explore the possibility to augment a video camera with a recent infrared time-of-flight depth camera, to capture high-resolution RGB and low-resolution, noisy depth at video frame rates. To turn such a setup into a practical RGBZ video camera, we develop efficient data filtering techniques that are tailored to the noise characteristics of IR depth cameras. We first remove typical artefacts in the RGBZ data and then apply an efficient spatiotemporal denoising and upsampling scheme. This allows us to record temporally coherent RGBZ videos at interactive frame rates and to use them to render a variety of effects in unprecedented quality. We show effects such as video relighting, geometry-based abstraction and stylisation, background segmentation and rendering in stereoscopic 3D.
Computational Design of Rubber Balloons
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Skouras, Mélina; Thomaszewski, Bernhard; Bickel, Bernd; Gross, Markus; P. Cignoni and T. Ertl
This paper presents an automatic process for fabrication-oriented design of custom-shaped rubber balloons. We cast computational balloon design as an inverse problem: given a target shape, we compute an optimal balloon that, when inflated, approximates the target as closely as possible. To solve this problem numerically, we propose a novel physics-driven shape optimization method, which combines physical simulation of inflatable elastic membranes with a dedicated constrained optimization algorithm. We validate our approach by fabricating balloons designed with our method and comparing their inflated shapes to the results predicted by simulation. An extensive set of manufactured sample balloons demonstrates the shape diversity that can be achieved by our method.
A Computational Model of Afterimages
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Ritschel, Tobias; Eisemann, Elmar; P. Cignoni and T. Ertl
Afterimages are optical illusions, particularly well perceived when fixating an image for an extended period of time and then looking at a neutral background, where an inverted copy of the original stimulus appears. The full mechanism that produces the perceived specific colors and shapes is complex and not entirely understood, but most of the important attributes can be well explained by bleaching of retinal photoreceptors (retinal kinetics). We propose a model to compute afterimages that allows us to simulate their temporal, color and time-frequency behavior. Using this model, high dynamic range (HDR) content can be processed to add realistic afterimages to low dynamic range (LDR) media. Hereby, our approach helps in conveying the original source's luminance and contrast. It can be applied in real-time on full-HD HDR content using standard graphics hardware. Finally, our approach is validated in a perceptual study.
A Continuous, Editable Representation for Deforming Mesh Sequences with Separate Signals for Time, Pose and Shape
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Cashman, Thomas J.; Hormann, Kai; P. Cignoni and T. Ertl
It is increasingly popular to represent non-rigid motion using a deforming mesh sequence: a discrete sequence of frames, each of which is given as a mesh with a common graph structure. Such sequences have the flexibility to represent a wide range of mesh deformations used in practice, but they are also highly redundant, expensive to store, and difficult to edit in a time-coherent manner. We address these limitations with a continuous representation that extracts redundancy in three separate phases, leading to separate editable signals in time, pose and shape. The representation can be applied to any deforming mesh sequence, in contrast to previous domain-specific approaches. By modifying the three signal components, we demonstrate time-coherent editing operations such as local repetition of part of a sequence, frame rate conversion and deformation transfer. We also show that our representation makes it possible to design new deforming sequences simply by sketching a curve in a 2D pose space.
crdbrd: Shape Fabrication by Sliding Planar Slices
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Hildebrand, Kristian; Bickel, Bernd; Alexa, Marc; P. Cignoni and T. Ertl
We introduce an algorithm and representation for fabricating 3D shape abstractions using mutually intersecting planar cut-outs. The planes have prefabricated slits at their intersections and are assembled by sliding them together. Often such abstractions are used as a sculptural art form or in architecture and are colloquially called 'cardboard sculptures'. Based on an analysis of construction rules, we propose an extended binary space partitioning tree as an efficient representation of such cardboard models which allows us to quickly evaluate the feasibility of newly added planar elements. The complexity of insertion order quickly increases with the number of planar elements and manual analysis becomes intractable. We provide tools for generating cardboard sculptures with guaranteed constructibility. In combination with a simple optimization and sampling strategy for new elements, planar shape abstraction models can be designed by iteratively adding elements. As an output, we obtain a fabrication plan that can be printed or sent to a laser cutter. We demonstrate the complete process by designing and fabricating cardboard models of various well-known 3D shapes.
Creating Picture Legends for Group Photos
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Gao, Junhong; Kim, Seon Joo; Brown, Michael S.; P. Cignoni and T. Ertl
Group photos are one of the most common types of digital images found in personal image collections and on social networks. One typical post-processing task for group photos is to produce a key or legend to identify the people in the photo. This is most often done using simple bounding boxes. A more professional approach is to create a picture legend that uses either a full or partial silhouette to identify the individuals. This paper introduces an efficient method for producing picture legends for group photos. Our approach combines face detection with human shape priors into an interactive selection framework to allow users to quickly segment the individuals in a group photo. Our results are better than those obtained by general selection tools and can be produced in a fraction of the time.
Crowd Light: Evaluating the Perceived Fidelity of Illuminated Dynamic Scenes
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Jarabo, Adrian; Eyck, Tom Van; Sundstedt, Veronica; Bala, Kavita; Gutierrez, Diego; O'Sullivan, Carol; P. Cignoni and T. Ertl
Rendering realistic illumination effects for complex animated scenes with many dynamic objects or characters is computationally expensive. Yet, it is not obvious how important such accurate lighting is for the overall perceived realism in these scenes. In this paper, we present a methodology to evaluate the perceived fidelity of illumination in scenes with dynamic aggregates, such as crowds, and explore several factors which may affect this perception. We focus in particular on evaluating how a popular spherical harmonics lighting method can be used to approximate realistic lighting of crowds. We conduct a series of psychophysical experiments to explore how a simple approach to approximating global illumination, using interpolation in the temporal domain, affects the perceived fidelity of dynamic scenes with high geometric, motion, and illumination complexity. We show that the complexity of the geometry and temporal properties of the crowd entities, the motion of the aggregate as a whole, the type of interpolation (i.e., of the direct and/or indirect illumination coefficients), and the presence or absence of colour all affect perceived fidelity. We show that high (i.e., above 75%) levels of perceived scene fidelity can be maintained while interpolating indirect illumination for intervals of up to 30 frames, resulting in a greater than three-fold rendering speed-up
Data Driven Surface Reflectance from Sparse and Irregular Samples
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Ruiters, Roland; Schwartz, Christopher; Klein, Reinhard; P. Cignoni and T. Ertl
In recent years, measuring surface reflectance has become an established method for high quality renderings. In this context, especially non-parametric representations got a lot of attention as they allow for a very accurate representation of complex reflectance behavior. However, the acquisition of this data is a challenging task especially if complex object geometry is involved. Capturing images of the object under varying illumination and view conditions results in irregular angular samplings of the reflectance function with a limited angular resolution. Classical data-driven techniques, like tensor factorization, are not well suited for such data sets as they require a resampling of the high dimensional measurement data to a regular grid. This grid has to be on a much higher angular resolution to avoid resampling artifacts which in turn would lead to data sets of enormous size. To overcome these problems we introduce a novel, compact data-driven representation of reflectance functions based on a sum of separable functions which are fitted directly to the irregular set of data without any further resampling. The representation allows for efficient rendering and is also well suited for GPU applications. By exploiting spatial coherence of the reflectance function over the object a very precise reconstruction even of specular materials becomes possible already with a sparse input sampling. This would be impossible using standard data interpolation techniques. Since our algorithm exclusively operates on the compressed representation, it is both efficient in terms of memory use and computational complexity, depending only sub-linearly on the size of the fully tabulated data. The quality of the reflectance function is evaluated on synthetic data sets as ground truth as well as on real world measurements.
Data-Driven Estimation of Cloth Simulation Models
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Miguel, Eder; Bradley, Derek; Thomaszewski, Bernhard; Bickel, Bernd; Matusik, Wojciech; Otaduy, Miguel A.; Marschner, Steve; P. Cignoni and T. Ertl
Progress in cloth simulation for computer animation and apparel design has led to a multitude of deformation models, each with its own way of relating geometry, deformation, and forces. As simulators improve, differences between these models become more important, but it is difficult to choose a model and a set of parameters to match a given real material simply by looking at simulation results. This paper provides measurement and fitting methods that allow nonlinear models to be fit to the observed deformation of a particular cloth sample. Unlike standard textile testing, our system measures complex 3D deformations of a sheet of cloth, not just one-dimensional force-displacement curves, so it works under a wider range of deformation conditions. The fitted models are then evaluated by comparison to measured deformations with motions very different from those used for fitting.
Data-Driven Object Manipulation in Images
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Goldberg, Chen; Chen, Tao; Zhang, Fang-Lue; Shamir, Ariel; Hu, Shi-Min; P. Cignoni and T. Ertl
We present a framework for interactively manipulating objects in a photograph using related objects obtained from internet images. Given an image, the user selects an object to modify, and provides keywords to describe it. Objects with a similar shape are retrieved and segmented from online images matching the keywords, and deformed to correspond with the selected object. By matching the candidate object and adjusting manipulation parameters, our method appropriately modifies candidate objects and composites them into the scene. Supported manipulations include transferring texture, color and shape from the matched object to the target in a seamless manner. We demonstrate the versatility of our framework using several inputs of varying complexity, for object completion, augmentation, replacement and revealing. Our results are evaluated using a user study.
Explicit Mesh Surfaces for Particle Based Fluids
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Yu, Jihun; Wojtan, Chris; Turk, Greg; Yap, Chee; P. Cignoni and T. Ertl
We introduce the idea of using an explicit triangle mesh to track the air/fluid interface in a smoothed particle hydrodynamics (SPH) simulator. Once an initial surface mesh is created, this mesh is carried forward in time using nearby particle velocities to advect the mesh vertices. The mesh connectivity remains mostly unchanged across time-steps; it is only modified locally for topology change events or for the improvement of triangle quality. In order to ensure that the surface mesh does not diverge from the underlying particle simulation, we periodically project the mesh surface onto an implicit surface defined by the physics simulation. The mesh surface gives us several advantages over previous SPH surface tracking techniques. We demonstrate a new method for surface tension calculations that clearly outperforms the state of the art in SPH surface tension for computer graphics. We also demonstrate a method for tracking detailed surface information (like colors) that is less susceptible to numerical diffusion than competing techniques. Finally, our temporally-coherent surface mesh allows us to simulate highresolution surface wave dynamics without being limited by the particle resolution of the SPH simulation.
Exploring Shape Variations by 3D-Model Decomposition and Part-based Recombination
(The Eurographics Association and John Wiley and Sons Ltd., 2012) Jain, Arjun; Thormählen, Thorsten; Ritschel, Tobias; Seidel, Hans-Peter; P. Cignoni and T. Ertl
We present a system that allows new shapes to be created by blending between shapes taken from a database. We treat the shape as a composition of parts; blending is performed by recombining parts from different shapes according to constraints deduced by shape analysis. The analysis involves shape segmentation, contact analysis, and symmetry detection. The system can be used to rapidly instantiate new models that have similar symmetry and adjacency structure to the database shapes, yet vary in appearance.

Browse

Browsing Full Papers 2012 - CGF 31-Issue 2 by Title

Results Per Page

Sort Options