Please download the dossier by clicking on the dossier button x
×

Zero-search, zero-memory vector quantization

  • US 7,729,910 B2
  • Filed: 06/25/2004
  • Issued: 06/01/2010
  • Est. Priority Date: 06/26/2003
  • Status: Active Grant
First Claim
Patent Images

1. A computer-implemented method for data compression comprising the steps of:

  • establishing an implicit codebook comprising an implicitly defined set of vectors, hereafter called code points, which are symmetrically placed with respect to the origin;

    said code points implicitly represented by a hypercube radius vector α

    =<

    α

    1

    2, . . . ,α

    D>

    , wherein said code points are used for representing information elements;

    said information elements constituting data to be compressed, and said information elements also being vectors; and

    computing a compression function for said information elements by;

    inspecting the signs of said information elements to determine in which orthant said information element lies, thereby determining the implicit code point of the implicit codebook to represent said information element; and

    determining an index of the associated implicit code point so selected for said information element; and

    compressing said information elements by application of said compression function.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×