Guided Policy Search Sergey Levine svlevine@stanford.edu Vladlen Koltun vladlen@stanford.edu Computer Science Department, Stanford University, Stanford, CA 94305 USA Abstract Direct policy search can effectively scale to high-dimensional systems, but complex policies with hundreds of parameters often present a challenge for such methods, requir- ing numerous samples and often falling into poor loc
Abstract: Image processing algorithms implemented using custom hardware or FPGAs of can be orders-of-magnitude more energy efficient and performant than software. Unfortunately, converting an algorithm by hand to a hardware description language suitable for compilation on these platforms is frequently too time consuming to be practical. Recent work on hardware synthesis of high-level image process
Bounce Maps: An Improved Restitution Model for Real-Time Rigid-Body Impact ACM SIGGRAPH 2017 We present a novel method to enrich standard rigid-body impact models with a spatially varying coefficient of restitution map, or Bounce Map. Even state-of-the art methods in computer graphics assume that for a single rigid body, post- and pre-impact dynamics are related with a single global, constant, nam
1Stanford University 2Max Planck Institute for Informatics 3Microsoft Research Abstract Real-time, high-quality, 3D scanning of large-scale scenes is key to mixed reality and robotic applications. However, scalability brings challenges of drift in pose estimation, introducing significant errors in the accumulated model. Approaches often require hours of offline processing to globally correct model
Computer Science Department, Stanford University, Stanford, CA 94305 USA Abstract Direct policy search can effectively scale to high-dimensional systems, but complex policies with hundreds of parameters often present a challenge for such methods, requiring numerous samples and often falling into poor local optima. We present a guided policy search algorithm that uses trajectory optimization to dir
Matthias Nießner THIS PAGE IS NO LONGER MAINTAINED! You will be automatically forwarded to www.niessnerlab.org Abstract Computational photography systems are becoming increasingly diverse while computational resources, for example on mobile platforms, are rapidly increasing. As diverse as these camera systems may be, slightly different variants of the underlying image processing tasks, such as dem
stanford hci group / 2007 Design Tools for Design Tools for Variations and Alternatives Björn Hartmann (bjoern@cs stanford edu) Björn Hartmann (bjoern@cs.stanford.edu) http://hci.stanford.edu stanford · 1 August 2007 “The best way to have a good idea is to have lots of ideas ” lots of ideas. -Linus Pauling 2 Prototypes for the Mi f 3 Microsoft mouse From Moggridge, Designing Interactions, Ch2 “ a
Marc Levoy List of publications This web page contains links to all my papers back to 1990, and selected ones beyond that. The list is sorted by topic, and then in reverse chronological order within each topic. A complete list may be found in my CV. For some of the older papers, PDFs have been created from optical scans of the original publications. The entries for some papers include links to sof
By Sean Eron Anderson seander@cs.stanford.edu Individually, the code snippets here are in the public domain (unless otherwise noted) — feel free to use them however you please. The aggregate collection and descriptions are © 1997-2005 Sean Eron Anderson. The code and descriptions are distributed in the hope that they will be useful, but WITHOUT ANY WARRANTY and without even the implied warranty of
Fast High-Dimensional Filtering Using the Permutohedral Lattice Eurographics 2010 Runner up for Best Paper We describe a method of quickly evaluating the type of Gauss transform used in bilateral filters, joint bilateral filters, non-local means, and related tasks. Other recent fast methods for doing this include the Bilateral Grid, and the Gaussian KD-Tree. The diagram above shows, for a wide ran
Below are a set of tools for manipulating PLY files. Here are some quick links to the descriptions of these tools: ply2asc usage: ply2asc [flags] [infile] > outfile or: ply2asc [flags] < infile > outfile -p (print element labels) ply2bboxcube Usage: ply2bboxcube in1.ply [in2.ply] ... And it will generate files called in1.bboxcube.ply, in2.bboxcube.ply, etc..... Which contain all 12 faces of the bo
CS 178 - Digital Photography Spring Quarter, 2010 Marc Levoy, Andrew Adams, Katie Dektar, and Nora Willett These applets are designed to supplement the course lecture material in CS 178. They will typically be demonstrated live in class, then added to this web page. At that time they will also be linked into the course schedule and the course home page. The applets were designed by Marc Levoy and
1 Technical University of Munich 2 Max Planck Institute for Informatics 3 University of Erlangen-Nuremberg Abstract We present a method for the real-time transfer of facial expressions from an actor in a source video to an actor in a target video, thus enabling the ad-hoc control of the facial expressions of the target actor. The novelty of our approach lies in the transfer and photo-realistic re-
Image Credits: Molten Glass : Kyle Fisher; Summertime Iridescence : Jennifer Tao and Cynthia Jia; Cotton Candy : Chenlin Meng, Hubert Teo, and Jiren Zhu. Click here to see more winning entries from previous rendering competitions. This course provides a broad overview of the theory and practice of making photo-realistic imagery. Rendering is treated as a problem in modeling and simulating the phys
ACM SIGGRAPH 2012 and ACM Transactions on Graphics 31 (4), Article 28 Abstract Interactive, task-guided character controllers must be agile and responsive to user input, while retaining the flexibility to be read- ily authored and modified by the designer. Central to a method's ease of use is its capacity to synthesize character motion for novel situations without requiring excessive data or progr
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く