×

Data compression using set partitioning in hierarchical trees

  • US 5,764,807 A
  • Filed: 09/14/1995
  • Issued: 06/09/1998
  • Est. Priority Date: 09/14/1995
  • Status: Expired due to Term
First Claim
Patent Images

1. A method for use in encoding and decoding a subband decomposition of a data set, said method comprising the steps of:

  • (a) creating a list (LIS) consisting of insignificant sets of points, each set of said LIS being designated by a root node within said subband decomposition and having a corresponding tree structure of points within said subband decomposition, said corresponding tree structure of points being organized only as descendants and offspring of said root node and not including the root node, wherein a first generation of said descendants comprise said offspring;

    (b) evaluating said descendants of said root node of each set of said LIS for significance, wherein a significant descendent of said descendants of said root node has a coefficient at least equal to a predetermined threshold;

    (c) for each root node of said LIS having at least one significant descendant, evaluating descendants of said offspring of said root node for significance, wherein a significant descendant of said offspring of said root node has a coefficient at least equal to said predetermined threshold; and

    (d) if said root node has at least one significant descendant of offspring, then adding additional sets corresponding to each of said offspring of said root node to said LIS as a root node thereof.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×