Patents by Inventor Tomas Akenine-Möller
Tomas Akenine-Möller 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: 20240087181Abstract: The technology disclosed herein involves using a transformation curve to modify colors of images so that those images are more easily viewed by persons with a color vision deficiency (CVD). The transformation curve is applied to spectral versions of images in which each pixel has a spectral representation to modify the spectral versions of the images. A spectral version of an image is modified by, for each pixel of the spectral version of the image, modifying intensities of one or more wavelengths by applying the one or more wavelengths to the transformation curve, which transforms the intensities from source wavelengths to destination wavelengths. The modified spectral version of the image is then modified to a modified version of the image in a color space, such as the RGB color space.Type: ApplicationFiled: September 13, 2022Publication date: March 14, 2024Inventors: Johan Pontus Andersson, Cyril Crassin, Tomas Akenine-Möller
-
Patent number: 9665951Abstract: A unified compression/decompression architecture is disclosed for reducing memory bandwidth requirements in 3D graphics processing applications. The techniques described erase several distinctions between a texture (compressed once, and decompressed many times), and buffers (compressed and decompressed repeatedly during rendering of an image). An exemplary method for processing graphics data according to one or more embodiments of the invention thus begins with the updating of one or more tiles of a first image array, which are then compressed, using a real-time buffer compression algorithm, to obtain compressed image array tiles. The compressed image array tiles are stored for subsequent use as a texture. During real-time rendering of a second image array, the compressed image array tiles are retrieved and decompressed using a decompression algorithm corresponding to the buffer compression algorithm.Type: GrantFiled: May 27, 2008Date of Patent: May 30, 2017Assignee: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)Inventors: Jim Rasmusson, Tomas Akenine-Möller, Petrik Clarberg, Jon Hasselgren, Jacob Munkberg
-
Patent number: 8842121Abstract: A single instruction multiple data (SIMD) processor with a given width may operate on registers of the same width completely filled with fragments. A parallel set of registers are loaded and tested. The fragments that fail are eliminated and the register set is refilled from the parallel set.Type: GrantFiled: February 3, 2011Date of Patent: September 23, 2014Assignee: Intel CorporationInventors: Tomas Akenine-Möller, Jon N. Hasselgren, Carl J. Munkberg, Robert M. Toth, Franz P. Clarberg
-
Patent number: 8803872Abstract: A computer graphics processor (20,50) and a method for rendering a three-dimensional image on a display screen. The computer graphics processor (20,50) comprises a rasterizer (23,53) configured to perform pixel traversal of a primitive after projection of the primitive. Furthermore, the rasterizer (23,53) is configured to perform the pixel traversal of a first primitive for a plurality of views prior to performing pixel traversal of a next primitive for one or several views.Type: GrantFiled: November 29, 2006Date of Patent: August 12, 2014Assignee: Intel CorporationInventors: Tomas Akenine-Möller, Jacob Munkberg, Jon Hasselgren
-
Patent number: 8654122Abstract: This relates to a generation of digitally represented graphics. A first representation of a group of vertices is received. A second representation of said group of vertices is determined based on said first representation. A first set of instructions is executed on said second representation of said group of vertices for providing a third representation of said group of vertices, said first set of instructions being associated with vertex position determination. The third representation of said group of vertices is subjected to a culling process.Type: GrantFiled: August 3, 2009Date of Patent: February 18, 2014Assignee: Intel CorporationInventors: Jon Hasselgren, Jacob Munkberg, Petrik Clarberg, Tomas Akenine-Möller
-
Patent number: 8644627Abstract: First and second codewords are determined, based on first feature vector components of the image elements in an image block, as representations of a first and second component value. Third and fourth codewords are determined, based on second vector components, as representations of a third and fourth component value. First N1 and second N2 resolution numbers are selected based on the relation of a distribution of the first vector components and a distribution of the second vector components. N1 additional component values are generated based on the first and second component values and N2 additional component values are generated based on the third and fourth component values. Component indices indicative of the generated component values are then provided for the different image elements.Type: GrantFiled: January 23, 2013Date of Patent: February 4, 2014Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Tomas Akenine-Möller, Jacob Munkberg, Petrik Clarberg, Jon Hasselgren, Jacob Ström
-
Publication number: 20130251276Abstract: First and second codewords are determined, based on first feature vector components of the image elements in an image block, as representations of a first and second component value. Third and fourth codewords are determined, based on second vector components, as representations of a third and fourth component value. First N1 and second N2 resolution numbers are selected based on the relation of a distribution of the first vector components and a distribution of the second vector components. N1 additional component values are generated based on the first and second component values and N2 additional component values are generated based on the third and fourth component values. Component indices indicative of the generated component values are then provided for the different image elements.Type: ApplicationFiled: January 23, 2013Publication date: September 26, 2013Applicant: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)Inventors: Tomas AKENINE-MÖLLER, Jacob MUNKBERG, Petrik CLARBERG, Jon HASSELGREN, Jacob STROM
-
Patent number: 8471851Abstract: A method for updating values of a depth buffer comprising values for display blocks of a display, and a device for implementing the method. The display is partitioned into a plurality of display regions, including a plurality of display blocks and having a minimum region depth value and a maximum region depth value. Each display region includes a plurality of display subregions. A minimum subregion depth value and a maximum subregion depth value are determined relative to at least one of the minimum region depth value and the maximum region depth value.Type: GrantFiled: November 18, 2005Date of Patent: June 25, 2013Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Jacob Ström, Tomas Akenine-Möller
-
Patent number: 8447103Abstract: The present invention relates to methods and arrangements for compressing images. The invention is based on the fact that edge blocks contain much information in one direction (across the edge), but very little information in the other direction (along the edge). By encoding edges explicitly, it is possible to obtain a high quality to a very low cost for many blocks. A block is encoded by first specifying the orientation of the edge in the block, and then specifying the profile across the edge using a function with a small number of parameters.Type: GrantFiled: December 22, 2009Date of Patent: May 21, 2013Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Jim Rasmusson, Tomas Akenine-Möller, Per Wennersten, Jakob Ström
-
Patent number: 8437563Abstract: A block (300) of image elements (310) is compressed by determining multiple base vectors (510, 520, 530, 540) based on the feature vectors (312) associated with the image elements. Additional vectors (560, 570) are calculated based on defined pairs of neighboring base vectors (510, 520, 530, 540). A vector among the base vectors (510, 520, 530, 540) and the additional vectors (560, 570) is selected as representation of the feature vector (312) of an image element (310). An identifier (550) associated with selected vector is assigned to the image element (310) and included in the compressed block (500) which also comprises representations of the determined base vectors (510, 520, 530, 540).Type: GrantFiled: March 19, 2008Date of Patent: May 7, 2013Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Tomas Akenine-Möller, Jacob Munkberg, Jacob Ström
-
Patent number: 8396309Abstract: A pixel block is compressed by determining a reference set of multiple reference property values. A value index associated with a reference property value of the reference set is assigned to each pixel in the pixel block based on the original property value of the pixel. A prediction of the value index is provided based on the value index assigned to at least one neighboring pixel in the pixel block. A prediction error is calculated based on the value index assigned to a pixel and its value index prediction. The compressed pixel block includes encoded representations of the prediction errors and an encoded representation of the reference set.Type: GrantFiled: May 13, 2009Date of Patent: March 12, 2013Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Jim Rasmusson, Tomas Akenine-Möller
-
Patent number: 8369629Abstract: First and second codewords are determined, based on first feature vector components of the image elements in an image block, as representations of a first and second component value. Third and fourth codewords are determined, based on second vector components, as representations of a third and fourth component value. First N1 and second N2 resolution numbers are selected based on the relation of a distribution of the first vector components and a distribution of the second vector components. N1 additional component values are generated based on the first and second component values and N2 additional component values are generated based on the third and fourth component values. Component indices indicative of the generated component values are then provided for the different image elements.Type: GrantFiled: January 22, 2007Date of Patent: February 5, 2013Assignee: Telefonaktiebolaget L M Ericsson (publ)Inventors: Tomas Akenine-Möller, Jacob Munkberg, Petrik Clarberg, Jon Hasselgren, Jacob Ström
-
Patent number: 8285063Abstract: A block (300) of image elements (310) is compressed by identifying a base vector (460) based on normalized feature vectors (312) of the block (300). If a position-determining coordinate (420) of the base vector (460) is present inside a defined selection section (530) of feature vector space (500), the block (300) is compressed according to a default mode and an auxiliary mode to get a default and auxiliary compressed block (600), respectively. The compressed block (600) resulting in smallest compression error is selected. If the auxiliary mode is selected, the position-determining coordinate (420) is mapped to get a mapped coordinate (425) present outside the representable normalization portion (510) of vector space (500). The auxiliary compressed block (600) comprises a representation of this mapped coordinate (425). If the default mode is selected no such coordinate mapping is performed and the default compressed block (600) instead comprises a representation of the non-mirrored coordinate (420).Type: GrantFiled: March 31, 2008Date of Patent: October 9, 2012Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Tomas Akenine-Möller, Jacob Munkberg, Jacob Ström
-
Publication number: 20120201467Abstract: A single instruction multiple data (SIMD) processor with a given width may operate on registers of the same width completely filled with fragments. A parallel set of registers are loaded and tested. The fragments that fail are eliminated and the register set is refilled from the parallel set.Type: ApplicationFiled: February 3, 2011Publication date: August 9, 2012Inventors: Tomas Akenine-Möller, Jon N. Hasselgren, Carl J. Munkberg, Robert M. Toth, Franz P. Clarberg
-
Publication number: 20120154399Abstract: Hierarchical bounding of displaced parametric surfaces may be a very common use case for tessellation in interactive and real-time rendering. An efficient normal bounding technique may be used, together with min-max mipmap hierarchies and oriented bounding boxes. This provides substantially faster convergence for the bounding volumes of the displaced surface, without tessellating and displacing the surface in some embodiments. This bounding technique can be used for different types of culling, ray tracing, and to sort higher order primitives in tiling architectures.Type: ApplicationFiled: February 21, 2012Publication date: June 21, 2012Inventors: Jacob Munkberg, Jon Hasselgren, Robert Toth, Tomas Akenine-Möller
-
Publication number: 20120087581Abstract: The present invention relates to methods and arrangements for compressing images. The invention is based on the fact that edge blocks contain much information in one direction (across the edge), but very little information in the other direction (along the edge). By encoding edges explicitly, it is possible to obtain a high quality to a very low cost for many blocks. A block is encoded by first specifying the orientation of the edge in the block, and then specifying the profile across the edge using a function with a small number of parameters.Type: ApplicationFiled: December 22, 2009Publication date: April 12, 2012Applicant: Telefonaktiebolaget LM Ericsson (publ)Inventors: Jim Rasmusson, Tomas Akenine-Möller, Per Wennersten, Jacob Ström
-
Patent number: 8144147Abstract: Hierarchical bounding of displaced parametric surfaces may be a very common use case for tessellation in interactive and real-time rendering. An efficient normal bounding technique may be used, together with min-max mipmap hierarchies and oriented bounding boxes. This provides substantially faster convergence for the bounding volumes of the displaced surface, without tessellating and displacing the surface in some embodiments. This bounding technique can be used for different types of culling, ray tracing, and to sort higher order primitives in tiling architectures.Type: GrantFiled: April 7, 2010Date of Patent: March 27, 2012Assignee: Intel CorporationInventors: Jacob Munkberg, Jon Hasselgren, Robert Toth, Tomas Akenine-Möller
-
Patent number: 8107753Abstract: A pixel block (300) is compressed by sub-sampling at least a portion of the pixels (310) into subblocks (320, 330). Predictions are determined for the property values of these subblocks (320, 330) by calculating a variance measure based on property values of neighboring pixels (310)/subblocks (320, 330) in two prediction directions in the block (300) relative to a current subblock (320, 330). If the variance is below a threshold, the prediction is calculated based on neighboring property values in both directions. If the measure exceeds the threshold, the neighboring property values in only one of the two predictions directions are used for calculating the prediction. A guiding bit (450) descriptive of the selected direction is also provided. A prediction error is calculated based on the property value and the calculated prediction. The compressed block (400) comprises an encoded representation (460) of the prediction error and any guiding bit (470).Type: GrantFiled: January 19, 2009Date of Patent: January 31, 2012Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Jim Rasmusson, Tomas Akenine-Möller, Jacob Ström
-
Publication number: 20110248997Abstract: Hierarchical bounding of displaced parametric surfaces may be a very common use case for tessellation in interactive and real-time rendering. An efficient normal bounding technique may be used, together with min-max mipmap hierarchies and oriented bounding boxes. This provides substantially faster convergence for the bounding volumes of the displaced surface, without tessellating and displacing the surface in some embodiments. This bounding technique can be used for different types of culling, ray tracing, and to sort higher order primitives in tiling architectures.Type: ApplicationFiled: April 7, 2010Publication date: October 13, 2011Inventors: Jacob Munkberg, Jon Hasselgren, Robert Toth, Tomas Akenine-Möller
-
Patent number: 8031937Abstract: Methods and apparatus are disclosed for the processing of frame buffer data, such as color buffer data, in graphics processing applications. Although more generally applicable, these methods and apparatus are particularly useful in real-time, polygon-based, 3D rendering applications. An exemplary method for processing graphics data according to one or more embodiments of the invention begins with the retrieval, from a buffer, of pixel values corresponding to a tile of two or more pixels, and with the updating of one or more of those updated pixel values. The updated pixel values are selectively compressed using a lossy compression operation or a lossless compression operation, based on an accumulated error metric value for the tile. If lossy compression is used, then the accumulated error metric value for the tile is updated; in either event, the compressed pixel values are stored in the frame buffer for further processing.Type: GrantFiled: December 10, 2007Date of Patent: October 4, 2011Assignee: Telefonaktiebolaget LM Ericsson (publ)Inventors: Jim Rasmusson, Tomas Akenine-Möller, Jon Hasselgren, Jacob Munkberg