LizardTech, Inc. v. Earth Resource Mapping, Inc.

424 F.3d 1336, 76 U.S.P.Q. 2d (BNA) 1724, 2005 U.S. App. LEXIS 21434, 2005 WL 2429824
CourtCourt of Appeals for the Federal Circuit
DecidedOctober 4, 2005
Docket2005-1062
StatusPublished
Cited by114 cases

This text of 424 F.3d 1336 (LizardTech, Inc. v. Earth Resource Mapping, Inc.) is published on Counsel Stack Legal Research, covering Court of Appeals for the Federal Circuit primary law. Counsel Stack provides free access to over 12 million legal documents including statutes, case law, regulations, and constitutions.

Bluebook
LizardTech, Inc. v. Earth Resource Mapping, Inc., 424 F.3d 1336, 76 U.S.P.Q. 2d (BNA) 1724, 2005 U.S. App. LEXIS 21434, 2005 WL 2429824 (Fed. Cir. 2005).

Opinion

BRYSON, Circuit Judge.

LizardTech, Inc., appeals the final judgment of the United States District Court for the Western District of Washington in this patent case. On the motion of defendants Earth Resource Mapping, Inc., and Earth Resource Mapping Pty Ltd. (collectively “ERM”), the district court granted summary judgment, holding that ERM did not infringe U.S. Patent No. 5,710,835 (“the ’835 patent”), and that the patent was invalid. LizardTech, Inc. v. Earth Res. Mapping, Inc., No. C99-1602C, 2000 WL 34502412 (W.D.Wash. March 14, 2004). We affirm.

I

A

The technology at issue in this case involves what are known as “wavelet transforms.” Wavelet transforms allow digital images to be greatly compressed with very little loss of information. In particular, they help in the image compression process because they can be used to transform image data into a form in which it is easier to determine what information in the data is relevant, so that irrelevant and redundant data can be filtered out. See Pankaj N. Topiwala, Introduction to Compression, in Wavelet Image and Video Compression 61, 61-63 (Pankaj N. Topiwala ed., 1998).

For purposes of digital image compression, the most useful type of wavelet transform is what is called a discrete wavelet transform (“DWT”). The DWT of the image can be calculated by repeatedly applying two algorithms to the image using functions known as high-pass and low-pass finite impulse response filters. See A. Jensen & A. la Cour-Harbo, Ripples in Mathematics: The Discrete Wavelet Transform 69 (2001). The high-pass filter contains certain values that change as a function of the distance from the center of the filter, where that distance is measured in terms of the pixels of the to-be-filtered image. Thus, the filter has one value at a distance of one pixel from the center, another value at a distance of two pixels from the center, and so on. The values of the high-pass filter are chosen so that when the filter is applied to the image the small, high-frequency information in the image is retained, while the large, low-frequency information is filtered out. The reverse is true for the low-pass filter. See Pankaj N. Topiwala, Time-Frequency Analysis, Wavelets and Filter Banks, in Wavelet Image and Video Compression 33, 50.

While the task of choosing the high-pass and low-pass filters may be complicated, their application to the image is not. See Time-Frequency Analysis, Wavelets and Filter Banks, supra, at 51-57. The high-pass filter (or, more precisely, the mirror image of what is normally referred to as the high-pass filter) is initially centered on the first pixel in the image. The value of the filter at each pixel along the row of the image that contains the first pixel is then multiplied by the data value of the digital *1338 image of each pixel in that row. The resulting products are added together, and the sum, called the DWT coefficient, is assigned to the original first pixel. The filter is then shifted to be centered on the next pixel in the row, the entire process is repeated, and the second coefficient is derived. That process is repeated to derive coefficients for the entire row of pixels and then for all the pixel rows constituting the image. The same operation is then applied to the original image using the low-pass filter (that is, the mirror image of the low-pass filter) instead of the high-pass filter.

This process generates two coefficients for each pixel. Since no new information is created as a result of this oversampling, the coefficients from every other pixel can be discarded with no loss of information. After completing this “down-sampling,” the same high-pass and low-pass filtering is performed on the down-sampled coefficients in the column direction. Finally, upon down-sampling the results of the filtering in the column direction, three types of coefficients are obtained: those multiplied by a high-pass filter in both directions (“the high-high decomposition”), those multiplied by low-pass filters in both directions (“the low-low decomposition”), and those multiplied by a low-pass filter in one direction and a high-pass filter in the other. Those coefficients can then be easily compressed, resulting in a minor loss of information relating to the original image, but using much less storage space than was necessary to store that image. In practice, the low-low decomposition has most of the relevant information, which is the reason that compression of the image is easier to perform after applying a DWT on the image. See Pankaj N. Topiwala, Wavelet Still Image Coding: A Baseline MSE and HVS Approach, in Wavelet Image and Video Compression 95, 96. However, the fact that the low-low decomposition contains most of the data also means that the entire process can be rerun on the low-low decomposition with a different set of filters, creating three more sets of data. The low-low decomposition of that set can in turn be selected and decomposed. Furthermore, the processes of filtering and down-sampling can be inverted with no loss of information. By using both the final, uncompressed coefficients from the transform and the original filters, the original image can be recreated. Only if the coefficients are compressed is there a loss of information. Additionally, if a low-low decomposition is inverted, it will produce an image that retains all the low-bandpass information of the original image, but is one quarter the size of the original image (or %, %, etc., of the original size depending on how many times transforms have been applied to the low-low decompositions and which of those low-low decompositions is inverted). Therefore, by choosing the appropriate low-low decomposition to invert, images with different resolutions can be created.

One problem with this method of calculating a DWT is that an image has edges, while the filter functions do not. 1 That means that for distances beyond the edge of the image, the product of the filter function and the image data must be set to an artificial value, usually zero. When the coefficients produced by using those artificial values are inverted, the recreated image will often have “defects,” since fake information was used in the process of calculating the DWT.

*1339 A second problem with this method of calculating a DWT on a computer is that the entire image must be placed in the computer’s memory, which can be difficult in the case of very large images. Therefore, prior art computer programs broke up the image into pieces, or “tiles,” and calculated the DWT of each tile separately so that only the data within a single tile needed to be in the computer’s memory at once. However, breaking the image into tiles creates boundaries between the tiles within the image. If the outside of the tiles is artificially set to zero during the DWT process, the product of the filter function and the image data outside the tile will be zero, and a large number of edge artifacts may be created. Reducing edge artifacts while performing a DWT on individual tiles of an image for compression purposes is the object of the ’835 patent.

Free access — add to your briefcase to read the full text and ask questions with AI

Related

Duke University v. Sandoz Inc.
Federal Circuit, 2025
Hyatt v. Matal
District of Columbia, 2018
Hyatt v. Iancu
332 F. Supp. 3d 83 (D.C. Circuit, 2018)
Erfindergemeinschaft UroPep GbR v. Lilly
276 F. Supp. 3d 629 (E.D. Texas, 2017)
Forest Laboratories, LLC v. Sigmapharm Laboratories, LLC
257 F. Supp. 3d 664 (D. Delaware, 2017)
Phigenix, Inc. v. Genentech Inc.
238 F. Supp. 3d 1177 (N.D. California, 2017)
Amgen Inc. v. Sanofi
227 F. Supp. 3d 333 (D. Delaware, 2017)
Driessen v. Sony Music Entertainment
640 F. App'x 892 (Federal Circuit, 2016)
Aar Manufacturing, Inc. v. United States
121 Fed. Cl. 553 (Federal Claims, 2015)
Scriptpro, LLC v. Innovation Associates, Inc.
762 F.3d 1355 (Federal Circuit, 2014)

Cite This Page — Counsel Stack

Bluebook (online)
424 F.3d 1336, 76 U.S.P.Q. 2d (BNA) 1724, 2005 U.S. App. LEXIS 21434, 2005 WL 2429824, Counsel Stack Legal Research, https://law.counselstack.com/opinion/lizardtech-inc-v-earth-resource-mapping-inc-cafc-2005.