Search

Aaron E Lefohn

from Kirkland, WA
Age ~50
Get Report
Also known as:
Aaron Eliot Lefohn, Aaron K Lefohn
Phone and address:
12912 76Th Ave NE, Kirkland, WA 98034
(425) 825-3961
Related to:
Arlene Dawson, 63Christine L Gamache, 71Liam S LefohnDenis R Gamache, 71Joanne Y Turner, 42Allen S Lefohn, 80Phyllis E Lefohn, 78Kevin A Lefohn, 52Eileen M Gamache, 45Karen L Lefohn, 46
Connected to:
Carter C Lefon, 77Cheryl E Lefon, 64James T Lefor, 38John Lefor, 32Kathy L Lefor, 74Monique Leforbes, 38Catherine E Leforce, 32Sarah R Leforce, 47Allen Lefort, 30Ashley A Lefort, 32

Aaron Lefohn Phones & Addresses

  • 12912 76Th Ave NE, Kirkland, WA 98034 (425) 825-3961
  • 3762 Sundale Rd, Lafayette, CA 94549 (925) 962-9782
  • Seattle, WA
  • 8240 142Nd St, Bothell, WA 98011 (425) 825-3961
  • 1815 Fremont Ct, Davis, CA 95616 (530) 758-1327
  • Kiona, WA
  • Oakland, CA
  • Salt Lake City, UT
  • 12912 76Th Ave NE, Kirkland, WA 98034

Work

Company: Nvidia May 2013 Position: Senior director of graphics research

Education

Degree: Doctorates, Doctor of Philosophy School / High School: University of California, Davis 2003 to 2006 Specialities: Computer Science

Skills

3D Rendering • Computer Graphics • Parallel Programming • Gpu • Parallel Computing • Computer Science • Scientific Computing • Image Processing • Gpgpu • Algorithms

Awards

Papers co-chair, high performance graphi...

Emails

a***[email protected]

Industries

Computer Software

Resumes

Resumes

Aaron Lefohn Photo 1

Senior Director Of Graphics Research

View page
Location:
Seattle, WA
Industry:
Computer Software
Work:
Nvidia
Senior Director of Graphics Research
Intel Corporation Nov 2010 - Apr 2013
Principal Engineer
Intel Corporation Oct 2007 - Nov 2010
Senior Graphics Architect
Neoptica May 2006 - Oct 2007
Principal Engineer
Uc Davis Sep 2003 - Mar 2006
Research Assistant
Education:
University of California, Davis 2003 - 2006
Doctorates, Doctor of Philosophy, Computer Science University of Utah 2001 - 2003
Master of Science, Masters, Computer Science University of Utah 1998 - 2001
Master of Science, Masters, Chemistry Whitman College 1992 - 1997
Bachelors, Bachelor of Arts, Chemistry
Skills:
3D Rendering
Computer Graphics
Parallel Programming
Gpu
Parallel Computing
Computer Science
Scientific Computing
Image Processing
Gpgpu
Algorithms
Awards:
Papers Co-Chair, High Performance Graphics Conference, 2011

Publications

Us Patents

Fast Multi-Pass Partitioning Via Priority Based Scheduling

View page
US Patent:
20060038811, Feb 23, 2006
Filed:
Jul 15, 2005
Appl. No.:
11/182632
Inventors:
John Owens - Berkeley CA, US
Andy Riffel - Davis CA, US
Aaron Lefohn - Oakland CA, US
Mark Leone - Walnut Creek CA, US
Kiril Vidimce - San Francisco CA, US
International Classification:
G06T 1/00
G06F 17/00
US Classification:
345418000
Abstract:
The described embodiments of the present invention include a method and system for partitioning and partitioning operations. The operations are first prioritized, then partitioned into one or more partitions.

Automatic Placement Of Shadow Map Partitions

View page
US Patent:
20110050693, Mar 3, 2011
Filed:
Aug 31, 2009
Appl. No.:
12/550726
Inventors:
Andrew T. Lauritzen - Victoria, CA
Aaron Lefohn - Bothell WA, US
Marco Salvi - San Francisco CA, US
International Classification:
G06T 15/50
US Classification:
345426
Abstract:
Shadow map partitions may be automatically placed based on the location or concentration of sample data depth in eye space. An initial positioning for the partitions may be determined based on user specified budgets for number of partitions, computation time, or memory utilization, in some embodiments. The initial positioning may be refined using a clustering algorithm in some cases.

Shadowing Dynamic Volumetric Media

View page
US Patent:
20120182300, Jul 19, 2012
Filed:
Jan 18, 2011
Appl. No.:
13/008437
Inventors:
Marco Salvi - San Francisco CA, US
Aaron Lefohn - Bothell WA, US
Andrew T. Lauritzen - Victoria, CA
Kiril Vidimce - Saint Pete Beach FL, US
International Classification:
G06T 15/60
US Classification:
345426
Abstract:
A dynamic volumetric medium, such as hair, fog, or smoke, may be represented, for purposes of shadow mapping, by transmittance versus depth data for that medium. In one embodiment, the representation may take the form of a plot of transmittance versus depth, with nodes where the transmittance changes non-live linearly with respect of depth into the medium. The number of nodes in the representation may be reduced to reduce memory footprint and to enable the storage of the representation on the same chip doing the shadow mapping. In some embodiments, the number of nodes may be reduced, one node at a time, by removing the node whose underlying trapezoid has the least area of all the remaining nodes.

Rendering Transparent Primitives

View page
US Patent:
20120299951, Nov 29, 2012
Filed:
May 27, 2011
Appl. No.:
13/117698
Inventors:
Marco Salvi - San Francisco CA, US
Jefferson D. Montgomery - Victoria, CA
Aaron Lefohn - Bothell WA, US
International Classification:
G06T 11/00
US Classification:
345592
Abstract:
Representing a transparent object as a summation of substantially zero step functions of a visibility curve for the object. An array may be used to store nodes to represent the visibility function. The size of the array may be limited to be storable within a memory of an on-chip graphics processing unit.

Graphics Tiling Architecture With Bounding Volume Hierarchies

View page
US Patent:
20130187947, Jul 25, 2013
Filed:
Jan 20, 2012
Appl. No.:
13/354712
Inventors:
Rasmus Barringer - Helsingborg, SE
Carl Johan Gribel - Lund, SE
Aaron Lefohn - Kirkland WA, US
Tomas G. Akenine-Möller - Lund, SE
International Classification:
G09G 5/00
US Classification:
345629
Abstract:
In some embodiments, tile lists may be avoided by storing the geometry of a scene in a bounding volume hierarchy (BVH). For each tile, the bounding volume hierarchy is traversed. The traversals continued only into children nodes that overlap with the frustum on the tile. By relaxing the ordering constraint of rendering primitives, the BVH is traversed such that nodes that are closer to the viewer are traversed first, increasing the occlusion culling efficiency in some embodiments. Rendering the full scene between the central processing cores and the graphics processor may be done through a shared memory in some embodiments.

Low Power Centroid Determination And Texture Footprint Optimization For Decoupled Sampling Based Rendering Pipelines

View page
US Patent:
20130257885, Oct 3, 2013
Filed:
Aug 21, 2012
Appl. No.:
13/590490
Inventors:
Karthik Vaidyanathan - Berkeley CA, US
Marco Salvi - San Francisco CA, US
Robert M. Toth - Lund, SE
Aaron Lefohn - Kirkland WA, US
International Classification:
G06T 11/40
US Classification:
345582, 345589
Abstract:
The problem of generating high quality images with a rendering pipeline based on decoupled sampling may be addressed by generating non-extrapolated shading locations and by determining improved texture filtering footprints. This may be accomplished by performing shading at the center of a bounding box that bounds mapped shading samples.

Reservoir-Based Spatiotemporal Importance Resampling Utilizing A Global Illumination Data Structure

View page
US Patent:
20220198746, Jun 23, 2022
Filed:
Mar 11, 2022
Appl. No.:
17/693162
Inventors:
- Santa Clara CA, US
Morgan McGuire - Williamstown MA, US
Peter Schuyler Shirley - Salt Lake City UT, US
Aaron Eliot Lefohn - Kirkland WA, US
International Classification:
G06T 15/50
G06T 15/06
Abstract:
A global illumination data structure (e.g., a data structure created to store global illumination information for geometry within a scene to be rendered) is computed for the scene. Additionally, reservoir-based spatiotemporal importance resampling (RESTIR) is used to perform illumination gathering, utilizing the global illumination data structure. The illumination gathering includes identifying light values for points within the scene, where one or more points are selected within the scene based on the light values in order to perform ray tracing during the rendering of the scene.

Neural Network System With Temporal Feedback For Denoising Of Rendered Sequences

View page
US Patent:
20230014245, Jan 19, 2023
Filed:
Sep 8, 2022
Appl. No.:
17/930668
Inventors:
- Santa Clara CA, US
Jon Niklas Theodor Hasselgren - Bunkeflostrand, SE
Anjul Patney - Kirkland WA, US
Marco Salvi - Kirkland WA, US
Aaron Eliot Lefohn - Kirkland WA, US
Donald Lee Brittain - Pasadena CA, US
International Classification:
G06T 5/00
G06T 7/246
G06T 7/50
Abstract:
A neural network-based rendering technique increases temporal stability and image fidelity of low sample count path tracing by optimizing a distribution of samples for rendering each image in a sequence. A sample predictor neural network learns spatio-temporal sampling strategies such as placing more samples in dis-occluded regions and tracking specular highlights. Temporal feedback enables a denoiser neural network to boost the effective input sample count and increases temporal stability. The initial uniform sampling step typically present in adaptive sampling algorithms is not needed. The sample predictor and denoiser operate at interactive rates to achieve significantly improved image quality and temporal stability compared with conventional adaptive sampling techniques.
Control profile
Aaron E Lefohn from Kirkland, WA, age ~50 Get Report