ACM Trans. Graph.最新文献_第6页

Retrieval on parametric shape collections 参数形状集合的检索

ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126792

Adriana Schulz, Ariel Shamir, Ilya Baran, D. Levin, Pitchaya Sitthi-amorn, W. Matusik

{"title":"Retrieval on parametric shape collections","authors":"Adriana Schulz, Ariel Shamir, Ilya Baran, D. Levin, Pitchaya Sitthi-amorn, W. Matusik","doi":"10.1145/3072959.3126792","DOIUrl":"https://doi.org/10.1145/3072959.3126792","url":null,"abstract":"While collections of parametric shapes are growing in size and use, little progress has been made on the fundamental problem of shape-based matching and retrieval for parametric shapes in a collection. The search space for such collections is both discrete (number of shapes) and continuous (parameter values). In this work, we propose representing this space using descriptors that have shown to be effective for single shape retrieval. While single shapes can be represented as points in a descriptor space, parametric shapes are mapped into larger continuous regions. For smooth descriptors, we can assume that these regions are bounded low-dimensional manifolds where the dimensionality is given by the number of shape parameters. We propose representing these manifolds with a set of primitives, namely, points and bounded tangent spaces. Our algorithm describes how to define these primitives and how to use them to construct a manifold approximation that allows accurate and fast retrieval. We perform an analysis based on curvature, boundary evaluation, and the allowed approximation error to select between primitive types. We show how to compute decision variables with no need for empirical parameter adjustments and discuss theoretical guarantees on retrieval accuracy. We validate our approach with experiments that use different types of descriptors on a collection of shapes from multiple categories.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"24 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82484100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

A compressed representation for ray tracing parametric surfaces 射线追踪参数曲面的压缩表示

ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126820

Kai Selgrad, Alexander Lier, Magdalena Martinek, Christoph Buchenau, M. Guthe, Franziska Kranz, Henry Schäfer, M. Stamminger

{"title":"A compressed representation for ray tracing parametric surfaces","authors":"Kai Selgrad, Alexander Lier, Magdalena Martinek, Christoph Buchenau, M. Guthe, Franziska Kranz, Henry Schäfer, M. Stamminger","doi":"10.1145/3072959.3126820","DOIUrl":"https://doi.org/10.1145/3072959.3126820","url":null,"abstract":"Parametric surfaces are an essential modeling tool in computer aided design and movie production. Even though their use is well established in industry, generating ray-traced images adds significant cost in time and memory consumption. Ray tracing such surfaces is usually accomplished by subdividing the surfaces on the fly, or by conversion to a polygonal representation. However, on-the-fly subdivision is computationally very expensive, whereas polygonal meshes require large amounts of memory. This is a particular problem for parametric surfaces with displacement, where very fine tessellation is required to faithfully represent the shape. Hence, memory restrictions are the major challenge in production rendering. In this article, we present a novel solution to this problem. We propose a compression scheme for a priori Bounding Volume Hierarchies (BVHs) on parametric patches, that reduces the data required for the hierarchy by a factor of up to 48. We further propose an approximate evaluation method that does not require leaf geometry, yielding an overall reduction of memory consumption by a factor of 60 over regular BVHs on indexed face sets and by a factor of 16 over established state-of-the-art compression schemes. Alternatively, our compression can simply be applied to a standard BVH while keeping the leaf geometry, resulting in a compression rate of up to 2:1 over current methods. Although decompression generates additional costs during traversal, we can manage very complex scenes even on the memory restrictive GPU at competitive render times.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"473 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79348965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Interactive sound propagation and rendering for large multi-source scenes 交互式声音传播和渲染大型多源场景

ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126830

Carl Schissler, Dinesh Manocha

引用次数: 11

Momentum-mapped inverted pendulum models for controlling dynamic human motions 动量映射倒立摆模型用于控制动态人体运动

ACM Trans. Graph. Pub Date : 2017-02-13 DOI: 10.1145/3072959.3126851

Tae-Joung Kwon, J. Hodgins

引用次数: 6

Learning to schedule control fragments for physics-based characters using deep Q-learning 学习使用深度Q-learning为基于物理的字符安排控制片段

ACM Trans. Graph. Pub Date : 2017-01-01 DOI: 10.1145/3072959.3126784

Libin Liu, J. Hodgins

引用次数: 6

Real-time geometry, albedo and motion reconstruction using a single RGBD camera 实时几何，反照率和运动重建使用单个RGBD相机

ACM Trans. Graph. Pub Date : 2017-01-01 DOI: 10.1145/3072959.3126786

Kaiwen Guo, F. Xu, Tao Yu, Xiaoyang Liu, Qionghai Dai, Yebin Liu

{"title":"Real-time geometry, albedo and motion reconstruction using a single RGBD camera","authors":"Kaiwen Guo, F. Xu, Tao Yu, Xiaoyang Liu, Qionghai Dai, Yebin Liu","doi":"10.1145/3072959.3126786","DOIUrl":"https://doi.org/10.1145/3072959.3126786","url":null,"abstract":"This paper proposes a real-time method that uses a single-view RGBD input to simultaneously reconstruct a casual scene with a detailed geometry model, surface albedo, per-frame non-rigid motion and per-frame low-frequency lighting, without requiring any template or motion priors. The key observation is that accurate scene motion can be used to integrate temporal information to recover the precise appearance, whereas the intrinsic appearance can help to establish true correspondence in the temporal domain to recover motion. Based on this observation, we rst propose a shading-based scheme to leverage appearance information for motion estimation. Then, using the reconstructed motion, a volumetric albedo fusing scheme is proposed to complete and re ne the intrinsic appearance of the scene by incorporating information from multiple frames. Since the two schemes are iteratively applied during recording, the reconstructed appearance and motion become increasingly more accurate. In addition to the reconstruction results, our experiments also show that additional applications can be achieved, such as relighting, albedo editing and free-viewpoint rendering of a dynamic scene, since geometry, appearance and motion are all reconstructed by our technique.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"387 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91509987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 55

Jump: virtual reality video 跳跃:虚拟现实视频

ACM Trans. Graph. Pub Date : 2016-11-11 DOI: 10.1145/2980179.2980257

Robert Anderson, D. Gallup, J. Barron, Janne Kontkanen, Noah Snavely, Carlos Hernández, Sameer Agarwal, S. Seitz

引用次数: 228

Perform: perceptual approach for adding OCEAN personality to human motion using laban movement analysis 表演:用拉班动作分析将OCEAN个性添加到人体动作中的感知方法

ACM Trans. Graph. Pub Date : 2016-10-01 DOI: 10.1145/3072959.3126789

Funda Durupinar, M. Kapadia, Susan Deutsch, Michael Neff, N. Badler

{"title":"Perform: perceptual approach for adding OCEAN personality to human motion using laban movement analysis","authors":"Funda Durupinar, M. Kapadia, Susan Deutsch, Michael Neff, N. Badler","doi":"10.1145/3072959.3126789","DOIUrl":"https://doi.org/10.1145/3072959.3126789","url":null,"abstract":"A major goal of research on virtual humans is the animation of expressive characters that display distinct psychological attributes. Body motion is an effective way of portraying different personalities and differentiating characters. The purpose and contribution of this work is to describe a formal, broadly applicable, procedural, and empirically grounded association between personality and body motion and apply this association to modify a given virtual human body animation that can be represented by these formal concepts. Because the body movement of virtual characters may involve different choices of parameter sets depending on the context, situation, or application, formulating a link from personality to body motion requires an intermediate step to assist generalization. For this intermediate step, we refer to Laban Movement Analysis, which is a movement analysis technique for systematically describing and evaluating human motion. We have developed an expressive human motion generation system with the help of movement experts and conducted a user study to explore how the psychologically validated OCEAN personality factors were perceived in motions with various Laban parameters. We have then applied our findings to procedurally animate expressive characters with personality, and validated the generalizability of our approach across different models and animations via another perception study.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88626190","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 50

Nonuniform spatial deformation of light fields by locally linear transformations 局部线性变换的光场非均匀空间变形

ACM Trans. Graph. Pub Date : 2016-09-22 DOI: 10.1145/3072959.3126846

C. Birklbauer, D. Schedl, O. Bimber

引用次数: 5

Interactive high-quality green-screen keying via color unmixing 交互式高品质的绿屏键控通过颜色解混

ACM Trans. Graph. Pub Date : 2016-09-22 DOI: 10.1145/3072959.3126799

Yagiz Aksoy, T. Aydin, M. Pollefeys, A. Smolic

{"title":"Interactive high-quality green-screen keying via color unmixing","authors":"Yagiz Aksoy, T. Aydin, M. Pollefeys, A. Smolic","doi":"10.1145/3072959.3126799","DOIUrl":"https://doi.org/10.1145/3072959.3126799","url":null,"abstract":"Due to the widespread use of compositing in contemporary feature films, green-screen keying has become an essential part of postproduction workflows. To comply with the ever-increasing quality requirements of the industry, specialized compositing artists spend countless hours using multiple commercial software tools, while eventually having to resort to manual painting because of the many shortcomings of these tools. Due to the sheer amount of manual labor involved in the process, new green-screen keying approaches that produce better keying results with less user interaction are welcome additions to the compositing artist’s arsenal. We found that—contrary to the common belief in the research community—production-quality green-screen keying is still an unresolved problem with its unique challenges. In this article, we propose a novel green-screen keying method utilizing a new energy minimization-based color unmixing algorithm. We present comprehensive comparisons with commercial software packages and relevant methods in literature, which show that the quality of our results is superior to any other currently available green-screen keying solution. It is important to note that, using the proposed method, these high-quality results can be generated using only one-tenth of the manual editing time that a professional compositing artist requires to process the same content having all previous state-of-the-art tools at one’s disposal.","PeriodicalId":7121,"journal":{"name":"ACM Trans. Graph.","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84356865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 30