35-Issue 2

Permanent URI for this collection

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

Browse

Now showing 1 - 20 of 49

Automatic Portrait Segmentation for Image Stylization
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Shen, Xiaoyong; Hertzmann, Aaron; Jia, Jiaya; Paris, Sylvain; Price, Brian; Shechtman, Eli; Sachs, Ian; Joaquim Jorge and Ming Lin
Portraiture is a major art form in both photography and painting. In most instances, artists seek to make the subject stand out from its surrounding, for instance, by making it brighter or sharper. In the digital world, similar effects can be achieved by processing a portrait image with photographic or painterly filters that adapt to the semantics of the image. While many successful user-guided methods exist to delineate the subject, fully automatic techniques are lacking and yield unsatisfactory results. Our paper first addresses this problem by introducing a new automatic segmentation algorithm dedicated to portraits. We then build upon this result and describe several portrait filters that exploit our automatic segmentation algorithm to generate high-quality portraits.
Geometry and Attribute Compression for Voxel Scenes
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Dado, Bas; Kol, Timothy R.; Bauszat, Pablo; Thiery, Jean-Marc; Eisemann, Elmar; Joaquim Jorge and Ming Lin
Voxel-based approaches are today's standard to encode volume data. Recently, directed acyclic graphs (DAGs) were successfully used for compressing sparse voxel scenes as well, but they are restricted to a single bit of (geometry) information per voxel. We present a method to compress arbitrary data, such as colors, normals, or reflectance information. By decoupling geometry and voxel data via a novel mapping scheme, we are able to apply the DAG principle to encode the topology, while using a palette-based compression for the voxel attributes, leading to a drastic memory reduction. Our method outperforms existing state-of-the-art techniques and is well-suited for GPU architectures. We achieve real-time performance on commodity hardware for colored scenes with up to 17 hierarchical levels (a 128K3 voxel resolution), which are stored fully in core.
Compressed Multiresolution Hierarchies for High-Quality Precomputed Shadows
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Scandolo, Leonardo; Bauszat, Pablo; Eisemann, Elmar; Joaquim Jorge and Ming Lin
The quality of shadow mapping is traditionally limited by texture resolution. We present a novel lossless compression scheme for high-resolution shadow maps based on precomputed multiresolution hierarchies. Traditional multiresolution trees can compactly represent homogeneous regions of shadow maps at coarser levels, but require many nodes for fine details. By conservatively adapting the depth map, we can significantly reduce the tree complexity. Our proposed method offers high compression rates, avoids quantization errors, exploits coherency along all data dimensions, and is well-suited for GPU architectures. Our approach can be applied for coherent shadow maps as well, enabling several applications, including high-quality soft shadows and dynamic lights moving on fixed-trajectories.
Inertial Steady 2D Vector Field Topology
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Günther, Tobias; Theisel, Holger; Joaquim Jorge and Ming Lin
Vector field topology is a powerful and matured tool for the study of the asymptotic behavior of tracer particles in steady flows. Yet, it does not capture the behavior of finite-sized particles, because they develop inertia and do not move tangential to the flow. In this paper, we use the fact that the trajectories of inertial particles can be described as tangent curves of a higher dimensional vector field. Using this, we conduct a full classification of the first-order critical points of this higher dimensional flow, and devise a method to their efficient extraction. Further, we interactively visualize the asymptotic behavior of finite-sized particles by a glyph visualization that encodes the outcome of any initial condition of the governing ODE, i.e., for a varying initial position and/or initial velocity. With this, we present a first approach to extend traditional vector field topology to the inertial case.
VBTC: GPU-Friendly Variable Block Size Texture Encoding
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Krajcevski, Pavel; Golas, Abhinav; Ramani, Karthik; Shebanow, Michael; Manocha, Dinesh; Joaquim Jorge and Ming Lin
Recent advances in computer graphics have relied on high-quality textures in order to generate photorealistic real-time images. Texture compression standards meet these growing demands for data, but current texture compression schemes use fixed-rate methods where statically sized blocks of pixels are represented using the same numbers of bits irrespective of their data content. In order to account for the natural variation in detail, we present an alternative format that allows variable bit-rate texture compression with minimal changes to texturing hardware. Our proposed scheme uses one additional level of indirection to allow the variation of the block size across the same texture. This single change is exploited to both vary the amount of bits allocated to certain parts of the texture and to duplicate redundant texture information across multiple pixels. To minimize hardware changes, the method picks combinations of block sizes and compression methods from existing fixed-rate standards. With this approach, our method is able to demonstrate energy savings of up to 50%, as well as higher quality compressed textures over current state of the art techniques.
DeepProp: Extracting Deep Features from a Single Image for Edit Propagation
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Endo, Yuki; Iizuka, Satoshi; Kanamori, Yoshihiro; Mitani, Jun; Joaquim Jorge and Ming Lin
Edit propagation is a technique that can propagate various image edits (e.g., colorization and recoloring) performed via user strokes to the entire image based on similarity of image features. In most previous work, users must manually determine the importance of each image feature (e.g., color, coordinates, and textures) in accordance with their needs and target images. We focus on representation learning that automatically learns feature representations only from user strokes in a single image instead of tuning existing features manually. To this end, this paper proposes an edit propagation method using a deep neural network (DNN). Our DNN, which consists of several layers such as convolutional layers and a feature combiner, extracts strokeadapted visual features and spatial features, and then adjusts the importance of them. We also develop a learning algorithm for our DNN that does not suffer from the vanishing gradient problem, and hence avoids falling into undesirable locally optimal solutions. We demonstrate that edit propagation with deep features, without manual feature tuning, can achieve better results than previous work.
Building Construction Sets by Tiling Grammar Simplification
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Kalojanov, Javor; Wand, Michael; Slusallek, Philipp; Joaquim Jorge and Ming Lin
This paper poses the problem of fabricating physical construction sets from example geometry: A construction set provides a small number of different types of building blocks from which the example model as well as many similar variants can be reassembled. This process is formalized by tiling grammars. Our core contribution is an approach for simplifying tiling grammars such that we obtain physically manufacturable building blocks of controllable granularity while retaining variability, i.e., the ability to construct many different, related shapes. Simplification is performed by sequences of two types of elementary operations: non-local joint edge collapses in the tile graphs reduce the granularity of the decomposition and approximate replacement operations reduce redundancy. We evaluate our method on abstract graph grammars in addition to computing several physical construction sets, which are manufactured using a commodity 3D printer.
Generalized Diffusion Curves: An Improved Vector Representation for Smooth-Shaded Images
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Jeschke, Stefan; Joaquim Jorge and Ming Lin
This paper generalizes the well-known Diffusion Curves Images (DCI), which are composed of a set of Bezier curves with colors specified on either side. These colors are diffused as Laplace functions over the image domain, which results in smooth color gradients interrupted by the Bezier curves. Our new formulation allows for more color control away from the boundary, providing a similar expressive power as recent Bilaplace image models without introducing associated issues and computational costs. The new model is based on a special Laplace function blending and a new edge blur formulation. We demonstrate that given some user-defined boundary curves over an input raster image, fitting colors and edge blur from the image to the new model and subsequent editing and animation is equally convenient as with DCIs. Numerous examples and comparisons to DCIs are presented.
Fast and Robust Inversion-Free Shape Manipulation
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Liu, Tiantian; Gao, Ming; Zhu, Lifeng; Sifakis, Eftychios; Kavan, Ladislav; Joaquim Jorge and Ming Lin
We present a shape manipulation technique capable of producing deformations of 2D and 3D meshes, guaranteeing that no elements will be inverted. We achieve this by augmenting the quadratic ex-rotated elastic energy with additional convex terms that penalize the presence of inverted elements. Using a schedule of increasing penalty coefficients, we efficiently and robustly converge to an inversion free state by solving a sequence of unconstrained convex minimization problems. This process can be interpreted as a special purpose Semi-Definite Programming (SDP) solver. We demonstrate that our method outperforms solvers used in previous work, including commercial-grade SDP software (MOSEK). As an additional benefit, our method also converges to the solution via a more intuitive path, which can be used for quick preview. We demonstrate the efficacy of our scheme in a number of 2D and 3D shapes undergoing moderate to drastic deformation.
Large Scale Terrain Generation from Tectonic Uplift and Fluvial Erosion
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Cordonnier, Guillaume; Braun, Jean; Cani, Marie-Paule; Benes, Bedrich; Galin, Éric; Peytavie, Adrien; Guérin, Éric; Joaquim Jorge and Ming Lin
At large scale, landscapes result from the combination of two major processes: tectonics which generate the main relief through crust uplift, and weather which accounts for erosion. This paper presents the first method in computer graphics that combines uplift and hydraulic erosion to generate visually plausible terrains. Given a user-painted uplift map, we generate a stream graph over the entire domain embedding elevation information and stream flow. Our approach relies on the stream power equation introduced in geology for hydraulic erosion. By combining crust uplift and stream power erosion we generate large realistic terrains at a low computational cost. Finally, we convert this graph into a digital elevation model by blending landform feature kernels whose parameters are derived from the information in the graph. Our method gives high-level control over the large scale dendritic structures of the resulting river networks, watersheds, and mountains ridges.
Regularizing Image Reconstruction for Gradient-Domain Rendering with Feature Patches
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Manzi, Marco; Vicini, Delio; Zwicker, Matthias; Joaquim Jorge and Ming Lin
We present a novel algorithm to reconstruct high-quality images from sampled pixels and gradients in gradient-domain rendering. Our approach extends screened Poisson reconstruction by adding additional regularization constraints. Our key idea is to exploit local patches in feature images, which contain per-pixels normals, textures, position, etc., to formulate these constraints. We describe a GPU implementation of our approach that runs on the order of seconds on megapixel images. We demonstrate a significant improvement in image quality over screened Poisson reconstruction under the L1 norm. Because we adapt the regularization constraints to the noise level in the input, our algorithm is consistent and converges to the ground truth.
Interactive Videos: Plausible Video Editing using Sparse Structure Points
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Chang, Chia-Sheng; Chu, Hung-Kuo; Mitra, Niloy J.; Joaquim Jorge and Ming Lin
Video remains the method of choice for capturing temporal events. However, without access to the underlying 3D scene models, it remains difficult to make object level edits in a single video or across multiple videos. While it may be possible to explicitly reconstruct the 3D geometries to facilitate these edits, such a workflow is cumbersome, expensive, and tedious. In this work, we present a much simpler workflow to create plausible editing and mixing of raw video footage using only sparse structure points (SSP) directly recovered from the raw sequences. First, we utilize user-scribbles to structure the point representations obtained using structure-from-motion on the input videos. The resultant structure points, even when noisy and sparse, are then used to enable various video edits in 3D, including view perturbation, keyframe animation, object duplication and transfer across videos, etc. Specifically, we describe how to synthesize object images from new views adopting a novel image-based rendering technique using the SSPs as proxy for the missing 3D scene information. We propose a structure-preserving image warping on multiple input frames adaptively selected from object video, followed by a spatio-temporally coherent image stitching to compose the final object image. Simple planar shadows and depth maps are synthesized for objects to generate plausible video sequence mimicking real-world interactions. We demonstrate our system on a variety of input videos to produce complex edits, which are otherwise difficult to achieve.
Structure-adaptive Shape Editing for Man-made Objects
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Fu, Qiang; Chen, Xiaowu; Su, Xiaoyu; Li, Jia; Fu, Hongbo; Joaquim Jorge and Ming Lin
One of the challenging problems for shape editing is to adapt shapes with diversified structures for various editing needs. In this paper we introduce a shape editing approach that automatically adapts the structure of a shape being edited with respect to user inputs. Given a category of shapes, our approach first classifies them into groups based on the constituent parts. The group-sensitive priors, including both inter-group and intra-group priors, are then learned through statistical structure analysis and multivariate regression. By using these priors, the inherent characteristics and typical variations of shape structures can be well captured. Based on such group-sensitive priors, we propose a framework for real-time shape editing, which adapts the structure of shape to continuous user editing operations. Experimental results show that the proposed approach is capable of both structure-preserving and structure-varying shape editing.
Animation Setup Transfer for 3D Characters
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Avril, Quentin; Ghafourzadeh, Donya; Ramachandran, Srinivasan; Fallahdoust, Sahel; Ribet, Sarah; Dionne, Olivier; Lasa, Martin de; Paquette, Eric; Joaquim Jorge and Ming Lin
We present a general method for transferring skeletons and skinning weights between characters with distinct mesh topologies. Our pipeline takes as inputs a source character rig (consisting of a mesh, a transformation hierarchy of joints, and skinning weights) and a target character mesh. From these inputs, we compute joint locations and orientations that embed the source skeleton in the target mesh, as well as skinning weights to bind the target geometry to the new skeleton. Our method consists of two key steps. We first compute the geometric correspondence between source and target meshes using a semi-automatic method relying on a set of markers. The resulting geometric correspondence is then used to formulate attribute transfer as an energy minimization and filtering problem. We demonstrate our approach on a variety of source and target bipedal characters, varying in mesh topology and morphology. Several examples demonstrate that the target characters behave well when animated with either forward or inverse kinematics. Via these examples, we show that our method preserves subtle artistic variations; spatial relationships between geometry and joints, as well as skinning weight details, are accurately maintained. Our proposed pipeline opens up many exciting possibilities to quickly animate novel characters by reusing existing production assets.
Single Image Weathering via Exemplar Propagation
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Iizuka, Satoshi; Endo, Yuki; Kanamori, Yoshihiro; Mitani, Jun; Joaquim Jorge and Ming Lin
This paper presents an efficient approach for generating weathering effects with detailed appearance variations in a single image. Previous approaches merely change chroma or reflectance of weathered objects, which is not sufficient for materials with detailed shading and texture variations, such as growing moss and peeling plaster. Our method propagates such detailed features via seamless patch-based synthesis driven by weathering degree distribution. Unlike previous methods, the weathering degrees are calculated efficiently using Radial Basis Functions even for materials with wide color variations. We use graph cut-based optimization to identify the most weathered region as a ''weathering exemplar'', from which we sample weathering patches. We demonstrate our method enables us to generate various types of detailed weathering effects interactively.
Improved Surface Quality in 3D Printing by Optimizing the Printing Direction
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Wang, Weiming; Zanni, Cédric; Kobbelt, Leif; Joaquim Jorge and Ming Lin
We present a pipeline of algorithms that decomposes a given polygon model into parts such that each part can be 3D printed with high (outer) surface quality. For this we exploit the fact that most 3D printing technologies have an anisotropic resolution and hence the surface smoothness varies significantly with the orientation of the surface. Our pipeline starts by segmenting the input surface into patches such that their normals can be aligned perpendicularly to the printing direction. A 3D Voronoi diagram is computed such that the intersections of the Voronoi cells with the surface approximate these surface patches. The intersections of the Voronoi cells with the input model's volume then provide an initial decomposition. We further present an algorithm to compute an assembly order for the parts and generate connectors between them. A post processing step further optimizes the seams between segments to improve the visual quality. We run our pipeline on a wide range of 3D models and experimentally evaluate the obtained improvements in terms of numerical, visual, and haptic quality.
Smooth Image Sequences for Data-driven Morphing
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Averbuch-Elor, Hadar; Cohen-Or, Daniel; Kopf, Johannes; Joaquim Jorge and Ming Lin
Smoothness is a quality that feels aesthetic and pleasing to the human eye. We present an algorithm for finding ''as-smoothas- possible'' sequences in image collections. In contrast to previous work, our method does not assume that the images show a common 3D scene, but instead may depict different object instances with varying deformations, and significant variation in lighting, texture, and color appearance. Our algorithm does not rely on a notion of camera pose, view direction, or 3D representation of an underlying scene, but instead directly optimizes the smoothness of the apparent motion of local point matches among the collection images. We increase the smoothness of our sequences by performing a global similarity transform alignment, as well as localized geometric wobble reduction and appearance stabilization. Our technique gives rise to a new kind of image morphing algorithm, in which the in-between motion is derived in a data-driven manner from a smooth sequence of real images without any user intervention. This new type of morph can go far beyond the ability of traditional techniques. We also demonstrate that our smooth sequences allow exploring large image collections in a stable manner.
Near-Instant Capture of High-Resolution Facial Geometry and Reflectance
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Fyffe, Graham; Graham, Paul; Tunwattanapong, Borom; Ghosh, Abhijeet; Debevec, Paul; Joaquim Jorge and Ming Lin
We present a near-instant method for acquiring facial geometry and reflectance using a set of commodity DSLR cameras and flashes. Our setup consists of twenty-four cameras and six flashes which are fired in rapid succession with subsets of the cameras. Each camera records only a single photograph and the total capture time is less than the 67ms blink reflex. The cameras and flashes are specially arranged to produce an even distribution of specular highlights on the face. We employ this set of acquired images to estimate diffuse color, specular intensity, specular exponent, and surface orientation at each point on the face. We further refine the facial base geometry obtained from multi-view stereo using estimated diffuse and specular photometric information. This allows final submillimeter surface mesostructure detail to be obtained via shape-from-specularity. The final system uses commodity components and produces models suitable for authoring high-quality digital human characters.
Buoyancy Optimization for Computational Fabrication
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Wang, Lingfeng; Whiting, Emily; Joaquim Jorge and Ming Lin
This paper introduces a design and fabrication pipeline for creating floating forms. Our method optimizes for buoyant equilibrium and stability of complex 3D shapes, applying a voxel-carving technique to control the mass distribution. The resulting objects achieve a desired floating pose defined by a user-specified waterline height and orientation. In order to enlarge the feasible design space, we explore novel ways to load the interior of a design using prefabricated components and casting techniques. 3D printing is employed for high-precision fabrication. For larger scale designs we introduce a method for stacking lasercut planar pieces to create 3D objects in a quick and economic manner. We demonstrate fabricated designs of complex shape in a variety of floating poses.
Character Contact Re-positioning Under Large Environment Deformation
(The Eurographics Association and John Wiley & Sons Ltd., 2016) Tonneau, Steve; Al-Ashqar, Rami Ali; Pettré, Julien; Komura, Taku; Mansard, Nicolas; Joaquim Jorge and Ming Lin
Character animation based on motion capture provides intrinsically plausible results, but lacks the flexibility of procedural methods. Motion editing methods partially address this limitation by adapting the animation to small deformations of the environment.We extend one such method, the so-called relationship descriptors, to tackle the issue of motion editing under large environment deformations. Large deformations often result in joint limits violation, loss of balance, or collisions. Our method handles these situations by automatically detecting and re-positioning invalidated contacts. The new contact configurations are chosen to preserve the mechanical properties of the original contacts in order to provide plausible support phases. When it is not possible to find an equivalent contact, a procedural animation is generated and blended with the original motion. Thanks to an optimization scheme, the resulting motions are continuous and preserve the style of the reference motions. The method is fully interactive and enables the motion to be adapted on-line even in case of large changes of the environment. We demonstrate our method on several challenging scenarios, proving its immediate application to 3D animation softwares and video games.

Browse

Browsing 35-Issue 2 by Issue Date

Results Per Page

Sort Options