PG2014short

Permanent URI for this collection

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

Browse

Now showing 1 - 20 of 26

Album Quickview in Comic-like Layout via Quartet Analysis
(The Eurographics Association, 2014) Zheng, Zhibin; Zhang, Yan; Miao, Zheng; Sun, Zhengxing; John Keyser and Young J. Kim and Peter Wonka
For clear summary and efficient search of images for album, which carries a story of life record, we propose a new approach for quickview of album in comic-like layout via quartet analysis. How to organize the images in album and in what way to display images in collage are two key problems for album quickview. For the first problem, we take the idea of model organization method based on quartet analysis to construct categorization tree to organize the images; while for the second problem, we utilize the topological structure of categorization tree to decompose it into multiple groups of images and extract representative image from each group for subsequent collage. For the collage part, we choose comic-like layout to present collage because comic provides a concise way for storytelling and it has variablitiy in layout styles, which is suitable for album summary. Experiments demonstrate that our method could organize the images effectively and present images in collage with diverse styles as well.
Automatic 3D Posing from 2D Hand-Drawn Sketches
(The Eurographics Association, 2014) Gouvatsos, Alexandros; Xiao, Zhidong; Marsden, Neil; Zhang, Jian J.; John Keyser and Young J. Kim and Peter Wonka
Inferring the 3D pose of a character from a drawing is a non-trivial and under-constrained problem. Solving it may help automate various parts of an animation production pipeline such as pre-visualisation. In this paper, a novel way of inferring the 3D pose from a monocular 2D sketch is proposed. The proposed method does not make any external assumptions about the model, allowing it to be used on different types of characters. The 3D pose inference is formulated as an optimisation problem and a parallel variation of the Particle Swarm Optimisation algorithm called PARAC-LOAPSO is utilised for searching the minimum. Testing in isolation as well as part of a larger scene, the presented method is evaluated by posing a lamp and a horse character. The results show that this method is robust and is able to be extended to various types of models.
Automatic Aesthetics-based Lighting Design with Global Illumination
(The Eurographics Association, 2014) Léon, Vincent; Gruson, Adrien; Cozot, Rémi; Bouatouch, Kadi; John Keyser and Young J. Kim and Peter Wonka
In computer graphics, lighting plays an important role in the appearance of a scene. A change in the configuration of light sources can lead to different aesthetics in the final rendered image. Lighting design becomes increasingly complex when using sophisticated global illumination techniques. In this paper, we present a new approach to automatically design the lighting configuration according to the aesthetic goal specified by the user as a set of target parameters. Target parameters are used to set up an objective function which is minimized using an optimization method. The results show that our method can be used to automatically design a lighting configuration that will give to the final image a classic photographic look.
Automatic Garment Modeling From Front And Back Images
(The Eurographics Association, 2014) Huang, Lifeng; Gao, Chengying; John Keyser and Young J. Kim and Peter Wonka
We present a system which can automatically generate a realistic garment model from two images of an existing garment. Without the requirement of tailoring expertise and tedious operation, our method takes the front and back images of a real garment as input, and the system will make reasonable geometric modeling as well as physical simulation of the garment. Combining with mannequin's skeleton information, we propose a panel positioning method to place garment panels in appropriate positions. A key feature of our system is to automatically interpret sewn information, which effectively simplifies user interaction. In addition, panel deformation method based on mannequin's pose allows easy data capture. It extends the flexibility and utility of our method. The experiments demonstrate the effectiveness on generating models of various garment styles.
Data-Driven Fire Synthesis and Design
(The Eurographics Association, 2014) Wong, Sai-Keung; Chang, Tse-Ching; Ho, Tan-Chi; Chuang, Jung-Hong; John Keyser and Young J. Kim and Peter Wonka
We present a data-driven synthesis approach to design and animate fires in desired shapes and motions. At the preprocessing stage, our system simulates a set of basis fires under specific simulation configurations and stores these basis fires as pathlines in a database. At the design stage, a user sketches a sequence of curves to design the desired shapes of target fires. Then, we compute a subset of basis fires to fit the curves. After that the target fires are synthesized by combining the basis fires. As our method generates target fires along the user sketched curves, our approach enables users to design the fire shapes in an intuitive manner. Experimental results show that our approach can synthesize fires in desired shapes and motions.
Example-based Haze Removal with two-layer Gaussian Process Regressions
(The Eurographics Association, 2014) Fan, Xin; Gao, Renjie; Wang, Yi; John Keyser and Young J. Kim and Peter Wonka
Hazy images suffer from low visibility and contrast. Researchers have devoted great efforts to haze removal with the prior assumptions on observations in the past decade. However, these priors from observations can provide limited information for the restoration of high quality, and the assumptions are not always true for generic images in practice. On the other hand, visual data are increasing as the popularity of imaging devices. In this paper, we present a learning framework for haze removal based on two-layer Gaussian Process Regressions (GPR). By using training examples, the two-layer GPRs establish direct relationships from the input image to the depth-dependent transmission, and meanwhile learn local image priors to further improve the estimation. We also provide a method to collect training pairs for images of natural scenes. Both qualitative and quantitative comparisons on simulated and real-world hazy images demonstrate the effectiveness of the approach, especially when white or bright objects and heavy haze regions appear and existing dehazing methods may fail.
Extraction and Transfer of Facial Expression Wrinkles for Facial Performance Enhancement
(The Eurographics Association, 2014) Shin, Il-Kyu; Öztireli, A. Cengiz; Kim, Hyeon-Joong; Beeler, Thabo; Gross, Markus; Choi, Soo-Mi; John Keyser and Young J. Kim and Peter Wonka
Creating realistic models and animations of human faces with adequate level of detail is very challenging due to the high complexity of facial deformations and the sensitivity of the human visual system to human faces. One way to overcome this challenge is using face scans captured from real facial performances. However, capturing the required level of detail is only possible with high-end systems in controlled environments. Hence, a large body of work is devoted to enhancing already captured or modeled low resolution faces with details extracted from high fidelity facial scans. Details due to expression wrinkles are of particular importance for realistic facial animations. In this paper, we propose a new method to extract and transfer expression wrinkles from a high resolution example face model to a target model for enhancing the realism of facial animations. We define multi-scale maps that capture the essential details due to expression wrinkles on given example face models, and use these maps to transfer the details to a target face. The maps are interpolated in time to generate enhanced facial animations. We carefully design the detail maps such that transfer and interpolation can be performed very efficiently using linear methods.
Finding Feature Similarities Between Geometric Trees
(The Eurographics Association, 2014) Mukherjee, Uddipan; Gopi, Meenakshisundaram; John Keyser and Young J. Kim and Peter Wonka
Geometric trees are graphs with no cycles in which the nodes have spatial co-ordinates and the edges are geometric curves. Many physical systems can be represented effectively using geometric trees, e.g. river beds, animal neurons, respiratory tracks of mammals etc. As these systems undergo structural metamorphosis, temporally or under the effect of some external stimulus, the underlying tree structures also change. Given two snapshots of structurally morphed trees, an algorithm for comparing them based on geometric and topological tree features is presented. Such comparison provides a wealth of information for interpreting the metamorphosis.
Geometry-Aware Image Completion via Multiple Examples
(The Eurographics Association, 2014) Wang, Guihang; Chen, Xuejin; Hu, Siyu; John Keyser and Young J. Kim and Peter Wonka
When browsing through photographs taken during a trip, it can be a distressing discovery to find many other bystanders captured within the frame. A visually compelling snapshot preserves the desired subject in the foreground, and eliminates irrelevant persons or objects. In this paper, we present a new image completion algorithm that retains the geometric consistency of the scene using Internet photo collections. Our key insight allows us to successfully fill the missing regions with content derived from related images with distinct features, or from visible parts of the input image with repetitive textures. The final composition for the missing regions is guided by a confidence map combining the two types of example images. We validate our algorithm on a variety of scenes which are challenging for state-of-the-art completion techniques. The completion results successfully preserve the geometry consistency for complex structures in a wide range of depths.
Image Palette: Brushstroke Synthesis-based Style Transfer
(The Eurographics Association, 2014) Miao, Zheng; Zhang, Yan; Zheng, Zhibin; Sun, Zhengxing; John Keyser and Young J. Kim and Peter Wonka
Painting style transfer is one kind technology where given the sample images with some specific art style, we can render the target images in the same style as the samples after some computation. In this paper we present a new approach of painting style transfer in which such a style transfer work is done by analogy with simulating the process of creation. We take the sample as palette where users can select arbitrary outlines or textures as the current input mode brush strokes. We then analyze brush strokes' style feature information and use such information for the style transfer and synthesis along the stroke curves learned from the specified area in target images to get the same painting style as the samples. The results show that the users can get a style-transferred personalized target image just by the given sample images and least interactions.
Incorporating Fiber Controls into FEM Model for Transversely Isotropic Materials
(The Eurographics Association, 2014) Jianping, Cai; Feng, Lin; Tsui, Lee Yong; Kemao, Qian; Soon, Seah Hock; John Keyser and Young J. Kim and Peter Wonka
Physically plausible deformable models based on continuum mechanics have been a hot topic in computer graphics for decades, and many models have been proposed to improve performance speed and stability. However, most of the existing models focus on isotropic materials, while elastic objects with complex anisotropic properties are less studied. Based on the observation that a large group of objects have specific internal structures (fibers) that determine their anisotropic behavior, we propose a fiber incorporated corotational FEM model that can approximate longitudinally anisotropic deformation. First, a fiber orientation field is used to establish local frames for each element; then, the orientation information is combined into the FEM model by adding local transformations on element stiffness matrices. This proposed model can provide a control for directable deformations, and yields realistic anisotropic deformations. Large deformations can be accommodated; meanwhile, with pre-computation it adds no computational cost to the existing corotational FEM model during simulation. Convincing experimental results and analytical comparisons are presented, together with an accompanying video demonstration.
Integrating Occlusion Culling into LOD on GPU
(The Eurographics Association, 2014) Peng, Chao; John Keyser and Young J. Kim and Peter Wonka
Real-time rendering of complex 3D models is still a very challenging task. Recently, GPU-based level-of-detail (LOD) approaches have been proposed to fast decrease the complexity of a 3D model, but applying only LOD approaches is usually not sufficient to achieve highly interactive rendering rate for the complex model that contains hundreds of millions of triangles. Visibility culling, especially occlusion culling, needs to be introduced to further reduce the amount of triangles being rendered at each frame. In this paper, we present a novel rendering approach that seamlessly integrates occlusion culling with the LOD approach in a unified scheme towards the GPU architecture. The result shows that the integration significantly reduces the complexity of the 3D model and satisfies the demands of both memory efficiency and performance.
Parallel BTF Compression with Multi-Level Vector Quantization in OpenCL
(The Eurographics Association, 2014) Egert, Petr; Vlastimil, Havran; John Keyser and Young J. Kim and Peter Wonka
Bidirectional Texture Function (BTF) as an effective visual fidelity representation of surface appearance is becoming more and more widely used. In this paper we report on contributions to BTF data compression for multi-level vector quantization. We describe novel decompositions that improve the compression ratio by 15% in comparison with the original method, without loss of visual quality. Further, we show how for offline storage the compression ratio can be increased by 33% in total by Huffman coding. We also show that efficient parallelization of the vector quantization algorithm in OpenCL can reduce the compression time by factor of 9 on a GPU. The results for the new compression algorithm are shown on six low dynamic range BTFs and four high dynamic range publicly available BTF samples. Our method allows for real time synthesis on a GPU.
PatchMove: Patch-based Fast Image Interpolation with Greedy Bidirectional Correspondence
(The Eurographics Association, 2014) Saito, Shunsuke; Sakamoto, Ryuuki; Morishima, Shigeo; John Keyser and Young J. Kim and Peter Wonka
In this paper, we present a method for the plausible interpolation of images. This method has several applications, such as for smooth view interpolation, low frame-rate video upsampling, and animation. The central idea is to quickly form dense correspondences using a patch-based nearest-neighbor search method called PatchMatch. However, the conventional PatchMatch method does not always find an accurate correspondence. This means that some patches do not find appropriate counterparts. Our method employs a greedy algorithm and an occlusion handling technique to correct inaccurate correspondences. Furthermore, our texture reconstruction method successfully reduces blurring effects. We demonstrate that our method significantly reduces the computation time required for interpolation, and show that the quality of reconstructed images is almost identical to that of those generated using state-of-the-art methods.
Perceptually Optimised Illumination for Seamless Composites
(The Eurographics Association, 2014) Chalmers, Andrew; Choi, Jong Jin; Rhee, Taehyun; John Keyser and Young J. Kim and Peter Wonka
Realistic illumination in composition is important for a seamless mixture between the virtual and real world objects in visual effects and mixed reality. The seamlessness is the measure of how perceivably apparent the synthetic object in the final composition is, and how indistinguishable it is from the photographed scene. Given that the ultimate receiver of image information is the human eye, the metric is determined by the Human Visual System (HVS). We conducted a series of psychophysical studies to observe and capture the thresholds of the HVS's ability to perceive illumination inconsistencies between the rendered subject and the photographed scene. Based on our observations, we find perceptually optimised thresholds for reducing resources across resolution and dynamic range of the radiance map (RM) for image based lighting (IBL). We evaluated our thresholds to illuminate virtual objects for seamless composition with photographed scenes.
Projecting Points onto Planar Parametric Curves by Local Biarc Approximation
(The Eurographics Association, 2014) Song, Hai-Chuan; Shi, Kan-Le; Yong, Jun-Hai; Zhang, Sen; John Keyser and Young J. Kim and Peter Wonka
This paper proposes a geometric iteration algorithm for computing point projection and inversion on surfaces based on local biarc approximation. The iteration begins with initial estimation of the projection of the prescribed test point. For each iteration, we construct a 3D biarc on the original surface to locally approximate the original surface starting from the current projection point. Then we compute the projection point for the next iteration, as well as the parameter corresponding to it, by projecting the test point onto this biarc. The iterative process terminates when the projection point satisfies the required precision. Examples demonstrate that our algorithm converges faster and is less dependent on the choice of the initial value compared to the traditional geometric iteration algorithms based on single-point approximation.
Quantitative Analysis of Voxel Raytracing Acceleration Structures
(The Eurographics Association, 2014) Chajdas, Matthäus G.; Westermann, Rüdiger; John Keyser and Young J. Kim and Peter Wonka
In this work, we provide a comprehensive analysis of GPU acceleration structures for voxel raytracing. We compare the commonly used octrees to BVH and KD trees, which are the standard in GPU triangle raytracing. Evaluating and analyzing of the behavior is complicated, as modern GPUs provide wide vector units with complex cache hierarchies. Even with sophisticated SIMD simulators, it is increasingly hard to model the hardware with sufficient detail to explain the observed performance. Therefore, instead of relying on SIMD simulation, we use hardware counters to directly measure key metrics like execution coherency on a modern GPU. We provide an extensive analysis comparing different acceleration structures for different raytracing scenarios like primary, diffuse and ambient occlusion rays. For different scenes we show that data structures commonly known for good performance, like KD-trees, are actually not suited for very wide SIMD units. In our work we show that BVH trees are most suitable for GPU raytracing and explain how the acceleration structure affects the execution coherency and ultimately performance, providing crucial information for the future design of GPU acceleration structures.
Random Sparse Coded Aperture for Lensless Imaging
(The Eurographics Association, 2014) Wang, Zhenglin; Lee, Ivan; John Keyser and Young J. Kim and Peter Wonka
This paper develops a computational lensless imaging system based on a random sparse coded aperture. The camera consists of a thin mask with a coded pattern and a standard sensor array. The proposed coded aperture contains multiple square pinholes, and forms a superposition of multiple pinhole images. In order to reduce the artefact due to diffraction or interference and simultaneously to facilitate the fabrication, the pinholes are designed bigger than some other proposed ones, and sparsely spread on the mask. Only the diffraction pattern for one pinhole imaging model needs be taken into account to improve the angular resolution. An arising issue is that the resulting optical transfer function (OTF) involves many zero-value spectrums, which adversely affects the reconstruction quality with conventional image decoding techniques. We introduce a reselection scheme, which selects partial Fourier samples to reduce the impact of zero entries in OTF. Then, the total variation minimization with quadratic constraints algorithm is applied to attain a good quality reconstruction
Real-time Collision Detection with Two-level Spatial Hashing on GPU
(The Eurographics Association, 2014) Hong, Yang; Wu, Wen; Chen, Hui; John Keyser and Young J. Kim and Peter Wonka
In this paper, a two-level parallel spatial hashing method is presented for real-time collision detection of deformable objects based on modern GPU architecture. The second-level of spatial hashing is used to improve the culling efficiency. Moreover, a novel encoding method on GPU is proposed to compensate the inflexibility of the GPU memory system. It can efficiently determine the colliding pairs of primitives between deformable objects. The experimental results show that our method can perform high culling efficiency with low memory cost.
Saliency-driven Depth Compression for 3D Image Warping
(The Eurographics Association, 2014) Gu, Minjie; Hu, Shanfeng; Wang, Xiaochuan; Liang, Xiaohui; Shen, Xukun; Qin, Aihong; John Keyser and Young J. Kim and Peter Wonka
Current compression methods compress depth images by incorporating 2D features, which leads to a loss of the detail of the original 3D object in the recovered depth image. The main idea of this paper is to augment 2D features with 3D geometric information to preserve important regions of the depth image. Mesh saliency is used to represent the important regions of the 3D objects, and discontinuity edges are extracted to indicate the important regions of the depth image. We use mesh saliency to guide the adaptive random sampling to generate a random pixel sample of the depth image and then, combine this sample with the depth discontinuity edge to build the sparse depth representation. During the depth reconstruction, the depth image is recovered by using an up- and down-sampling schema with Gaussian bilateral filtering. The effectiveness of the proposed method is validated through 3D image warping applications. The visual and quantitative results show a significant improvement of the synthetic image quality compared with state-of-the-art depth compression methods.

Browse

Browsing PG2014short by Title

Results Per Page

Sort Options