US20040071350A1 - Method of compressing an image - Google Patents

Method of compressing an image Download PDF

Info

Publication number
US20040071350A1
US20040071350A1 US10/629,101 US62910103A US2004071350A1 US 20040071350 A1 US20040071350 A1 US 20040071350A1 US 62910103 A US62910103 A US 62910103A US 2004071350 A1 US2004071350 A1 US 2004071350A1
Authority
US
United States
Prior art keywords
image
quadrant
gray scale
quadrants
estimate
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10/629,101
Inventor
Tinku Acharya
Bhargab Bhattacharya
Malay Kundu
Suman Mitra
Chivukula Murthy
Original Assignee
Tinku Acharya
Bhattacharya Bhargab Bikram
Kundu Malay Kumar
Mitra Suman Kumar
Murthy Chivukula A.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to US09/597,354 priority Critical patent/US6738520B1/en
Application filed by Tinku Acharya, Bhattacharya Bhargab Bikram, Kundu Malay Kumar, Mitra Suman Kumar, Murthy Chivukula A. filed Critical Tinku Acharya
Priority to US10/629,101 priority patent/US20040071350A1/en
Publication of US20040071350A1 publication Critical patent/US20040071350A1/en
Application status is Abandoned legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00Image coding
    • G06T9/001Model-based coding, e.g. wire frame

Abstract

Several embodiments in accordance with the invention are disclosed. An embodiment for compressing a gray scale image is described and an embodiment for decompressing the codebook produced by compressing the gray scale image is described. Of course, the invention is not limited to only gray scale images, however.

Description

    BACKGROUND
  • The present disclosure is related to compressing images. [0001]
  • As is well-known, image compression techniques are desirable for a variety of purposes. For example, without limitation, images are compressed for storage and/or for transmission across a communications medium. Desirable aspects of image compression techniques include: occupying less storage space; applicability to a wide variety of images; and/or computationally efficient or fast encoding/decoding. Improvements in image compression that include one or all of these aspects continue to be desirable.[0002]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which: [0003]
  • FIG. 1 is a flowchart illustrating an embodiment of a method of compressing an image in accordance with the present invention; [0004]
  • FIG. 2 is a flowchart illustrating an embodiment of a method of decompressing an image that corresponds to the embodiment of FIG. 1.[0005]
  • DETAILED DESCRIPTION
  • In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present invention. [0006]
  • As previously discussed, image compression is desirable for a number of applications. Furthermore, it is desirable if such compression techniques occupy less storage space, are applicable to a wide variety of images, and/or have an encoding/decoding process that is computationally efficient or fast. [0007]
  • One technique that is sometimes employed in compression, such as in connection with the wavelet transform, or fractal-based compression/decompression, as two examples, involves a multi-resolution decomposition or multi-level division of the image. An embodiment of the present invention, based at least in part on fractal image compression, using an Iterative Function System (IFS), guided by certain probability measures, shall be described in more detail hereinafter. A basic notion of fractal image compression lies in the usage of self-similarity embedded in a given image. Using a set of affine contractive maps, as shall be explained in more detail hereinafter, for example, portions of an image may be reproduced, and by taking a collage of these parts, the entire image may be regenerated. The set of affine contractive maps is referred to in this context as IFS. For a particular embodiment in accordance with the invention, although the invention is not limited in scope in this respect, probabilities are assigned to the maps, which in turn, affect the iteration process, and generate, in this embodiment, a close, approximation of the image, employing a manageable amount of computational complexity or computational burden. A way to conceptualize the multi-level division of the image, then, for this particular embodiment, is as a “divide-and-conquer” approach. Therefore, an image may be subdivided and then the subdivisions may be further subdivided in a recursive fashion to determine how to compress the image efficiently. [0008]
  • An embodiment of compressing an image in accordance with the present invention is one such approach. FIG. 1 is a flowchart illustrating this particular embodiment. It is noted that the invention is not limited in scope to this particular embodiment and many variations are possible within the scope of the present invention. [0009]
  • In this particular embodiment, the image, in this embodiment, a gray scale image, I, is divided into quadrants, here designated I[0010] K, where K is 1, 2, 3, and 4. As shall be described in more detail below, the mean (mK), variance (vK), and probability (pK), for each quadrant is calculated, although the invention is not limited in scope in this respect. Other measures, other than the mean (mK), variance (vK), and probability (pK), may alternatively be employed, as described in more detail hereinafter. The variation in gray scale values for the pixels in each quadrant is measured so that each quadrant is classified as a low variation quadrant or a high variation quadrant in terms of its gray scale levels. A low variation quadrant indicates that the image in that particular quadrant is relatively smooth. Therefore, in this particular embodiment, for a low variation quadrant, the gray scale value at each pixel location is replaced with a single gray scale value estimate for the particular quadrant. Of course, in alternative embodiments, multiple estimates of gray scale values may be employed, instead. For the quadrants of the image that are high variation quadrants, these may be estimated using what is referred to in this context as a contractive map of the image along with the probability (pK), as shall be discussed in more detail. However, if the high variation quadrant may not be accurately estimated using a contractive map of the image, then that particular high variation quadrant is further subdivided and the previous approach is then applied to the subdivisions.
  • Although the invention is not limited in scope to a particular approach to measuring the gray scale variation of a quadrant of an image, in this particular embodiment, the gray scale variation is measured using the statistical variance, v[0011] K, of the gray scale values of a particular quadrant, as indicated above. Then, whether a quadrant qualifies as a low variation quadrant or a high variation quadrant, in this particular embodiment, depends upon the variance of the quadrant measured against a pre-determined threshold value. It is noted that many different approaches to determine a threshold level are possible and the invention is not limited in scope to a particular approach. Likewise, in alternative embodiments, it may be desirable to adjust the threshold depending, at least in part, upon the size of the image or image blocks, or, depending, at least in part, upon the exposure of the particular image, although the invention is also not limited in scope in these respects, as well.
  • In one embodiment, a high variation quadrant is where the statistical variance is above or equal to the pre-determined threshold, and a low variation quadrant is otherwise. In another embodiment, a low variation quadrant is where the statistical variance is below or equal to the predetermined threshold, and a high variation quadrant is otherwise. [0012]
  • Likewise, when replacing a low variation quadrant with an estimate of the gray, scale level for the particular quadrant, many approaches are possible and the invention is not limited in scope to a single approach. Nonetheless, in this particular embodiment, the statistical mean (m[0013] K) of the gray scale values in the particular quadrant are employed, as previously described. Therefore, if a quadrant is a low variation quadrant, each pixel location gray scale value in that quadrant is replaced by the statistically computed mean gray scale value for the quadrant, again, in this particular embodiment.
  • As indicated above, an attempt is made to estimate particular quadrants using a contractive map of the image along with the probability (p[0014] K) In this particular embodiment, the contractive map is formed by considering non-overlapping windows of size two-by-two contiguous pixels over the entire image and summing the four pixels within the window for the particular pixel location. In this context, this is referred to as a spatial summing filter, here, a two-by-two summing filter. Thus, in this particular embodiment, the size of the contractive map of the image becomes the same as the size of a quadrant of the image.
  • It is noted, of course, that alternative approaches to forming a contractive map maybe employed. For example, a window of size three-by-three or perhaps a window of a shape other than a square shape may be employed. Nonetheless, in addition to forming a contractive map, for the particular quadrant, the probability is calculated for the quadrant. In this embodiment, for a quadrant, the probability of the quadrant is the ratio of the sum of the pixel gray scale values over the quadrant to the sum of the pixel gray scale values over the image. This may be illustrated by the following equation. [0015]
  • pK=SK/S,   [1]
  • where S[0016] K is the sum of gray scale values for the pixel locations in quadrant IK of image I, where K=1 to 4, and S is the sum of gray scale values for the pixel locations in I; and
  • ΣpK=1,   [2]
  • where K=1 to 4. [0017]
  • A particular quadrant is then estimated by multiplying the probability of that quadrant times the contractive map of the image, the multiplication being a scalar multiplication of the contractive map. [0018]
  • Once this is complete for-the quadrants of an image, an estimate, I[0019] 1, of the image, I, may be formed by combining the estimates for the quadrants. Another image estimate, I2, is formed by iteratively applying the previous approach, quadrants are estimated using the me an gray scale value and high variation quadrants are estimated using a contractive map of the estimate image, I1, scaled by the probability of the particular quadrant. If this estimate image, I2, is equal to the image it was estimated from, I1, then this recursive estimation process is terminated, and the resulting estimate image, I1, is divided into quadrants that are compared with corresponding quadrants of the original image. Alternatively, if the estimates are not equal, then the new estimate, I2, is treated as the image to be estimated and the previously described approach is recursively repeated until the estimate image, IN+1, equals the image from which it is estimated, IN, after N such iterations.
  • Once an estimate, I[0020] N+1, equals the image from which it is estimated, IN, for each quadrant of the estimate image, IN, low variation quadrants are estimated using mean gray scale values. If the particular quadrant is then “close” to the corresponding quadrant of the original image, I, those quadrants are stored as either the mean gray scale value of the original image, if it was a low variation quadrant, or the probability value for the original image, if it was a high variation quadrant. If all quadrants of the estimate image are close to the original image, compression is complete. However, if some quadrants of the estimate are not close, then those or that quadrant may not be estimated using a mean gray scale value or a contractive map of the image along with the probability (pK) at this particular stage. Therefore, the previous approach, beginning with subdivision into quadrants, is now applied to that or those quadrants of the original image, and that or those quadrants of the original image are treated as described above. In other words, the quadrant or quadrants are treated as the original image in the previous description, divided into four quadrants, and so forth.
  • Referring now to FIG. 1 and flowchart [0021] 100, at block 110, the image is received or input. It is noted that while the input image comprises an image of gray scale levels, this image may comprise a component of a color image, particularly the intensity component. At block 120, of FIG. 1, the image is divided into four equal quadrants, designated here as IK, where K varies from one to four, in this particular embodiment. At block 130, as previously described, for each quadrant IK, calculate the mean, mK, the variance, vK, and the probability, pK, for each quadrant. These may be computed in the manner previously described. At block 140, compare the variance of each quadrant against a threshold value. If all quadrants have a variance are below the threshold value, at blocks 145 and 155, the image compression is complete by storing the mean gray scale for each respective quadrant. However, alternatively, at block 160, instead, the quadrants are estimated using a contractive map, as previously described.
  • Blocks [0022] 170 and 180 refer to an approach where the estimate of the image is formed from the estimate of the quadrants, the previous calculations are repeated and so forth, until two successive image estimates are equal. Once two successive image estimates are equal, low variation quadrants, are estimated using mean gray scale values at block 185. At block 190, the quadrants of the estimate are compared with the quadrants of the original image. At 195, if all of the estimated quadrants are close to the original quadrants, then the entire image is estimated using mean gray scale values and/or probability values, depending on whether a particular quadrant is a low variation quadrant or a high variation quadrant. It is noted, in this context, that any one of a number of different measures may be employed to determine whether the estimate of the quadrant and the corresponding quadrant of the original estimate are “close,” such as mean squared error (MSE) and other approaches. If on the other hand, not all the quadrant estimates are close to the corresponding original image quadrants, then for those quadrants that are close, the estimate of the quadrant is employed, whether the mean or the probability for the particular quadrant and, for those quadrants that are not close, the particular quadrant is treated as an image and is subdivided, at block 120, and so forth. It is noted in this context that for this particular embodiment a quadrant which is estimated and not close to the original image would probably be a high variation quadrant, due to the presence of block 185.
  • FIG. 2 is a flowchart illustrating an embodiment [0023] 200 of a method of decompressing an image, this embodiment corresponding to the embodiment of FIG. 1. Of course, the decompression process or method will, in general, correspond with the particular compression process or method, and, therefore, the invention is not restricted in scope to the decompression embodiment illustrated.
  • This embodiment begins with an arbitrary image, J, having the same dimensions as the image to be decompressed, this arbitrary image having at least one zero pixel gray scale value. Therefore, at block [0024] 210, this image is read or input and the “codebook” of the compressed image is read or input. At block 220, the mean or average value for the compressed image is read from the codebook. At 230, the average value of the arbitrary image is computed. At 240, the arbitrary image is divided into quadrants. At 250, 260, 270, and 280, if the code for each quadrant from the codebook is a mean value, mK, then the image is decompressed using these values as indicated in block 270, and decompression is complete.
  • Otherwise, at blocks [0025] 290, 310, and 320, the probabilities from the codebook are employed with a contractive map of the arbitrary image to form a decompression estimate, J1. This is then repeated using the next level of the codebook to form decompression estimate, J2. If these estimates are not equal, this is continued using the codebook until two successive estimates, JN, and JN+!, are equal, at block 320.
  • If two successive estimates are equal, then, at block [0026] 330, the estimate, JN, is divided into quadrants. If probabilities remain in the codebook, then, at block 340, the corresponding quadrant of JN is treated as the arbitrary image, J, and the process is recursively applied to this image at block 240. Eventually, once no more codes remain for the probability, at block 350, the resulting image is scaled, and, at block 360, the quadrants in which the mean gray scale level has been stored are reconstructed.
  • It will, of course, be understood that, although particular embodiments have just been described, the invention is not limited in scope to a particular embodiment or implementation. For example, one embodiment may be in hardware, whereas another embodiment may be in software. Likewise, an embodiment may be in firmware, or any combination of hardware, software, or firmware, for example. Likewise, although the invention is not limited in scope in this respect, one embodiment may comprise an article, such as a storage medium. Such a storage medium, such as, for example, a CD-ROM, or a disk, may have stored thereon instructions, which when executed by a system, such as a host computer or computing system or platform, or an imaging system, may result in a method of compressing or decompressing an image, such as an image of gray scale values, in accordance with the invention, such as, for example, one of the embodiments previously described. [0027]
  • While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention. [0028]

Claims (24)

1. A method of compressing an image, the image being having gray scale values, comprising:
(a) dividing the image into quadrants;
(b) measuring the gray scale variation in each quadrant so that each quadrant is either a low variation_ quadrant or a high variation quadrant;
(c) replacing any low variation quadrants with an estimate for the particular quadrant;
(d) determining whether any high-variation quadrants can be estimated using a contractive map of the image; and if not, applying (a), (b), (c), and (d) to, the particular one or more high variation quadrants that cannot be estimated by a contractive map of the image.
2. The method of claim 1, wherein the gray scale values comprise the intensity image component of a color image.
3. The method of claim 1, wherein the gray scale variation in each quadrant is measured using the statistical variance of the gray scale values in the particular quadrant.
4. The method of claim 3, wherein a low variation quadrant has a statistical variance below a predetermined threshold value and a high variation quadrant has a statistical variance above or equal to the predetermined threshold.
5. The method of claim 3, wherein a low variation quadrant has a statistical variance below or equal to a predetermined threshold value and a high variation quadrant has a statistical variance above the predetermined threshold.
6. The method of claim 1, wherein the estimate of the particular low variation quadrant comprises the statistical mean of the gray scale values in the particular quadrant.
7. The method of claim 1, wherein the contractive map comprises applying a two-by-two spatial summing filter.
8. The method of claim 7, wherein the high variation quadrant is estimated using a scalar multiple of the contractive map of the image.
9. An article comprising a storage medium having stored thereon instructions, that, when executed by a computing platform, results in compression of an image having gray scale values by:
(a) dividing the; image into quadrants;
(b) measuring the gray scale variation in each quadrant so that each quadrant is either a low variation quadrant or a high variation quadrant;
(c) replacing any low variation quadrants with an estimate for the particular quadrant;
(d) determining whether any high variation quadrants can be estimated using a contractive map of the image; and
if not, applying (a), (b), (c), and (d) to the particular one or more high variation quadrants that cannot be estimated by a contractive map of the image.
10. The article of claim 9, wherein the image having the gray scale values comprises an intensity image component of a color image.
11. The article of claim 9, wherein the gray scale variation in each quadrant is measured using the statistical variance of the gray scale values in the particular quadrant.
12. The article of claim 9, wherein the estimate of the particular low variation quadrant comprises the statistical mean of the gray scale values in the particular quadrant.
13. The article of claim 9, wherein the contractive map comprises applying a two-by-two spatial summing filter.
14. The article of claim 13, wherein the high variation quadrant is estimated using a scalar multiple of the contractive map of the image.
15. A method of decompressing a codebook for a compressed gray scale image comprising:
(a) forming a decompression estimate image from scalar multiples of a contractive map of a previous decompression estimate image, the scalar multiples being provided by the codebook;
(b) if the decompression estimate image and the previous decompression estimate image are equal, then dividing the decompression estimate into quadrants and applying (a), (b), and (c) by treating the quadrants as the previous decompression estimate image until the codebook is empty of scalar multiples to apply;
(c) if the decompression estimate image and the previous decompression estimate image are not equal, apply (a), (b), and (c) by treating the decompression estimate image as the previous decompression estimate image.
16. The method of claim 15, wherein the codebook includes at least one mean gray scale value, and further comprising:
after the codebook is empty of scalar multiples to apply to contractive maps:
scaling the result image based, at least in part, in a mean gray scale value for the compressed gray scale image, and
reconstructing those quadrants for which a mean gray scale level has been stored.
17. The method of claim 16, wherein a previous decompression estimate image comprises an arbitrary image having dimensions of the image being decompressed and having at least one non-zero pixel value.
18. The method of claim 16, wherein the contractive map comprises applying a two-by-two spatial summing filter.
19. An article comprising: a storage medium having stored thereon instructions, that, when executed by a computing platform, results in decompression of codebook for a compressed gray scale image by:
(a) forming a decompression estimate image from scalar multiples of a contractive map of a previous decompression estimate image, the scalar multiples being provided by the codebook;
(b) if the decompression estimate image and the previous decompression estimate image are equal, then dividing the decompression estimate into quadrants and applying (a), (b), and (c) by treating the quadrants as the previous decompression estimate image until the codebook is empty of scalar multiples to apply;
(c) if the decompression estimate image and the previous decompression estimate image are not equal, apply (a), (b), and (c) by treating the decompression estimate image as the previous decompression estimate image.
20. The article of claim 19, wherein the codebook includes at least one mean gray scale value, and wherein the instructions, when executed, further result in:
after the codebook is empty of scalar multiples to apply to contractive maps:
scaling the result image based, at least in part, in a mean gray scale value for the compressed gray scale image, and reconstructing those quadrants for which a mean gray scale level has been stored.
21. The article of claim 19, wherein a previous decompression estimate image comprises an arbitrary image having dimensions of the image being decompressed and having at least one non-zero pixel value.
22. The article of claim 19, wherein the instructions, when executed, further result in the contractive map comprising applying a two-by-two spatial summing filter.
23. A method of compressing an image, the image being having gray scale values, comprising:
(a) dividing the image into quadrants;
(b) determining whether any quadrants can be estimated using a contractive map of the image; and if not, recursively applying (a) and (b) to the particular one or more quadrants that cannot be estimated by a contractive map of the image.
24. The method of claim 23, and further comprising:
measuring the gray scale variation in each quadrant so that each quadrant is either a low variation quadrant or a high variation quadrant;
replacing any low variation quadrants with an estimate for the particular quadrant.
US10/629,101 2000-06-19 2003-07-28 Method of compressing an image Abandoned US20040071350A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US09/597,354 US6738520B1 (en) 2000-06-19 2000-06-19 Method of compressing an image
US10/629,101 US20040071350A1 (en) 2000-06-19 2003-07-28 Method of compressing an image

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10/629,101 US20040071350A1 (en) 2000-06-19 2003-07-28 Method of compressing an image

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/597,354 Continuation US6738520B1 (en) 2000-06-19 2000-06-19 Method of compressing an image

Publications (1)

Publication Number Publication Date
US20040071350A1 true US20040071350A1 (en) 2004-04-15

Family

ID=32070134

Family Applications (2)

Application Number Title Priority Date Filing Date
US09/597,354 Expired - Fee Related US6738520B1 (en) 2000-06-19 2000-06-19 Method of compressing an image
US10/629,101 Abandoned US20040071350A1 (en) 2000-06-19 2003-07-28 Method of compressing an image

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US09/597,354 Expired - Fee Related US6738520B1 (en) 2000-06-19 2000-06-19 Method of compressing an image

Country Status (1)

Country Link
US (2) US6738520B1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030174077A1 (en) * 2000-10-31 2003-09-18 Tinku Acharya Method of performing huffman decoding
US20030210164A1 (en) * 2000-10-31 2003-11-13 Tinku Acharya Method of generating Huffman code length information

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2794269B1 (en) * 1999-05-26 2001-08-17 France Telecom image coding Method, a triangular partition and reversible transformation, and method of decoding corresponding
FR2794329B1 (en) * 1999-05-26 2001-08-17 France Telecom A hierarchical coding of images, a selective implementation of a coding-based reversible transformation, and corresponding method of decoding
US6870961B2 (en) * 2000-11-10 2005-03-22 Ricoh Company, Ltd. Image decompression from transform coefficients
US9286643B2 (en) 2011-03-01 2016-03-15 Applaud, Llc Personalized memory compilation for members of a group and collaborative method to build a memory compilation
US9030572B2 (en) 2012-12-04 2015-05-12 Samsung Techwin Co., Ltd. Apparatus, method, and program for processing image

Citations (43)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4941193A (en) * 1987-10-02 1990-07-10 Iterated Systems, Inc. Methods and apparatus for image compression by iterated function system
US5065447A (en) * 1989-07-05 1991-11-12 Iterated Systems, Inc. Method and apparatus for processing digital data
US5416856A (en) * 1992-03-30 1995-05-16 The United States Of America As Represented By The Secretary Of The Navy Method of encoding a digital image using iterated image transformations to form an eventually contractive map
US5592228A (en) * 1993-03-04 1997-01-07 Kabushiki Kaisha Toshiba Video encoder using global motion estimation and polygonal patch motion estimation
US5600731A (en) * 1991-05-09 1997-02-04 Eastman Kodak Company Method for temporally adaptive filtering of frames of a noisy image sequence using motion estimation
US5724451A (en) * 1994-09-27 1998-03-03 Samsung Electronics Co., Ltd. Image compression method and apparatus using conditional quadtree split sysyem
US5740282A (en) * 1995-06-30 1998-04-14 Iterated Systems, Inc. System and method for contractive mapping resynchronization of a data transmission
US5778098A (en) * 1996-03-22 1998-07-07 Microsoft Corporation Sprite coding
US5832115A (en) * 1997-01-02 1998-11-03 Lucent Technologies Inc. Ternary image templates for improved semantic compression
US5862262A (en) * 1992-03-30 1999-01-19 The United States Of America As Represented By The Secretary Of The Navy Method of encoding a digital image using adaptive partitioning in an iterated transformation system
US5867221A (en) * 1996-03-29 1999-02-02 Interated Systems, Inc. Method and system for the fractal compression of data using an integrated circuit for discrete cosine transform compression/decompression
US5875122A (en) * 1996-12-17 1999-02-23 Intel Corporation Integrated systolic architecture for decomposition and reconstruction of signals using wavelet transforms
US5978030A (en) * 1995-03-18 1999-11-02 Daewoo Electronics Co., Ltd. Method and apparatus for encoding a video signal using feature point based motion estimation
US5982441A (en) * 1996-01-12 1999-11-09 Iterated Systems, Inc. System and method for representing a video sequence
US5995210A (en) * 1998-08-06 1999-11-30 Intel Corporation Integrated architecture for computing a forward and inverse discrete wavelet transforms
US6009210A (en) * 1997-03-05 1999-12-28 Digital Equipment Corporation Hands-free interface to a virtual reality environment using head tracking
US6009206A (en) * 1997-09-30 1999-12-28 Intel Corporation Companding algorithm to transform an image to a lower bit resolution
US6009201A (en) * 1997-06-30 1999-12-28 Intel Corporation Efficient table-lookup based visually-lossless image compression scheme
US6044168A (en) * 1996-11-25 2000-03-28 Texas Instruments Incorporated Model based faced coding and decoding using feature detection and eigenface coding
US6047303A (en) * 1998-08-06 2000-04-04 Intel Corporation Systolic architecture for computing an inverse discrete wavelet transforms
US6091851A (en) * 1997-11-03 2000-07-18 Intel Corporation Efficient algorithm for color recovery from 8-bit to 24-bit color pixels
US6094508A (en) * 1997-12-08 2000-07-25 Intel Corporation Perceptual thresholding for gradient-based local edge detection
US6108453A (en) * 1998-09-16 2000-08-22 Intel Corporation General image enhancement framework
US6124811A (en) * 1998-07-02 2000-09-26 Intel Corporation Real time algorithms and architectures for coding images compressed by DWT-based techniques
US6130960A (en) * 1997-11-03 2000-10-10 Intel Corporation Block-matching algorithm for color interpolation
US6151415A (en) * 1998-12-14 2000-11-21 Intel Corporation Auto-focusing algorithm using discrete wavelet transform
US6151069A (en) * 1997-11-03 2000-11-21 Intel Corporation Dual mode digital camera for video and still operation
US6154493A (en) * 1998-05-21 2000-11-28 Intel Corporation Compression of color images based on a 2-dimensional discrete wavelet transform yielding a perceptually lossless image
US6157747A (en) * 1997-08-01 2000-12-05 Microsoft Corporation 3-dimensional image rotation method and apparatus for producing image mosaics
US6166664A (en) * 1998-08-26 2000-12-26 Intel Corporation Efficient data structure for entropy encoding used in a DWT-based high performance image compression
US6178269B1 (en) * 1998-08-06 2001-01-23 Intel Corporation Architecture for computing a two-dimensional discrete wavelet transform
US6195026B1 (en) * 1998-09-14 2001-02-27 Intel Corporation MMX optimized data packing methodology for zero run length and variable length entropy encoding
US6215916B1 (en) * 1998-02-04 2001-04-10 Intel Corporation Efficient algorithm and architecture for image scaling using discrete wavelet transforms
US6215908B1 (en) * 1999-02-24 2001-04-10 Intel Corporation Symmetric filtering based VLSI architecture for image compression
US6229578B1 (en) * 1997-12-08 2001-05-08 Intel Corporation Edge-detection based noise removal algorithm
US6233358B1 (en) * 1998-07-13 2001-05-15 Intel Corporation Image compression using directional predictive coding of the wavelet coefficients
US6236433B1 (en) * 1998-09-29 2001-05-22 Intel Corporation Scaling algorithm for efficient color representation/recovery in video
US6236765B1 (en) * 1998-08-05 2001-05-22 Intel Corporation DWT-based up-sampling algorithm suitable for image display in an LCD panel
US6275206B1 (en) * 1999-03-17 2001-08-14 Intel Corporation Block mapping based up-sampling method and apparatus for converting color images
US6285796B1 (en) * 1997-11-03 2001-09-04 Intel Corporation Pseudo-fixed length image compression scheme
US6292114B1 (en) * 1999-06-10 2001-09-18 Intel Corporation Efficient memory mapping of a huffman coded list suitable for bit-serial decoding
US6301370B1 (en) * 1998-04-13 2001-10-09 Eyematic Interfaces, Inc. Face recognition from video images
US6516093B1 (en) * 1996-05-06 2003-02-04 Koninklijke Philips Electronics N.V. Segmented video coding and decoding method and system

Patent Citations (45)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4941193A (en) * 1987-10-02 1990-07-10 Iterated Systems, Inc. Methods and apparatus for image compression by iterated function system
US5065447A (en) * 1989-07-05 1991-11-12 Iterated Systems, Inc. Method and apparatus for processing digital data
US5347600A (en) * 1989-07-05 1994-09-13 Interated Systems, Inc. Method and apparatus for compression and decompression of digital image data
US5600731A (en) * 1991-05-09 1997-02-04 Eastman Kodak Company Method for temporally adaptive filtering of frames of a noisy image sequence using motion estimation
US5416856A (en) * 1992-03-30 1995-05-16 The United States Of America As Represented By The Secretary Of The Navy Method of encoding a digital image using iterated image transformations to form an eventually contractive map
US5862262A (en) * 1992-03-30 1999-01-19 The United States Of America As Represented By The Secretary Of The Navy Method of encoding a digital image using adaptive partitioning in an iterated transformation system
US5592228A (en) * 1993-03-04 1997-01-07 Kabushiki Kaisha Toshiba Video encoder using global motion estimation and polygonal patch motion estimation
US5724451A (en) * 1994-09-27 1998-03-03 Samsung Electronics Co., Ltd. Image compression method and apparatus using conditional quadtree split sysyem
US5978030A (en) * 1995-03-18 1999-11-02 Daewoo Electronics Co., Ltd. Method and apparatus for encoding a video signal using feature point based motion estimation
US5740282A (en) * 1995-06-30 1998-04-14 Iterated Systems, Inc. System and method for contractive mapping resynchronization of a data transmission
US5982441A (en) * 1996-01-12 1999-11-09 Iterated Systems, Inc. System and method for representing a video sequence
US5778098A (en) * 1996-03-22 1998-07-07 Microsoft Corporation Sprite coding
US5867221A (en) * 1996-03-29 1999-02-02 Interated Systems, Inc. Method and system for the fractal compression of data using an integrated circuit for discrete cosine transform compression/decompression
US6516093B1 (en) * 1996-05-06 2003-02-04 Koninklijke Philips Electronics N.V. Segmented video coding and decoding method and system
US6044168A (en) * 1996-11-25 2000-03-28 Texas Instruments Incorporated Model based faced coding and decoding using feature detection and eigenface coding
US5875122A (en) * 1996-12-17 1999-02-23 Intel Corporation Integrated systolic architecture for decomposition and reconstruction of signals using wavelet transforms
US5832115A (en) * 1997-01-02 1998-11-03 Lucent Technologies Inc. Ternary image templates for improved semantic compression
US6009210A (en) * 1997-03-05 1999-12-28 Digital Equipment Corporation Hands-free interface to a virtual reality environment using head tracking
US6009201A (en) * 1997-06-30 1999-12-28 Intel Corporation Efficient table-lookup based visually-lossless image compression scheme
US6157747A (en) * 1997-08-01 2000-12-05 Microsoft Corporation 3-dimensional image rotation method and apparatus for producing image mosaics
US6009206A (en) * 1997-09-30 1999-12-28 Intel Corporation Companding algorithm to transform an image to a lower bit resolution
US6091851A (en) * 1997-11-03 2000-07-18 Intel Corporation Efficient algorithm for color recovery from 8-bit to 24-bit color pixels
US6285796B1 (en) * 1997-11-03 2001-09-04 Intel Corporation Pseudo-fixed length image compression scheme
US6130960A (en) * 1997-11-03 2000-10-10 Intel Corporation Block-matching algorithm for color interpolation
US6151069A (en) * 1997-11-03 2000-11-21 Intel Corporation Dual mode digital camera for video and still operation
US6269181B1 (en) * 1997-11-03 2001-07-31 Intel Corporation Efficient algorithm for color recovery from 8-bit to 24-bit color pixels
US6094508A (en) * 1997-12-08 2000-07-25 Intel Corporation Perceptual thresholding for gradient-based local edge detection
US6229578B1 (en) * 1997-12-08 2001-05-08 Intel Corporation Edge-detection based noise removal algorithm
US6215916B1 (en) * 1998-02-04 2001-04-10 Intel Corporation Efficient algorithm and architecture for image scaling using discrete wavelet transforms
US6301370B1 (en) * 1998-04-13 2001-10-09 Eyematic Interfaces, Inc. Face recognition from video images
US6154493A (en) * 1998-05-21 2000-11-28 Intel Corporation Compression of color images based on a 2-dimensional discrete wavelet transform yielding a perceptually lossless image
US6124811A (en) * 1998-07-02 2000-09-26 Intel Corporation Real time algorithms and architectures for coding images compressed by DWT-based techniques
US6233358B1 (en) * 1998-07-13 2001-05-15 Intel Corporation Image compression using directional predictive coding of the wavelet coefficients
US6236765B1 (en) * 1998-08-05 2001-05-22 Intel Corporation DWT-based up-sampling algorithm suitable for image display in an LCD panel
US5995210A (en) * 1998-08-06 1999-11-30 Intel Corporation Integrated architecture for computing a forward and inverse discrete wavelet transforms
US6178269B1 (en) * 1998-08-06 2001-01-23 Intel Corporation Architecture for computing a two-dimensional discrete wavelet transform
US6047303A (en) * 1998-08-06 2000-04-04 Intel Corporation Systolic architecture for computing an inverse discrete wavelet transforms
US6166664A (en) * 1998-08-26 2000-12-26 Intel Corporation Efficient data structure for entropy encoding used in a DWT-based high performance image compression
US6195026B1 (en) * 1998-09-14 2001-02-27 Intel Corporation MMX optimized data packing methodology for zero run length and variable length entropy encoding
US6108453A (en) * 1998-09-16 2000-08-22 Intel Corporation General image enhancement framework
US6236433B1 (en) * 1998-09-29 2001-05-22 Intel Corporation Scaling algorithm for efficient color representation/recovery in video
US6151415A (en) * 1998-12-14 2000-11-21 Intel Corporation Auto-focusing algorithm using discrete wavelet transform
US6215908B1 (en) * 1999-02-24 2001-04-10 Intel Corporation Symmetric filtering based VLSI architecture for image compression
US6275206B1 (en) * 1999-03-17 2001-08-14 Intel Corporation Block mapping based up-sampling method and apparatus for converting color images
US6292114B1 (en) * 1999-06-10 2001-09-18 Intel Corporation Efficient memory mapping of a huffman coded list suitable for bit-serial decoding

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030174077A1 (en) * 2000-10-31 2003-09-18 Tinku Acharya Method of performing huffman decoding
US20030210164A1 (en) * 2000-10-31 2003-11-13 Tinku Acharya Method of generating Huffman code length information
US20060087460A1 (en) * 2000-10-31 2006-04-27 Tinku Acharya Method of generating Huffman code length information

Also Published As

Publication number Publication date
US6738520B1 (en) 2004-05-18

Similar Documents

Publication Publication Date Title
Saito Simultaneous noise suppression and signal compression using a library of orthonormal bases and the minimum description length criterion
Lee et al. Fast fractal image block coding based on local variances
US6792155B2 (en) Reversible DCT for lossless—lossy compression
CN1173580C (en) Image decoding method
USRE42272E1 (en) Dictionary generation method for video and image compression
Roos et al. Reversible intraframe compression of medical images
US7286711B2 (en) Compression of partially-masked image data
US6141446A (en) Compression and decompression system with reversible wavelets and lossy reconstruction
US5629780A (en) Image data compression having minimum perceptual error
US5615287A (en) Image compression technique
USRE36380E (en) Orthogonal transform coding apparatus
US20040042675A1 (en) Image coding and decoding apparatus, method of image coding and decoding, and recording medium for recording program for image coding and decoding
Secker et al. Highly scalable video compression with scalable motion coding
EP2063644A2 (en) Image encoding device and encoding method, and image decoding device and decoding method
JP3933691B2 (en) Hybrid waveform and model-based encoding and decoding of image signals
US6950473B2 (en) Hybrid technique for reducing blocking and ringing artifacts in low-bit-rate coding
JP3976876B2 (en) Image compression method
US5886651A (en) System and method for nested split coding of sparse data sets
US5422963A (en) Block transform coder for arbitrarily shaped image segments
US20020051560A1 (en) Method for the prior monitoring of the detectability of a watermarking signal
US5293434A (en) Technique for use in a transform coder for imparting robustness to compressed image data through use of global block transformations
Gilge et al. Coding of arbitrarily shaped image segments based on a generalized orthogonal transform
US5426512A (en) Image data compression having minimum perceptual error
Watson DCT quantization matrices visually optimized for individual images
KR20010071881A (en) Image compression using directional predictive coding of the wavelet coefficients

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION