Patents by Inventor Aaron Lefohn
Aaron Lefohn has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20220108421Abstract: Apparatuses, systems, and techniques are presented to generate images. In at least one embodiment, at least a first optical flow network (OFN) and at least a first reconstruction network (RN) can be used to generate one or more images based, at least in part, upon the OFN and the RN using a shared loss function.Type: ApplicationFiled: October 1, 2020Publication date: April 7, 2022Inventors: Brennan Shacklett, Marco Salvi, Aaron Lefohn
-
Patent number: 9779696Abstract: Methods and systems may provide for identifying a plurality of subject commands that reference a common screen location and access a read/write resource, and serializing the plurality of subject commands according to a predefined order. Additionally, execution of the plurality of subject commands may be deferred until one or more additional commands referencing the common screen location are executed. In one example, the plurality of subject commands are serialized in response to a serialization command.Type: GrantFiled: December 11, 2013Date of Patent: October 3, 2017Assignee: Intel CorporationInventors: Tomasz Janczak, Aaron Lefohn, Marco Salvi, Larry Seiler
-
Patent number: 9569886Abstract: In some embodiments, a given frame or picture may have different shading rates. In one embodiment in some areas of the frame or picture the shading rate may be less than once per pixel and in other places it may be once per pixel. An algorithm may be used to determine how the shading rate changes across the frame.Type: GrantFiled: December 19, 2013Date of Patent: February 14, 2017Assignee: Intel CorporationInventors: Tomas G. Akenine-Moller, Karthik Vaidyanathan, Marco Salvi, Robert M. Toth, Aaron Lefohn
-
Patent number: 9275495Abstract: 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.Type: GrantFiled: May 27, 2011Date of Patent: March 1, 2016Assignee: Intel CorporationInventors: Marco Salvi, Jefferson D. Montgomery, Aaron Lefohn
-
Patent number: 9111395Abstract: 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.Type: GrantFiled: August 31, 2009Date of Patent: August 18, 2015Assignee: Intel CorporationInventors: Andrew T. Lauritzen, Aaron Lefohn, Marco Salvi
-
Publication number: 20150178983Abstract: In some embodiments, a given frame or picture may have different shading rates. In one embodiment in some areas of the frame or picture the shading rate may be less than once per pixel and in other places it may be once per pixel. An algorithm may be used to determine how the shading rate changes across the frame.Type: ApplicationFiled: December 19, 2013Publication date: June 25, 2015Inventors: Tomas G. Akenine-Moller, Karthik Vaidyanathan, Marco Salvi, Robert M. Toth, Aaron Lefohn
-
Publication number: 20140375647Abstract: Methods and systems may provide for obtaining a plurality of visibility samples for an image at a sample resolution, wherein a first subset of the plurality of visibility samples has corresponding color samples. One or more of the color samples may be replicated from the first subset to a second subset of the plurality of visibility samples, and the visibility samples and the color samples may be rendered at a native display resolution. Additionally, the sample resolution may be greater than a pixel resolution of the image and greater than or equal to the native display resolution. In one example, the image includes a plurality of pixels and the plurality of visibility samples are obtained in accordance with an axis-aligned grid within each pixel of the image.Type: ApplicationFiled: June 24, 2013Publication date: December 25, 2014Inventors: Marco Salvi, Aaron Lefohn, Larry Seiler
-
Patent number: 8823736Abstract: 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.Type: GrantFiled: January 20, 2012Date of Patent: September 2, 2014Assignee: Intel CorporationInventors: Rasmus Barringer, Carl Johan Gribel, Aaron Lefohn, Tomas G. Akenine-Möller
-
Patent number: 8797323Abstract: 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.Type: GrantFiled: January 18, 2011Date of Patent: August 5, 2014Assignee: Intel CorporationInventors: Marco Salvi, Aaron Lefohn, Andrew T. Lauritzen, Kiril Vidimce
-
Publication number: 20140198113Abstract: Methods and systems may provide for identifying a plurality of subject commands that reference a common screen location and access a read/write resource, and serializing the plurality of subject commands according to a predefined order. Additionally, execution of the plurality of subject commands may be deferred until one or more additional commands referencing the common screen location are executed. In one example, the plurality of subject commands are serialized in response to a serialization command.Type: ApplicationFiled: December 11, 2013Publication date: July 17, 2014Inventors: Tomasz Janczak, Aaron Lefohn, Marco Salvi, Larry Seiler
-
Publication number: 20130257885Abstract: 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.Type: ApplicationFiled: August 21, 2012Publication date: October 3, 2013Inventors: Karthik Vaidyanathan, Marco Salvi, Robert M. Toth, Aaron Lefohn
-
Publication number: 20130187947Abstract: 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.Type: ApplicationFiled: January 20, 2012Publication date: July 25, 2013Inventors: Rasmus Barringer, Carl Johan Gribel, Aaron Lefohn, Tomas G. Akenine-Möller
-
Publication number: 20120299951Abstract: 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.Type: ApplicationFiled: May 27, 2011Publication date: November 29, 2012Inventors: Marco Salvi, Jefferson D. Montgomery, Aaron Lefohn
-
Publication number: 20120182300Abstract: 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.Type: ApplicationFiled: January 18, 2011Publication date: July 19, 2012Inventors: Marco Salvi, Aaron Lefohn, Andrew T. Lauritzen, Kiril Vidimce
-
Publication number: 20110050693Abstract: 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.Type: ApplicationFiled: August 31, 2009Publication date: March 3, 2011Inventors: Andrew T. Lauritzen, Aaron Lefohn, Marco Salvi
-
Patent number: 7589719Abstract: Computer operations are partitioned for execution by a processor. A plurality of operations to be partitioned is received. The respective priorities for each of the plurality of operations is determined. Ready operations are identified, where a ready operation is an operation that does not have any predecessor operations that have not yet been added to a partition. A determination is made whether adding the ready operations with the highest priorities to the current partition would violate a hardware resource constraint. Based on this determination, the ready operations are added to the partition. The operations added to the partition are provided to a processor for execution.Type: GrantFiled: July 15, 2005Date of Patent: September 15, 2009Assignees: The Regents of the University of California, PixarInventors: John Owens, Andy Riffel, Aaron Lefohn, Kiril Vidimce, Mark Leone
-
Publication number: 20060038811Abstract: 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.Type: ApplicationFiled: July 15, 2005Publication date: February 23, 2006Inventors: John Owens, Andy Riffel, Aaron Lefohn, Mark Leone, Kiril Vidimce