Compression/decompression Patents (Class 708/203)
  • Patent number: 10810281
    Abstract: An outer product multiplier (GPM) system/method that integrates compute gating and input/output circular column rotation functions to balance time spent in compute and data transfer operations while limiting overall dynamic power dissipation is disclosed. Matrix compute gating (MCG) based on a computation decision matrix (CDM) limits the number of computations required on a per cycle basis to reduce overall matrix compute cycle power dissipation. A circular column rotation vector (CRV) automates input/output data formatting to reduce the number of data transfer operations required to achieve a given matrix computation result. Matrix function operators (MFO) utilizing these features are disclosed and include: matrix-matrix multiplication; matrix-matrix and vector-vector point-wise multiplication, addition, and assignment; matrix-vector multiplication; vector-vector inner product; matrix transpose; matrix row permute; and vector-column permute.
    Type: Grant
    Filed: August 7, 2018
    Date of Patent: October 20, 2020
    Assignee: TEXAS INSTRUMENTS INCORPORATED
    Inventors: Arthur John Redfern, Donald Edward Steiss, Mihir Narendra Mody, Tarek Aziz Lahlou
  • Patent number: 10764588
    Abstract: Techniques are disclosed for coding image data adaptively at different levels of downscaling. Such techniques may involve partitioning input data into pixel blocks for coding and performing content analysis on the pixel blocks. The pixel blocks may be input to block coders that operate at different pixel block sizes, which may code the pixel blocks input to them at their respective sizes. Except when a block coder operates at the partitioning size, block coders that operate at different pixel block sizes may perform downscaling of the pixel blocks to match their size with the block coders' respective coding size. A block decoder may invert the coding operations performed by the block coders, decoding coded image data at respective pixel block sizes, then upscaling decoded image data obtained therefrom to a common pixel block size. Image reconstruction may synthesize a resultant image from the decode pixel block data output by the decoders.
    Type: Grant
    Filed: August 10, 2018
    Date of Patent: September 1, 2020
    Assignee: APPLE INC.
    Inventors: Xiang Fu, Linfeng Guo, Haiyan He, Wei Li, Xu Gang Zhao, Hao Pan, Xiaohua Yang, Krishnakanth Rapaka, Munehiro Nakazato, Haitao Guo
  • Patent number: 10763893
    Abstract: A data compression system includes: (a) a data compression module that receives a sequence of input vectors and that provides a sequence of compressed vectors; (b) a data decompression module that receives the compressed vectors to provide a sequence of output vectors; and (c) a parameter update module that receives the sequence of input vectors and the sequence of output vectors, and which learns the data compression module and data decompression module based on evaluating a loss function of the input vectors, the output vectors, and the parameters controlling the compression module and the decompression module. Each input vector and its corresponding output vector may represent digitized time-domain signals (e.g., speech, audio or video signals) over a predetermined time period. The loss function may be evaluated for each of a sequence of predetermined time periods.
    Type: Grant
    Filed: July 19, 2017
    Date of Patent: September 1, 2020
    Inventor: Georges Harik
  • Patent number: 10761756
    Abstract: A technique for performing in-line compression includes receiving data into a data log that temporarily holds the data and aggregating the data into batches, where each batch includes multiple blocks of received data. For each batch of data, a storage system performs a compression operation, which proceeds block-by-block, compressing each block and comparing a total compressed size of all blocks compressed so far against a budget. The storage system increments the budget for successive blocks, such that a per-block budget is greater for a first block in the batch than it is for a last block in the batch, thus allowing earlier blocks to meet budget even if they are relatively incompressible.
    Type: Grant
    Filed: December 28, 2016
    Date of Patent: September 1, 2020
    Assignee: EMC IP Holding Company LLC
    Inventors: Ivan Bassov, Philippe Armangau, Yining Si
  • Patent number: 10638482
    Abstract: The choice of a transmit (Tx)-Receive (Rx) beam pair out of many available beam pairs between a base station and a millimeter wave (mmW)-capable UE is directly related to the performance of transmission between the base station and the UE. A method, apparatus, and computer-readable medium at a transmitting user equipment (UE) capable of (mmW) communication are disclosed to determine a new serving Tx-Rx beam pair using an artificial neural network. The UE may predict a set of good Tx-Rx beam pairs using the artificial neural network, wherein the artificial neural network comprises an input layer, a middle layer, and an output layer. The UE may then determine the new serving Tx-Rx beam pair based on the set of good Tx-Rx beam pairs.
    Type: Grant
    Filed: December 15, 2017
    Date of Patent: April 28, 2020
    Assignee: QUALCOMM Incorporated
    Inventors: Jun Zhu, Raghu Narayan Challa, Assaf Touboul, Junyi Li
  • Patent number: 10567458
    Abstract: A system and method are provided for use with streaming blocks of data, each of the streaming blocks of data including a number bits of data. The system includes a first compressor and a second compressor. The first compressor can receive and store a number n blocks of the streaming blocks of data, can receive and store a block of data to be compressed of the streaming blocks of data, can compress consecutive bits within the block of data to be compressed based on the n blocks of the streaming blocks of data, can output a match descriptor and a literal segment. The match descriptor is based on the compressed consecutive bits. The literal segment is based on a remainder of the number of bits of the data to be compressed not including the consecutive bits. The second compressor can compress the literal segment and can output a compressed data block including the match descriptor and a compressed string of data based on the compressed literal segment.
    Type: Grant
    Filed: July 20, 2017
    Date of Patent: February 18, 2020
    Assignee: Hughes Network Systems, LLC
    Inventors: Udaya Bhaskar, Chi-Jiun Su
  • Patent number: 10553413
    Abstract: A hardware module which operatively carries out a method of compressing mass spectral data, the method comprising: receiving a first signal output from an ion detector of a mass spectrometer; processing the first signal to a digital signal at an output being data frame types representative of the first signal output; temporarily storing the data frame types in a memory block and reading a data frame from the memory block and determining its data frame type and according to its data frame type compressing the data frame according to one or more compression algorithms to generate a compressed data output stream.
    Type: Grant
    Filed: April 19, 2018
    Date of Patent: February 4, 2020
    Assignee: MICROMASS UK LIMITED
    Inventors: Stephen John Platt, Keith George Richardson, David Darrell Williams, Richard Denny
  • Patent number: 10528641
    Abstract: A method for efficient transmission of coefficients examines a coefficient list, presents the coefficients as binary floating point representation, and transmits the list of coefficients as a header having an exponent prefix, a fractional suffix, and each coefficient value as an exponent suffix and fractional prefix. A method for reception of coefficients receives a header including an exponent prefix, a fractional suffix, thereafter receiving each value as a sign bit, an exponent suffix and a fractional prefix, reconstituting an approximation of the original value, in sequence, as a sign bit, exponent prefix exponent suffix, fraction prefix, and fraction suffix, thereby greatly reducing the amount of information to be transmitted or received.
    Type: Grant
    Filed: May 14, 2018
    Date of Patent: January 7, 2020
    Assignee: Redpine Signals, Inc.
    Inventor: Jay A. Chesavage
  • Patent number: 10516415
    Abstract: A method for compressing multiple original convolution parameters into a convolution operation chip includes steps of: determining a range of the original convolution parameters; setting an effective bit number for the range; setting a representative value, wherein the representative value is within the range; calculating differential values between the original convolution parameters and the representative value; quantifying the differential values to a minimum effective bit to obtain a plurality of compressed convolution parameters; and transmitting the effective bit number, the representative value and the compressed convolution parameters to the convolution operation chip.
    Type: Grant
    Filed: February 9, 2018
    Date of Patent: December 24, 2019
    Assignee: KNERON, INC.
    Inventors: Li Du, Yuan Du, Jun-Jie Su, Ming-Zhe Jiang
  • Patent number: 10419769
    Abstract: An image processing apparatus which compares a first frame rate of a first moving image and a second frame rate of a second moving image each moving image having temporal scalability, converts a temporal hierarchical structure of the second moving image, when the first frame rate is higher than the second frame rate, by copying and inserting a picture included in a first temporal layer of the second moving image into a second temporal layer of the second moving image, and when the first frame rate is lower than the second frame rate, by discarding a picture, of pictures belonging to temporal layers of the second moving image, which belongs to a temporal layer with a frame rate higher than the first frame rate, and combines the first moving image with the converted second moving image.
    Type: Grant
    Filed: October 25, 2016
    Date of Patent: September 17, 2019
    Assignee: Canon Kabushiki Kaisha
    Inventor: Ryota Suzuki
  • Patent number: 10296556
    Abstract: A system and method for efficient sparse matrix processing are provided in one embodiment. A compressed representation of a sparse matrix, the sparse matrix including one or more non-zero entries in one or more of a plurality of portions of the matrix, is obtained by at least one server including one or more streaming multiprocessors, each of the streaming multiprocessors including one or more graphics processing unit (GPU) processor cores. Each of the portions are assigned into one of a plurality of partitions based on a number of the non-zero entries in that portion. For each of the partitions, a predefined number of the GPU processor cores are assigned for processing each of the portions assigned to that partition based on the numbers of the non-zero entries in the portions assigned to that partition. For each of the partitions, each of the portions associated with that partition are processed.
    Type: Grant
    Filed: September 7, 2017
    Date of Patent: May 21, 2019
    Assignee: Palo Alto Research Center Incorporated
    Inventor: Rong Zhou
  • Patent number: 10218764
    Abstract: Generating non-compressible data streams is disclosed, including: receiving an initialization parameter; determining a constrained prime number, wherein the constrained prime number comprises a plurality of component values, wherein each of the plurality of component values comprises a prime number, wherein each of the plurality of component values is different; and generating a non-compressible sequence based at least in part on the initialization parameter and the constrained prime number.
    Type: Grant
    Filed: June 28, 2018
    Date of Patent: February 26, 2019
    Assignee: EMC IP Holding Company LLC
    Inventors: Salil Dangi, James Zarbock, Ernest Daza, Scott H. Ogata
  • Patent number: 10218381
    Abstract: A method for compressing flow data, including: generating multiple line segments according to flow data and a predefined maximum error that are acquired; obtaining a target piecewise linear function according to the multiple line segments, where the target piecewise linear function includes multiple linear functions, and an intersection set of value ranges of independent variables of every two linear functions among the multiple linear functions includes a maximum of one value; and outputting a reference data point according to the target piecewise linear function, where the reference data point includes a point of continuity and a point of discontinuity of the target piecewise linear function. In this way, a maximum error, a target piecewise linear function is further determined according to the multiple line segments, and a point of continuity and a point of discontinuity of the target piecewise linear function are used to represent compressed flow data.
    Type: Grant
    Filed: September 6, 2017
    Date of Patent: February 26, 2019
    Assignee: Huawei Technologies Co., Ltd.
    Inventors: Zhenguo Li, Ge Luo, Ke Yi, Wei Fan, Cheng He
  • Patent number: 10200060
    Abstract: Lossless content-aware compression and decompression techniques are provided for floating point data, such as seismic data. A minimum-length compression technique exploits an association between an exponent and a length of the significand, which corresponds to the position of the least significant bit of the significand. A reduced number of bits from the significand can then be stored. A prediction method is also optionally previously applied, so that residual values with shorter lengths are compressed instead of the original values. An alignment compression technique exploits repetition patterns in the floating point numbers when they are aligned to the same exponent. Floating point numbers are then split into integral and fractional parts. The fractional part is separately encoded using a dictionary-based compression method, while the integral part is compressed using a delta-encoding method.
    Type: Grant
    Filed: March 20, 2017
    Date of Patent: February 5, 2019
    Assignee: EMC IP Holding Company LLC
    Inventors: Angelo E. M. Ciarlini, Alex L. Bordignon, Rômulo Teixeira de Abreu Pinho, Edward José Pacheco Condori
  • Patent number: 10176976
    Abstract: The invention relates to an ion source (50) for generating elemental ions and/or ionized metal oxides from aerosol particles, comprising: a reduced pressure chamber (61) having an inside; an inlet (56) and a flow restricting device (60) for inserting the aerosol particles in a dispersion comprising the aerosol particles dispersed in a gas, in particular in air, into the inside of the reduced pressure chamber (61), the inlet (60) fluidly coupling an outside of the reduced pressure chamber (61) via the flow restricting device (60) with the inside of the reduced pressure chamber (60); a laser (62) for inducing in a plasma region (63) in the inside of the reduced pressure chamber (61) a plasma in the dispersion for atomizing and ionizing the aerosol particles to elemental ions and/or ionized metal oxides; wherein the reduced pressure chamber (61) is adapted for achieving and maintaining in the inside of the reduced pressure chamber (61) a pressure in a range from 0.01 mbar to 100 mbar.
    Type: Grant
    Filed: December 29, 2017
    Date of Patent: January 8, 2019
    Assignee: TOFWERK AG
    Inventor: Urs Rohner
  • Patent number: 10171835
    Abstract: A method of encoding a video data including a plurality of pictures includes storing data of at least one picture in the video data that is already encoded, and referring to the stored data and using intra-prediction to encode blocks in a current picture.
    Type: Grant
    Filed: March 10, 2016
    Date of Patent: January 1, 2019
    Assignee: Samsung Display Co., Ltd.
    Inventor: Kazushi Sato
  • Patent number: 10122379
    Abstract: Methods and apparatus are provided for content-aware compression of data. An exemplary method comprises obtaining a plurality of floating point numbers each comprising a sign, an exponent at a given base and a significand; grouping a plurality of exponents of the plurality of floating point numbers using a transformation that provides a transformed exponent to reduce a number of distinct exponents in the plurality of floating point numbers to be encoded; and encoding the given floating point number by encoding the transformed exponent and the length of the given floating point number as a single class code. A substantially optimal number of output class codes that need to be encoded is optionally automatically selected. A linear prediction algorithm, such as a first derivative or a second derivative, is optionally applied to the floating point numbers to generate a prediction, wherein the first or second derivative is selected based on an analysis of the data to be compressed.
    Type: Grant
    Filed: March 23, 2016
    Date of Patent: November 6, 2018
    Assignee: EMC IP Holding Company LLC
    Inventors: Angelo E. M. Ciarlini, Rômulo Teixeira de Abreu Pinho, Alex Laier Bordignon
  • Patent number: 10080028
    Abstract: A method of compensating for image compression errors is presented. The method comprises: receiving an image frame Fn during a frame period n, where n is a natural number; adding a compensation frame Cn to the image frame Fn to generate a compensated frame En; compressing the compensated frame En to generate a compressed frame CEn; decompressing the compressed frame CEn to generate a decompressed frame Dn; and subtracting the decompressed frame Dn from the compensated frame En to generate a next compensation frame Cn+1.
    Type: Grant
    Filed: November 17, 2015
    Date of Patent: September 18, 2018
    Assignee: Samsung Display Co., Ltd.
    Inventors: Ning Lu, Dihong Tian
  • Patent number: 10037872
    Abstract: Systems for the generation of discovery ion currents. One of the systems includes a mass spectrometer providing ion current measurement. The system includes a controller coupled to the mass spectrometer. The system also includes a liquid handler coupled to the controller and the mass spectrometer. The controller is configured to identify a base average ion current of each mass to charge interval, the mass to charge interval comprising at least one mass to charge channel. The controller is configured to calculate a relative change between a current ion current measurement for a charge interval to the base average for the charge interval. The controller is configured to compare the relative change to a threshold. The controller is also configured to, in response to determining that the relative change exceeds the threshold, start fraction collection using the liquid handler.
    Type: Grant
    Filed: August 29, 2017
    Date of Patent: July 31, 2018
    Assignee: Advion Inc.
    Inventor: Lawrence Klecha
  • Patent number: 9870285
    Abstract: An apparatus, according to one embodiment, includes: one or more memory devices, each memory device comprising non-volatile memory configured to store data, and a memory controller connected to the one or more memory devices. The memory controller is configured to: detect at least one read of a logical page straddled across codewords, store an indication of a number of detected reads of the straddled logical page, and relocate the straddled logical page to a different physical location in response to the number of detected reads of the straddled logical page, wherein the logical page is written to the different physical location in a non-straddled manner. Other systems, methods, and computer program products are described in additional embodiments.
    Type: Grant
    Filed: November 18, 2015
    Date of Patent: January 16, 2018
    Assignee: International Business Machines Corporation
    Inventors: Charles J. Camp, Timothy J. Fisher, Nikolas Ioannou, Thomas Parnell, Roman A. Pletka, Sasa Tomic
  • Patent number: 9728385
    Abstract: A time-of-flight (TOF) mass spectrometer analyzes a sample producing a time series of data points representing amounts of detected ions per unit time. A spectrometer resolution, a spectrometer digitization time period, and a minimum number points per peak needed to maintain the information content of a peak are received. A peak width value is calculated for each point from the resolution and a time of each point. The calculated peak width value for each point is divided by the minimum number points per peak. A maximum time difference between points for each point is produced. A point is selected based on the digitization time period. Adjacent points of the selected point are found. If a difference between the adjacent points does not exceed a sum of a maximum time differences of the adjacent points, the selected point is deleted to compress the time series.
    Type: Grant
    Filed: December 15, 2012
    Date of Patent: August 8, 2017
    Assignee: DH Technologies Development Pte. Ltd.
    Inventor: Darin Latimer
  • Patent number: 9660666
    Abstract: Lossless content-aware compression and decompression techniques are provided for floating point data, such as seismic data. A minimum-length compression technique exploits an association between an exponent and a length of the significand, which corresponds to the position of the least significant bit of the significand. A reduced number of bits from the significand can then be stored. A prediction method is also optionally previously applied, so that residual values with shorter lengths are compressed instead of the original values. An alignment compression technique exploits repetition patterns in the floating point numbers when they are aligned to the same exponent. Floating point numbers are then split into integral and fractional parts. The fractional part is separately encoded using a dictionary-based compression method, while the integral part is compressed using a delta-encoding method.
    Type: Grant
    Filed: December 22, 2014
    Date of Patent: May 23, 2017
    Assignee: EMC IP Holding Company LLC
    Inventors: Angelo E. M. Ciarlini, Alex L. Bordignon, Rômulo Teixeira de Abreu Pinho, Edward José Pacheco Condori
  • Patent number: 9489551
    Abstract: A method is provided for reading data relating to a tire, in which the data is stored in an electronic device integrated into the tire, and in which the tire is identified by a serial number and a manufacturing week number. A storage unit of the electronic device includes a data storage zone having a storage range formed of a number of bits. The storage range is also referred to as a restricted range, and the number of bits of the restricted range is less than or equal to 38. According to the method, the data stored in the restricted range is read, and the data read from the restricted range is decoded in order to determine the serial number and the manufacturing week number of the tire.
    Type: Grant
    Filed: May 22, 2013
    Date of Patent: November 8, 2016
    Assignees: COMPAGNIE GENERALE DES ETABLISSEMENTS MICHELIN, MICHELIN RECHERCHE ET TECHNIQUE S.A.
    Inventor: Thierry Penot
  • Patent number: 9432050
    Abstract: A method of updating data compression software. The method comprises using real-time data to train upgraded compression/decompression software. A compressor and/or decompressor function processes and delivers the real-time data using an existing compression/decompression software. Following completion of the training process, the compressor and/or decompressor deactivates the existing compression/decompression software and activates the upgraded compression/decompression software to process and deliver the real-time data.
    Type: Grant
    Filed: June 3, 2013
    Date of Patent: August 30, 2016
    Assignee: Telefonaktiebolaget LM Ericsson (Publ)
    Inventors: Fredrik Persson, Jens Knutsson, Hans Eriksson, Paul Stjernholm, Lars Westberg
  • Patent number: 9412570
    Abstract: A hardware module which operatively carries out a method of compressing mass spectral data, the method comprising: receiving a first signal output from an ion detector of a mass spectrometer; processing the first signal to a digital signal at an output being data frame types representative of the first signal output; temporarily storing the data frame types in a memory block and reading a data frame from the memory block and determining its data frame type and according to its data frame type compressing the data frame according to one or more compression algorithms to generate a compressed data output stream.
    Type: Grant
    Filed: March 28, 2013
    Date of Patent: August 9, 2016
    Assignee: Micromass UK Limited
    Inventors: Stephen John Platt, Keith George Richardson, David Darrell Williams, Richard Denny
  • Patent number: 9338014
    Abstract: A network system includes a management apparatus and multiple apparatuses. The management apparatus includes a preparation instruction unit to transmit an instruction to prepare a certificate request to the apparatuses; a collection unit to collect the certificate requests; a request unit to request issuance of certificates to a certificate authority; a resetting instruction unit to transmit the issued certificates to the apparatuses and to instruct resetting of certificates. The apparatus includes a storing unit including an operation area for storing a first certificate and a provisional operation area; a provisionally operating unit to transfer the first certificate to the provisional operation area, and to generate a certificate request, and to transmit the certificate request to the management apparatus; a setting unit to store a second certificate, issued by the certificate authority, in the operation area, and to instruct a communication unit to conduct the communication by switching a certificate.
    Type: Grant
    Filed: May 1, 2014
    Date of Patent: May 10, 2016
    Assignee: Ricoh Company, Ltd.
    Inventor: Yoshimi Satoh
  • Patent number: 9311721
    Abstract: Systems and methods for decompressing compressed data that has been compressed by way of a lossless compression algorithm are described herein. In a general embodiment, a graphics processing unit (GPU) is programmed to receive compressed data packets and decompress such packets in parallel. The compressed data packets are compressed representations of an image, and the lossless compression algorithm is a Rice compression algorithm.
    Type: Grant
    Filed: October 30, 2013
    Date of Patent: April 12, 2016
    Assignee: Sandia Corporation
    Inventor: Thomas A. Loughry
  • Patent number: 9264067
    Abstract: Some embodiments include two-dimensional compressed data sets that can be re-aligned while preserving compression of the data. A set of one or more shifts and a corresponding set of one or more first dimension indices into a two-dimensional compressed data set for re-aligning the two-dimensional compressed data set are determined. Impact of re-aligning upon each vector in the second dimension of the two-dimensional compressed data set is determined while the two-dimensional compressed data set remains compressed. New compressed vectors are created in the second dimension resulting from re-aligning. Compression information is modified for each of the original vectors of the two-dimensional compressed data set that remain after re-aligning based, at least in part, on the new compressed vectors. A re-aligned version of the two-dimensional compressed data set is created with the new compressed vectors, and the remaining original vectors with their modified compression information.
    Type: Grant
    Filed: August 31, 2015
    Date of Patent: February 16, 2016
    Assignee: International Business Machines Corporation
    Inventor: Stuart E. Carney
  • Patent number: 9252804
    Abstract: Some embodiments include an apparatus and a computer program product configured to re-align two-dimensional compressed data sets while preserving compression of the data. A set of one or more shifts and a corresponding set of one or more first dimension indices into a two-dimensional compressed data set for re-aligning the two-dimensional compressed data set are determined. Impact of re-aligning upon each vector in the second dimension of the two-dimensional compressed data set is determined while the two-dimensional compressed data set remains compressed. New compressed vectors are created in the second dimension resulting from re-aligning. Compression information is modified for each of the original vectors of the two-dimensional compressed data set that remain after re-aligning based, at least in part, on the new compressed vectors.
    Type: Grant
    Filed: January 18, 2013
    Date of Patent: February 2, 2016
    Assignee: International Business Machines Corporation
    Inventor: Stuart E. Carney
  • Patent number: 9225965
    Abstract: A method for producing 3D multi-view visual contents including capturing a visual scene from at least one first point of view for generating a first bidimensional image of the scene and a corresponding first depth map indicative of a distance of different parts of the scene from the first point of view. The method further includes capturing the visual scene from at least one second point of view for generating a second bidimensional image; processing the first bidimensional image to derive at least one predicted second bidimensional image predicting the visual scene captured from the at least one second point of view; deriving at least one predicted second depth map predictive of a distance of different parts of the scene from the at least one second point of view by processing the first depth map, the at least one predicted second bidimensional image and the second bidimensional image.
    Type: Grant
    Filed: November 7, 2008
    Date of Patent: December 29, 2015
    Assignee: Telecom Italia S.p.A.
    Inventors: Gianmario Bollano, Donato Ettorre, Davide Spinnato
  • Patent number: 9167247
    Abstract: Methods and apparatuses for performing inter-color-plane prediction with adaptability to various existing video content representations are provided. A plurality of predetermined rescaling schemes based on a color plane format is selected. A first block of original samples of a first color plane is encoded into a compressed bitstream. A block of reconstructed samples of the first color plane is reconstructed. An inter-color-plane prediction process is performed to produce samples of a second color plane. Said block of prediction samples of the second color plane is subtracted from a second block of original samples of the second color plane to produce a block of residual samples of the second color plane where the positions of the first block and the second block of original samples are aligned. Finally, the block of residual samples of the second color plane is encoded.
    Type: Grant
    Filed: May 18, 2012
    Date of Patent: October 20, 2015
    Assignee: Panasonic Intellectual Property Corporation of America
    Inventors: Viktor Wahadaniah, Chong Soon Lim, Sue Mon Thet Naing, Jin Li, Haiwei Sun, Takahiro Nishi, Hisao Sasai, Youji Shibahara, Kyoko Tanikawa, Toshiyasu Sugio, Toru Matsunobu
  • Patent number: 9081978
    Abstract: Techniques are described for tokenizing information to be stored in an untrusted environment. During tokenization, one or more strings in a file or data stream are replaced with a token. The token may be generated as a random number or a counter, such that the replaced string may not be derived based on the token. Token-to-string mapping data may be stored in a trusted environment, and the tokenized information may be stored in the untrusted environment. Users may search the tokenized information based on non-sensitive search terms present in a whitelist that is accessible from the untrusted environment, the whitelist providing a token-to-string mapping for the non-sensitive terms. The search results may be provided as redacted information, in which the non-sensitive strings have been detokenized based on the whitelist while the sensitive strings remain tokenized.
    Type: Grant
    Filed: May 30, 2013
    Date of Patent: July 14, 2015
    Assignee: Amazon Technologies, Inc.
    Inventors: Jeremiah John Connolly, Dennis Marinus
  • Patent number: 9044153
    Abstract: Random sinogram variance is reduced in continuous bed motion acquisition. The randoms are modeled as a product of transverse singles efficiencies. The random sinogram is assumed to be a smooth function in the axial direction, collapsing the parameterization for estimating the transverse singles efficiencies into a single, conceptual ring. By solving the product, the mean random values are used to smooth the randoms in image reconstruction with less noise and artifacts.
    Type: Grant
    Filed: January 9, 2013
    Date of Patent: June 2, 2015
    Assignee: Siemens Medical Solutions USA, Inc.
    Inventor: Vladimir Y. Panin
  • Patent number: 9047118
    Abstract: Compression of floating-point numbers is realized by comparing the exponents of the floating-point numbers to one or more exponent thresholds to classify the floating-point numbers and to apply different compression types to the different classes. Each class and compression type is associated with an indicator. An indicator array contains M indicators for M floating-point numbers. The position of the indicator in the indicator array corresponds to one of the floating-point numbers and the indicator value specifies the class and compression type. The floating-point number is encoded in accordance with the compression type for its class. A compressed data packet contains the indicator array and up to M encoded floating-point numbers.
    Type: Grant
    Filed: June 27, 2012
    Date of Patent: June 2, 2015
    Assignee: Altera Corporation
    Inventor: Albert W. Wegener
  • Patent number: 9026568
    Abstract: Memory system operations are extended for a data processor by DMA, cache, or memory controller to include a DMA descriptor, including a set of operations and parameters for the operations, which provides for data compression and decompression during or in conjunction with processes for moving data between memory elements of the memory system. The set of operations can be configured to use the parameters and perform the operations of the DMA, cache, or memory controller. The DMA, cache, or memory controller can support moves between memory having a first access latency, such as memory integrated on the same chip as a processor core, and memory having a second access latency that is longer than the first access latency, such as memory on a different integrated circuit than the processor core.
    Type: Grant
    Filed: September 14, 2012
    Date of Patent: May 5, 2015
    Assignee: Altera Corporation
    Inventor: Albert W. Wegener
  • Patent number: 9013495
    Abstract: A rendering apparatus and method are provided. The rendering method includes: reading a block, corresponding to a fragment, from among compressed blocks stored in a depth buffer, by considering frequency information corresponding to the fragment and prepared in advance; and performing a depth test for the fragment by considering the restored block.
    Type: Grant
    Filed: April 14, 2008
    Date of Patent: April 21, 2015
    Assignees: Samsung Electronics Co., Ltd., Yonsei University Industry Foundation
    Inventors: Sang-oak Woo, Seok-yoon Jung, Kwon-taek Kwon, Tack-don Han, Woo-chan Park, Woo-nam Chung, Jin-hong Park, Jeong-soo Park
  • Publication number: 20150100609
    Abstract: A method, executed by at least one processor, for compressing time-varying scientific data, includes receiving time-varying data corresponding to a physical phenomenon within a domain comprising one or more spatial dimensions, conducting a proper orthogonal decomposition of the time-varying data to provide basis vectors for the time-varying data, generating a set of expansion coefficients corresponding to the basis vectors that are most prominent in the time-varying data, conducting an image compression algorithm on the expansion coefficients to provide a compressed representation of the time-varying data, and storing the compressed representation of the time-varying data. The time-varying data may be numeric data generated from a physical simulation or from experimentation. In some embodiments, the time-varying data corresponds to one or more sub-domains within a larger dataset. The sub-domains may be coherent sub-domains that have similar modes.
    Type: Application
    Filed: October 7, 2014
    Publication date: April 9, 2015
    Inventors: Trevor Blanc, Steve Gorell, Matthew Jones, Earl Duque
  • Patent number: 9002913
    Abstract: Method for fully adaptive calibration of a prediction error coder, comprising a first step of initialization; a second step of reception and accumulation of block-size data samples wherein for each received value, it is added one to the histogram bin associated to that value; a third step of analysis of the histogram and determination of the coding option; a fourth step of analysis of the histogram and determination of a coding table; a fifth step of output a header with the prediction error coder coding table determined; and wherein previous steps are repeated if more samples need to be compressed. It is useful as a data compression technique, with the advantage of being faster and more robust than the current CCSDS lossless compression standard.
    Type: Grant
    Filed: June 22, 2009
    Date of Patent: April 7, 2015
    Assignees: Universidad de Barcelona, Universitat Politecnica de Catalunya
    Inventors: Jordi Portell I De Mora, Enrique Garcíaberro Montilla, Xavier Luri Carrascoso, Alberto González Villafranca, Jorge Torra Roca
  • Publication number: 20150088945
    Abstract: Methods and systems for adaptive compression include compressing input data according to a first compression ratio; pausing compression after a predetermined amount of input data is compressed; estimating which of a set of ranges a compressed output size will fall within using current settings; and performing compression on a remainder of the input data according to a second compression ratio based on the estimated range.
    Type: Application
    Filed: June 30, 2014
    Publication date: March 26, 2015
    Inventors: Erik Kruus, Cristian Ungureanu
  • Patent number: 8989508
    Abstract: An electronic device for sending a message is described. The electronic device includes a processor and instructions stored in memory that is in electronic communication with the processor. The electronic device determines whether a picture is allowed to be decoded on a sub-picture level. If the picture is allowed to be decoded on a sub-picture level, the electronic device generates at least one of a buffer size parameter and a buffer scale parameter. The electronic device sends at least one of the buffer size parameter and the buffer scale parameter.
    Type: Grant
    Filed: September 28, 2012
    Date of Patent: March 24, 2015
    Assignee: Sharp Kabushiki Kaisha
    Inventor: Sachin G. Deshpande
  • Patent number: 8990275
    Abstract: An algorithm for efficiently compressing floating-point data in 3D meshes is disclosed. 3D meshes are represented by topology data, geometry data and property data. Geometry data specify vertex locations and are usually represented by floating-point coordinates. While geometry data are usually compressed by quantization, prediction and entropy coding, the present invention uses no prediction. A floating-point number consists of mantissa and exponent, and normally the exponent, sign and mantissa are compressed separately. A method for encoding floating-point formatted data comprises determining if a current floating-point value was previously stored in a memory, storing the current value in the memory if it was not previously stored in the memory, and encoding it. Otherwise, if the current floating-point value was previously stored in a memory, the storage position of the value within the memory is determined and a reference pointing to the storage position is encoded.
    Type: Grant
    Filed: September 9, 2010
    Date of Patent: March 24, 2015
    Assignee: Thomson Licensing
    Inventors: Qu Qing Chen, Tong Zhou, Zhi Bo Chen
  • Publication number: 20150067009
    Abstract: Various embodiments relating to encoding a sparse matrix into a data structure format that may be efficiently processed via parallel processing of a computing system are provided. In one embodiment, a sparse matrix may be received. A set of designated rows of the sparse matrix may be traversed until all non-zero elements in the sparse matrix have been placed in a first array. Each time a row in the set is traversed, a next non-zero element in that row may be placed in the first array. If all non-zero elements for a given row of the set of designated rows have been placed in the first array, the given row may be replaced in the set of designated rows with a next unprocessed row of the sparse matrix. The data structure in which the sparse matrix is encoded may be outputted. The data structure may include the first array.
    Type: Application
    Filed: August 30, 2013
    Publication date: March 5, 2015
    Applicant: Microsoft Corporation
    Inventors: Karin Strauss, Jeremy Fowers, Kalin Ovtcharov
  • Patent number: 8958653
    Abstract: An apparatus is provided for decoding last position information indicating a horizontal position and a vertical position of a last non-zero coefficient in a predetermined order within a current block to be decoded, the current block being included in a picture and including a plurality of coefficients. The apparatus includes one or more processors, a communication unit, and storage coupled to the one or more processors and the communication unit. The communication unit is configured to transmit a request for a bitstream to an external system, and receive the bitstream from the external system. The one or more processors are configured to obtain the bitstream, perform first arithmetic decoding, perform second arithmetic decoding, derive a horizontal component of the last position information, and derive a vertical component of the last position. A system for decoding and a displaying method are also provided.
    Type: Grant
    Filed: January 17, 2014
    Date of Patent: February 17, 2015
    Assignee: Panasonic Intellectual Property Corporation of America
    Inventors: Hisao Sasai, Takahiro Nishi, Youji Shibahara, Toshiyasu Sugio, Kyoko Tanikawa, Toru Matsunobu, Kengo Terada
  • Patent number: 8959130
    Abstract: Exponents, mantissas and signs of floating-point numbers are compressed in encoding groups. Differences between maximum exponents of encoding groups are encoded by exponent tokens selected from a code table. Each mantissa of an encoding group is encoded to a mantissa token having a length based on the maximum exponent. Signs are encoded directly or are compressed to produce sign tokens. Exponent tokens, mantissa tokens and sign tokens are packed in a compressed data packet. For decompression, the exponent tokens are decoded using the code table. The decoded exponent difference is added to a previous reconstructed maximum exponent to produce the reconstructed maximum exponent for the encoding group. The reconstructed maximum exponent is used to determine the length of the mantissa tokens that are decoded to produce the reconstructed mantissas for the encoding group. The reconstructed sign, reconstructed exponent and reconstructed mantissa are combined to form a reconstructed floating-point number.
    Type: Grant
    Filed: June 27, 2012
    Date of Patent: February 17, 2015
    Assignee: Altera Corporation
    Inventor: Albert W. Wegener
  • Patent number: 8959129
    Abstract: Compression of exponents, mantissas and signs of floating-point numbers is described. Differences between exponents are encoded by exponent tokens selected from a code table. The mantissa is encoded to a mantissa token having a length based on the exponent. The signs are encoded directly or are compressed to produce fewer sign tokens. The exponent tokens, mantissa tokens and sign tokens are packed in a compressed data packet. Decompression decodes the exponent tokens using the code table. The decoded exponent difference is added to a previous reconstructed exponent to produce the reconstructed exponent. The reconstructed exponent is used to determine the length of the mantissa token. The mantissa token is decoded to form the reconstructed mantissa. The sign tokens provide the reconstructed signs or are decompressed to provide the reconstructed signs. The reconstructed sign, reconstructed exponent and reconstructed mantissa are combined to form a reconstructed floating-point number.
    Type: Grant
    Filed: June 27, 2012
    Date of Patent: February 17, 2015
    Assignee: Altera Corporation
    Inventor: Albert W. Wegener
  • Publication number: 20150019602
    Abstract: A method and as assemblage for post-processing an output of a random source of a random generator are presented. In the method, an output signal of the random source is compressed, thereby yielding a sequence of compressed signal values that are checked in terms of their distribution.
    Type: Application
    Filed: July 7, 2014
    Publication date: January 15, 2015
    Applicant: Robert Bosch GmbH
    Inventors: Matthew LEWIS, Eberhard BOEHL
  • Publication number: 20150019603
    Abstract: In a method for checking an output of a random number generator which includes at least one random source, the frequency of occurrence of at least one bit assignment is counted and established in a correlation with the total number of values which are taken into account.
    Type: Application
    Filed: July 8, 2014
    Publication date: January 15, 2015
    Applicant: Robert Bosch GmbH
    Inventor: Eberhard BOEHL
  • Patent number: 8923634
    Abstract: A decoding method decodes last position information indicating horizontal and vertical positions of a last non-zero coefficient in a predetermined order within a current block to be decoded, the current block including plural coefficients. The decoding includes obtaining a bitstream including first, second, third and fourth partial signals, in this order, performing first arithmetic decoding on the first and the third partial signals respectively to obtain decoded first and decoded third partial signals, performing second arithmetic decoding on the second and the fourth partial signals respectively to obtain decoded second and decoded fourth partial signals, the second arithmetic decoding being different from the first arithmetic decoding, deriving a horizontal component of the last position information from the decoded first and decoded third partial signals, and deriving a vertical component of the last position information from the decoded second and decoded fourth partial signals.
    Type: Grant
    Filed: October 1, 2013
    Date of Patent: December 30, 2014
    Assignee: Panasonic Intellectual Property Corporation of America
    Inventors: Hisao Sasai, Takahiro Nishi, Youji Shibahara, Toshiyasu Sugio, Kyoko Tanikawa, Toru Matsunobu, Kengo Terada
  • Patent number: 8924446
    Abstract: A method for compressing a set of small strings may include calculating n-gram frequencies for a plurality of n-grams over the set of small strings, selecting a subset of n-grams from the plurality of n-grams based on the calculated n-gram frequencies, defining a mapping table that maps each n-gram of the subset of n-grams to a unique code, and compressing the set of small strings by replacing n-grams within each small string in the set of small strings with corresponding unique codes from the mapping table. The method may use linear optimization to select a subset of n-grams that achieves a maximum space saving amount over the set of small strings for inclusion in the mapping table. The unique codes may be variable-length one or two byte codes. The set of small strings may be domain names.
    Type: Grant
    Filed: December 29, 2011
    Date of Patent: December 30, 2014
    Assignee: Verisign, Inc.
    Inventors: Matthew Thomas, Benoit Perroud
  • Patent number: 8918440
    Abstract: Methods and systems for decompressing data are described. The relative magnitudes of a first value and a second value are compared. The first value and the second value represent respective endpoints of a range of values. The first value and the second value each have N bits of precision. Either the first or second value is selected, based on the result of the comparison. The selected value is scaled to produce a third value having N+1 bits of precision. A specified bit value is appended as the least significant bit of the other (non-selected) value to produce a fourth value having N+1 bits of precision.
    Type: Grant
    Filed: December 13, 2011
    Date of Patent: December 23, 2014
    Assignee: NVIDIA Corporation
    Inventors: Douglas H. Rogers, Gary C. King, Walter E. Donovan