Patents by Inventor Jacob Ström

Jacob Ström 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: 20110268367
    Abstract: The invention relates to compression of a pixel block (300) of depth values. A reference codeword (410) is determined as a representation of a reference depth value. A row (420) and a column (430) slope codeword are determined as representations of a basic depth slope for the rows (310) and columns (320) in the block (300), respectively. Representations indicating pixel positions where a slope change occurs along at least a portion of a row (310) or column (320) is determined for at least a subset of the rows (310) or columns (320). A mode codeword (440) is determined as a representation of a set of multiple slope correction patterns. A respect pattern codeword (450) is then selected for rows (310) or columns (320) as identifier of one of the slope correction patterns.
    Type: Application
    Filed: October 3, 2007
    Publication date: November 3, 2011
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventor: Jacob Strom
  • Publication number: 20110235928
    Abstract: An image (1) is decomposed into multiple superblocks (20, 22), each encompassing multiple pixel blocks (30A-30D, 32A-32D) having multiple pixels (40). The property values of a superblock (20) is fixed rate compressed to get a compressed block having a target bit length. The compressed block is stored in the memory locations (310, 320) assigned to the multiple pixel blocks (30A-30D) encompassed by the superblock (20) to thereby get multiple copies of the compressed block in the memory (300). The multiple copies collectively constitute a compressed representation of the superblock (20).
    Type: Application
    Filed: May 29, 2009
    Publication date: September 29, 2011
    Applicant: TELEONAKTIEBOLAGET L M ERICSSON (publ)
    Inventors: Jacob Ström, Per Wennersten
  • Publication number: 20110194609
    Abstract: There is provided a method of selecting PMV candidates, wherein each PMV candidate corresponds to a motion vector used for coding of a previous block, said previous block having a distance from a current block. The method comprises identifying allowed distance values of distances between the current block and the previous block. The method further comprises selecting a set of PMV candidates as a subset of the set of previously coded motion vectors that were used for previous blocks having an allowed distance from the current block.
    Type: Application
    Filed: February 7, 2011
    Publication date: August 11, 2011
    Inventors: Thomas Rusert, Jacob Ström, Kenneth Andersson, Per Wennersten, Rickard Sjöberg
  • Publication number: 20110194608
    Abstract: There is provided a method of managing PMV candidates. The method comprises selecting a set of PMV candidates as a subset of the previously coded motion vectors. The method further comprises assigning a code value to each PMV candidate in the set of PMV candidates. The code values vary in length and are assigned to the PMV candidates in order of expected usage such that the PMV candidate having the highest expected usage has one of the shortest code values.
    Type: Application
    Filed: February 7, 2011
    Publication date: August 11, 2011
    Inventors: Thomas Rusert, Jacob Ström, Kenneth Andersson, Per Wennersten, Rickard Sjöberg
  • Publication number: 20110176739
    Abstract: A compressed pixel block (400) is decompressed by defining multiple available property values. At least one reference point relative the pixel block (300) is identified based on a reference codeword (410) of the compressed pixel block (400). Pixel indices of the pixels (310) are determined based on the respective positions of pixels (310) in the pixel block (300) relative the at least one reference point. These pixel indices are used for selecting among the multiple defined property values. The selected property values are then assigned to pixels (310) to be decompressed based on their determined pixel indices.
    Type: Application
    Filed: November 18, 2008
    Publication date: July 21, 2011
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Jacob Strom, Per Wennersten
  • Patent number: 7961185
    Abstract: A plurality of rows of tiles is defined in a graphics display field comprising a plurality of rows of pixels, each tile including pixels from at least two rows of pixels. Occlusion flags for respective tiles of a row of tiles for a graphics primitive are set based on whether respective representative depth values for the tiles of the row of tiles meet an occlusion criterion. Pixels in rows of pixels corresponding to the row of tiles are processed for the graphics primitive in a row-by-row manner responsive to the occlusion flags. The processing may include processing rows of pixels in the row of tiles using a zig-zag traversal algorithm.
    Type: Grant
    Filed: August 31, 2007
    Date of Patent: June 14, 2011
    Assignee: Telefonaktiebolaget LM Ericsson (Publ)
    Inventors: Jacob Ström, Tomas Akenine-Möller
  • Patent number: 7940283
    Abstract: A method and a device for generating a pixel value from a plurality of sample values being generated from a plurality of sample points. The method comprises generating a plurality of sample values; and weighting said plurality of sample values for determining said pixel value. Each sample value is generated from one of a plurality of candidate sample points within a sample region. The sample region is positioned at a corner of two intersecting borders of the pixel. The size of the sample region is smaller than the size of the pixel. The device is arranged to carry out the method according to the invention.
    Type: Grant
    Filed: November 18, 2005
    Date of Patent: May 10, 2011
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Jacob Ström, Tomas Akenine-Möller
  • Publication number: 20110033127
    Abstract: 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: Application
    Filed: January 19, 2009
    Publication date: February 10, 2011
    Inventors: Jim Rasmusson, Tomas Akenine-Moller, Jacob Strom
  • Publication number: 20110026820
    Abstract: A pixel block (300) is compressed by providing a respective color component prediction for each pixel (310-318) in the block (300). A difference between color components of two neighboring pixels (312, 316) is calculated and compared to a threshold. If the difference is smaller than the threshold, the prediction is calculated based on a first linear combination of the color components of these two neighboring pixels (312, 316). However, if the difference exceeds the threshold, a second or third linear combination of the color components of the neighboring pixels (312, 316) is employed a prediction. A guiding bit (470) associated with the selected linear combination. A prediction error is calculated based on the color component of the pixel (318) and the provided prediction. The compressed block (400) comprises an encoded representation (480) of the prediction error and any guiding bit (470).
    Type: Application
    Filed: May 21, 2008
    Publication date: February 3, 2011
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Jacob Strom, Per Wennersten, Tomas Akenine-Moller, Jim Rasmusson
  • Publication number: 20110007967
    Abstract: A method of retrieving information comprised in a barcode is disclosed. The method comprises detecting that the barcode is present in a first image having a first image quality and capturing a first region, acquiring, when it is detected that the barcode is present, a second image having a second image quality and capturing a second region, wherein the second image quality is higher than the first image quality, and wherein the second region at least partly overlaps the first region, and decoding the barcode based on the second image to retrieve the information. A corresponding program product and a corresponding arrangement are also disclosed along with a communication device comprising the arrangement.
    Type: Application
    Filed: February 24, 2009
    Publication date: January 13, 2011
    Inventors: Joakim Söderberg, Jacob Ström, Jonas Alfthan
  • Patent number: 7848597
    Abstract: In an image scaling method, an image (10) having an original row/column resolution NO is scaled into a scaled image (30) having a target row/column resolution NT. A filter set comprising ? filters is provided, where ? being equal to a quotient of the target resolution NT and a common denominator k of the original resolution NO and the target resolution NT. The common denominator k is a positive number larger than one. For at least one row/column (16/18) of image elements (12), a filtered image element (32) of the scaled image (30) is formed, for each filter in the filter set, by filtering at least one image element (12) of the at least one row/column (16/18) using the filter. This image element formation is repeated up to k times over the at least row/column (16/18) to form a scaled row/column (36/38) of image elements (32) of the scaled image (30).
    Type: Grant
    Filed: September 8, 2006
    Date of Patent: December 7, 2010
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Jacob Ström, Joel Askelöf
  • Publication number: 20100296746
    Abstract: A pixel block (300) is compressed by selecting a start depth value and a restart depth value based on the multiple depth values of the pixels (310-318) in the block START (300). A respective plane representation (430) indicative of which plane of a start or restart depth value plane is determined for the pixels (311-318). These representations (430) are employed for selecting a pixel set comprising at least one other pixel (312, 314-317) in the block (300) for a pixel (318) to be encoded. The depth value(s) of the pixel(s) (312, 314-317) in the set are used for determining a prediction of the depth value of the pixel (318). The depth value and the prediction are employed for calculating a prediction error, which is encoded. The compressed pixel block (400) comprises the encoded prediction errors (460), a start value representation (420), a restart value representation (430) and the plane representations (440).
    Type: Application
    Filed: May 6, 2008
    Publication date: November 25, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Jacob Strom, Per Wennersten
  • Publication number: 20100296745
    Abstract: A pixel block (300) is losslessly compressed into a candidate compressed block. If the bit length of the candidate block exceeds a threshold value, the property values of the pixels (310-317) in the block (300) are quantized and the quantized values are losslessly compressed into a new candidate compressed block. The procedure is repeated until a candidate compressed block having good image quality and a bit length below the threshold value is found. A compressed representation (400) of the block (300) is determined based on the found candidate compressed block (420) and an identifier (410) of the used quantization parameter.
    Type: Application
    Filed: September 17, 2008
    Publication date: November 25, 2010
    Applicant: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
    Inventors: Jacob Strom, Tomas Akenine-Moller, Per Wennersten
  • Publication number: 20100273534
    Abstract: A portable electronic apparatus (300) has a display (320) and a keypad (340) with a plurality of keys (342), the keys being distributed within a keypad area (341) in at least a first plane, and the keys being arranged for key-pressing user actuation transversally to the first plane so as to provide a first type of user input. The apparatus also has sensor means (430, 450, 348) positioned to sense navigating user actuation at the keypad area in or coincident with said first plane so as to provide a second type of user input, and a controller (301) configured to control a focus position (323) on the display (320) in response to user input of the second type.
    Type: Application
    Filed: December 19, 2008
    Publication date: October 28, 2010
    Inventor: Jacob Strom
  • Publication number: 20100254621
    Abstract: Device, computer readable medium, and method for selecting compression modes to be applied in a depth buffer (20).
    Type: Application
    Filed: September 12, 2008
    Publication date: October 7, 2010
    Applicant: Telefonaktiebolaget L M Ericsson(publ)
    Inventors: Per Wennersten, Jacob Strom
  • Patent number: 7787691
    Abstract: In a high quality image-encoding scheme an input image is decomposed into several image blocks comprising multiple image elements. The image blocks are encoded into encoded block representations. Such a block representation comprises two color codewords, a color modifying codeword and optionally a sequence of color indices and color modifier indices. The color codewords define multiple discrete color representations along a line in color space. The color modifying codeword represents a set of multiple color modifiers for modifying the multiple color representations along at least one extension vector to obtain, for each color representation, a set of multiple color points. These color points of the multiple sets are located on a surface defined by the multiple color representations and the at least one extension vector. The colors of the image elements in the block are then approximated by these color points on the surface.
    Type: Grant
    Filed: April 11, 2006
    Date of Patent: August 31, 2010
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventor: Jacob Ström
  • Patent number: 7751630
    Abstract: The invention is applied to image processing schemes by providing at least one auxiliary block processing mode in addition to the standard default block processing mode of the scheme. An image to be decoded is divided into a number of image blocks (800) having multiple image elements (810). These blocks (800) are individually compressed by means of a default compressing mode or an auxiliary compressing mode, depending on which mode that results in a smallest error metric. A portion (980) of the resulting compressed block (900) is used to discriminate between the two modes. In the auxiliary mode, the remaining payload portion (990) of the compressed block (900) can be used for encoding purposes, whereas the default mode can in addition utilize the discriminating portion (980).
    Type: Grant
    Filed: July 1, 2005
    Date of Patent: July 6, 2010
    Assignee: Telefonaktiebolaget LM Ericsson (Publ)
    Inventors: Jacob Ström, Tomas Akenine-Möller
  • Patent number: 7734105
    Abstract: An image encoding and decoding scheme operable according two different modes depending on properties of the processed image is disclosed. In the encoding, an image is decomposed into image blocks (600) comprising image elements (610). The blocks (600) are compressed into block representations (700A, 700B) according to one of two compression modes. A block representation (700A; 700B) comprises two codewords (720A, 730A; 720B, 730B) representing properties of the image elements (610) in the block (600) and a sequence (740A; 740B) of image element associated indices indicative of one of the codewords (720B, 730B) or a property representation generated based on a codeword (730A). The block representation (700A; 700B) also includes a mode index representing the mode, according to which the block representation (700A; 700B) was compressed. This mode index can be provided before, during or after generation of the codewords (720A, 730A; 720B, 730B) and index sequence (740A; 740B).
    Type: Grant
    Filed: December 17, 2004
    Date of Patent: June 8, 2010
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Jacob Ström, Tomas Akenine-Möller
  • Publication number: 20100129000
    Abstract: A block of image elements is compressed by determining a parameter representative of a size of a bounding section in vector space encompassing feature vectors associated with the image elements. This size parameter is used to provide a deterministic, pseudo-random pattern of multiple representation vectors encompassed by the bounding section. A vector among multiple representation vectors is selected as representation of the feature vector of an image element. An identifier associated with selected vector is assigned to the image element and included in the compressed block which also comprises representations of the size parameter.
    Type: Application
    Filed: March 11, 2008
    Publication date: May 27, 2010
    Inventor: Jacob Ström
  • Patent number: 7693337
    Abstract: An alpha image encoding and decoding scheme operable according two different modes is disclosed. In the encoding, an alpha image is decomposed into alpha image blocks (600) comprising image elements (610). The blocks (600) are compressed into block representations (700) according to one of the two compression modes. A block representation (700) comprises a color codeword (720), an intensity codeword (730), an alpha codeword (740) and a sequence (750) of image element associated indices indicative of one of the codewords (730, 740). The compression and decompression mode to use for a block (600) is determined based on the alpha codeword (740). In a high alpha-resolution mode, the index sequence (750) comprises alpha indices selecting one of the quantized alpha values (740A, 740B) of the alpha codeword (740) and intensity indices selecting an intensity modifier from a modifier set represented by the intensity codeword (730).
    Type: Grant
    Filed: December 17, 2004
    Date of Patent: April 6, 2010
    Assignee: Telefonaktiebolaget LM Ericsson (publ)
    Inventors: Jacob Ström, Tomas Akenine-Möller