USRE40081E1  Fast signal transforms with lifting steps  Google Patents
Fast signal transforms with lifting steps Download PDFInfo
 Publication number
 USRE40081E1 USRE40081E1 US10629303 US62930303A USRE40081E1 US RE40081 E1 USRE40081 E1 US RE40081E1 US 10629303 US10629303 US 10629303 US 62930303 A US62930303 A US 62930303A US RE40081 E1 USRE40081 E1 US RE40081E1
 Authority
 US
 Grant status
 Grant
 Patent type
 Prior art keywords
 transform
 lifting
 coefficients
 steps
 rational
 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.)
 Active  Reinstated
Links
Images
Classifications

 G—PHYSICS
 G06—COMPUTING; CALCULATING; COUNTING
 G06F—ELECTRICAL DIGITAL DATA PROCESSING
 G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
 G06F17/10—Complex mathematical operations
 G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, KarhunenLoeve, transforms
 G06F17/147—Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
 H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
 H04N19/103—Selection of coding mode or of prediction mode
 H04N19/114—Adapting the group of pictures [GOP] structure, e.g. number of Bframes between two anchor frames

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
 H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using subband based transform, e.g. wavelets

 H—ELECTRICITY
 H04—ELECTRIC COMMUNICATION TECHNIQUE
 H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
 H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
 H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
 H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using subband based transform, e.g. wavelets
 H04N19/635—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using subband based transform, e.g. wavelets characterised by filter definition or implementation details
Abstract
Description
More than one reissue application has been filed for the reissue of U.S. Pat. No. 6,421,464. The Instant Reissue application Ser. No. 10/629,303 filed Jul. 29, 2003 and U.S. application Ser. No. 11/896,522, filed Sep. 4, 2007 which is a Continuation of U.S. Reissue application Ser. No. 10/629,303.
The current invention relates to the processing of images such as photographs, drawings, and other two dimensional displays. It further relates to the processing of such images which are captured in digital format or after they have been converted to or expressed in digital format. This invention further relates to use of novel coding methods to increase the speed and compression ratio for digital image storage and transmission while avoiding introduction of undesirable artifacts into the reconstructed images.
In general, image processing is the analysis and manipulation of twodimensional representations, which can comprise photographs, drawings, paintings, blueprints, xrays of medical patients, or indeed abstract art or artistic patterns. These images are all twodimensional arrays of information. Until fairly recently, images have comprised almost exclusively analog displays of analog information, for example, conventional photographs and motion pictures. Even the signals encoding television pictures, notwithstanding that the vertical scan comprises a finite number of lines, are fundamentally analog in nature.
Beginning in the early 1960's, images began to be captured or converted and stored as twodimensional digital data, and digital image processing followed. At first, images were recorded or transmitted in analog form and then converted to digital representation for manipulation on a computer. Currently digital capture and transmission are on their way to dominance, in part because of the advent of charge coupled device (CCD) image recording arrays and in part because of the availability of inexpensive high speed computers to store and manipulate images.
An important task of image processing is the correction or enhancement of a particular image. For example, digital enhancement of images of celestial objects taken by space probes has provided substantial scientific information. However, the current invention relates primarily to compression for transmission or storage of digital images and not to enhancement.
One of the problems with digital images is that a complete single image frame can require up to several megabytes of storage space or transmission bandwidth. That is, one of today's 3½ inch floppy discs can hold at best a little more than one grayscale frame and sometimes substantially less than one whole frame. A fullpage color picture, for example, uncompressed, can occupy 30 megabytes of storage space. Storing or transmitting the vast amounts of data which would be required for realtime uncompressed high resolution digital video is technologically daunting and virtually impossible for many important communication channels, such as the telephone line. The transmission of digital images from space probes can take many hours or even days if insufficiently compressed images are involved. Accordingly, there has been a decades long effort to develop methods of extracting from images the information essential to an aesthetically pleasing or scientifically useful picture without degrading the image quality too much and especially without introducing unsightly or confusing artifacts into the image.
The basic approach has usually involved some form of coding of picture intensities coupled with quantization. One approach is block coding; another approach, mathematically equivalent with proper phasing, is multiphase filter banks. Frequency based multiband transforms have long found application in image coding. For instance, the JPEG image compression standard, W. B. Pennebaker and J. L. Mitchell, “JPEG: Still Image Compression Standard,” Van Nostrand Reinhold, 1993, employs the 8×8 discrete cosine transform (DCT) at its transformation stage. At high bit rates, JPEG offers almost lossless reconstructed image quality. However, when more compression is needed, annoying blocking artifacts appear since the DCT bases are short and do not overlap, creating discontinuities at block boundaries.
The wavelet transform, on the other hand, with long, varyinglength, and overlapping bases, has elegantly solved the blocking problem. However, the transform's computational complexity can be significantly higher than that of the DCT. This complexity gap is partly in terms of the number of arithmetical operations involved, but more importantly, in terms of the memory buffer space required. In particular, some implementations of the wavelet transform require many more operations per output coefficient as well as a large buffer.
An interesting alternative to wavelets is the lapped transform, e.g., H. S. Malvar, Signal Processing with Lapped Transforms, Artech House, 1992, where pixels from adjacent blocks are utilized in the calculation of transform coefficients for the working block. The lapped transforms outperform the DCT on two counts: (i) from the analysis viewpoint, they take into account interblock correlation and hence provide better energy compaction; (ii) from the synthesis viewpoint, their overlapping basis functions decay asymptotically to zero at the ends, reducing blocking discontinuities dramatically.
Nevertheless, lapped transforms have not yet been able to supplant the unadorned DCT in international standard coding routines. The principal reason is that the modest improvement in coding performance available up to now has not been sufficient to justify the significant increase in computational complexity. In the prior art, therefore, lapped transforms remained too computationally complex for the benefits they provided. In particular, the previous lapped transformed somewhat reduced but did not eliminate the annoying blocking artifacts.
It is therefore an object of the current invention to provide a new transform which is simple and fast enough to replace the bare DCT in international standards, in particular in JPEG and MPEGlike coding standards. It is another object of this invention to provide an image transform which has overlapping basis functions so as to avoid blocking artifacts. It is a further object of this invention to provide a lapped transform which is approximately as fast as, but more efficient for compression than, the bare DCT. It is yet another object of this invention to provide dramatically improved speed and efficiency using a lapped transform with lifting steps in a butterfly structure with dyadicrational coefficients. It is yet a further object of this invention to provide a transform structure such that for a negligible complexity surplus over the bare DCT a dramatic coding performance gain can be obtained both from a subjective and objective point of view while blocking artifacts are completely eliminated.
In the current invention, we use a family of lapped biorthogonal transforms implementing a small number of dyadicrational lifting steps. The resulting transform, called the LiftLT, not only has high computation speed but is wellsuited to implementation via VLSI.
Moreover, it also consistently outperforms stateoftheart wavelet based coding systems in coding performance when the same quantizer and entropy coder are used. The LiftLT is a lapped biorthogonal transform using lifting steps in a modular lattice structure, the result of which is a fast, efficient, and robust encoding system. With only 1 more multiplication (which can also be implemented with shiftandadd operations), 22 more additions, and 4 more delay elements compared to the bare DCT, the LiftLT offers a fast, lowcost approach capable of straightforward VLSI implementation while providing reconstructed images which are high in quality, both objectively and subjectively. Despite its simplicity, the LiftLT provides a significant improvement in reconstructed image quality over the traditional DCT in that blocking is completely eliminated while at medium and high compression ratios ringing artifacts are reasonably contained. The performance of the LiftLT surpasses even that of the wellknown 9/7tap biorthogonal wavelet transform with irrational coefficients. The LiftLT's blockbased structure also provides several other advantages: supporting parallel processing mode, facilitating regionofinterest coding and decoding, and processing large images under severe memory constraints.
Most generally, the current invention is an apparatus for block coding of windows of digitally represented images comprising a chain of lattices of lapped transforms with dyadic rational lifting steps. More particularly, this invention is a system of electronic devices which codes, stores or transmits, and decodes M×M sized blocks of digitally represented images, where M is an even number. The main block transform structure comprises a transform having M channels numbered 0 through M−1, half of said channel numbers being odd and half being even; a normalizer with a dyadic rational normalization factor in each of said M channels; two lifting steps with a first set of identical dyadic rational coefficients connecting each pair of adjacent numbered channels in a butterfly configuration, M/2 delay lines in the odd numbered channels; two inverse lifting steps with the first set of dyadic rational coefficients connecting each pair of adjacent numbered channels in a butterfly configuration; and two lifting steps with a second set of identical dyadic rational coefficients connecting each pair of adjacent odd numbered channels; means for transmission or storage of the transform output coefficients; and an inverse transform comprising M channels numbered 0 through M−1, half of said channel numbers being odd and half being even; two inverse lifting steps with dyadic rational coefficients connecting each pair of adjacent odd numbered channels; two lifting steps with dyadic rational coefficients connecting each pair of adjacent numbered channels in a butterfly configuration; M/2 delay lines in the even numbered channels; two inverse lifting steps with dyadic rational coefficients connecting each pair of adjacent numbered channels in a butterfly configuration; a denormalizer with a dyadic rational inverse normalization factor in each of said M channels; and a base inverse transform having M channels numbered 0 through M−1.
Typically, a block transform for image processing is applied to a block (or window) of, for example, 8×8 group of pixels and the process is iterated over the entire image. A biorthogonal transform in a block coder uses as a decomposition basis a complete set of basis vectors, similar to an orthogonal basis. However, the basis vectors are more general in that they may not be orthogonal to all other basis vectors. The restriction is that there is a “dual” basis to the original biorthogonal basis such that every vector in the original basis has a “dual” vector in the dual basis to which it is orthogonal. The basic idea of combining the concepts of biorthogonality and lapped transforms has already appeared in the prior art. The most general lattice for Mchannel linear phase lapped biorthogonal transforms is presented in T. D. Tran, R. de Queiroz, and T. Q. Nguyen, “The generalized lapped biorthogonal transform,” ICASSP, pp. 14411444, Seattle, May 1998, and in T. D. Tran, R. L. de Queiroz, and T. Q. Nguyen, “Linear phase perfect reconstruction filter bank: lattice structure, design, and application in image coding” (submitted to EEE Trans. on Signal Processing, April 1998). A signal processing flow diagram of this wellknown generalized filter bank is shown in FIG. 2.
In the current invention, which we call the Fast LiftLT, we apply lapped transforms based on using fast lifting steps in an Mchannel uniform linearphase perfect reconstruction filter bank, according to the generic polyphase representation of FIG. 1. In the lapped biorthogonal approach, the polyphase matrix E(z) can be factorized as
In these equations, I is the identity matrix, and J is the matrix with 1's on the antidiagonal.
The transform decomposition expressed by equations (1) through (3) is readily represented, as shown in
U_{i}=U_{i0}Γ_{i}U_{i1}, V_{i}=V_{i0}Δ_{i}V_{i1}
where U_{i0}, U_{i1}, V_{i0}, V_{i1 }are diagonalizing orthogonal matrices and Γ_{i}, Δ_{i }are diagonal matrices with positive elements.
It is well known that any M/2×M/2 orthogonal matrix can be factorized into M(M−2)/8 plane rotations θ_{i }and that the diagonal matrices represent simply scaling factors α_{i}. Accordingly, the most general LT lattice consists of KM(M−2)/2 two dimensional rotations and 2M diagonal scaling factors α_{i}. Any invertible matrix can be expressed as a sequence of pairwise plane rotations θ and scaling factors α_{i }as shown in FIG. 3.
It is also well known that a plane rotation can be performed by 3 “shears”:
This can be easily verified by computation
Each of the factors above is capable of a “lifting” step in signal processing terminology. The product of two which effects a linear transform of pairs of coefficients:
The signal processing flow diagram of this operation is shown in FIG. 4. The crossing arrangement of these flow paths is also referred to as a butterfly configuration. Each of the above “shears” can be written as a lifting step.
Combining the foregoing, the shears referred to can be expressed as computationally equivalent “lifting steps” in signal processing. In other words, we can replace each “rotation” by 3 closelyrelated lifting steps with butterfly structure. It is possible therefore to implement the complete LT lattice shown in
In the simplest but currently preferred embodiment, to minimize the complexity of the transform we choose a small overlapping factor K=2 and set the initial stage E_{0 }to be the DCT itself Many other coding transforms can serve for the base stage instead of the DCT, and it should be recognized that many other embodiments are possible and can be implemented by one skilled in the art of signal processing.
Following the observation in H. S. Malvar, “Lapped biorthogonal transforms for transform coding with reduced blocking and ringing artifacts,” ICASSP97, Munich, April 1997, we apply a scaling factor to the first DCT's antisymmetric basis to generate synthesis LT basis functions whose end values decay smoothly to exact zero—a crucial advantage in blocking artifacts elimination. However, instead of scaling the analysis by √{square root over (2)} and the synthesis by 1/√{square root over (2)}, we opt for 25/16 and its inverse 16/25 since they allow the implementation of both analysis and synthesis banks in integer arithmetic. Another value that works almost as well as 25/16 is 5/4. To summarize, the following choices are made in the first stage: the combination of U_{00 }and V_{00 }with the previous butterfly form the DCT;
and Γ_{o}=U_{00}=V_{00}=I_{M/2}. See FIG. 2.
After 2 series of ±1 butterflies W and the delay chain Λ(z), the LT symmetric basis functions already have good attenuation, especially at DC (ω=0). Hence, we can comfortably set U_{1}=I_{M/2}.
As noted, V_{1 }is factorizable into a series of lifting steps and diagonal scalings. However, there are several problems: (i) the large number of lifting steps is costly in both speed and physical realestate in VLSI implementation; (ii) the lifting steps are related; (iii) and it is not immediately obvious what choices of rotation angles will result in dyadic rational lifting multipliers. In the current invention, we approximate V_{1 }by (M/2)−1 combinations of blockdiagonal predictandupdate lifting steps, i.e.,
Here, the free parameters u_{i }and p_{i }can be chosen arbitrarily and independently without affecting perfect reconstruction. The inverses are trivially obtained by switching the order and the sign of the lifting steps. Unlike popular lifting implementations of various wavelets, all of our lifting steps are of zeroorder, namely operating in the same time epoch. In other words, we simply use a series of 2×2 upper or lower diagonal matrices to parameterize the invertible matrix V_{1}.
Most importantly, fastcomputable VLSIfriendly transforms are readily available when u_{i }and p_{i }are restricted to dyadic rational values, that is, rational fractions having (preferably small) powers of 2 denominators. With such coefficients, transform operations can for the most part be reduced to a small number of shifts and adds. In particular, setting all of the approximating lifting step coefficients to −1/2 yields a very fast and elegant lapped transform. With this choice, each lifting step can be implemented using only one simple bit shift and one addition.
The resulting LiftLT lattice structures are presented in
The inverse or synthesis lattice is shown in FIG. 6. This system comprises a set of four fast dyadic lifting steps 11, a butterflystructured set of lifting steps 12, a delay line 13 on four of the eight channels, 16/25 inverse normalization 14, and an inverse DCT block 15.
The LiftLT is sufficiently fast for many applications, especially in hardware, since most of the incrementally added computation comes from the 2 butterflies and the 6 shiftandadd lifting steps. It is faster than the typeI fast LOT described in H. S. Malvar, Signal Processing with Lapped Transforms, Artech House, 1992. Besides its low complexity, the LiftLT possesses many characteristics of a highperformance transform in image compression: (i) it has high energy compaction due to a high coding gain and a low attenuation near DC where most of the image energy is concentrated; (ii) its synthesis basis functions also decay smoothly to zero, resulting in blockingfree reconstructed images.
Comparisons of complexity and performance between the LiftLT and other popular transforms are tabulated in Table 1 and Table 2. The LiftLT's performance is already very close to that of the optimal generalized lapped biorthogonal transform, while its complexity is the lowest amongst the transforms except for the DCT.
To assess the new method in image coding, we compared images coded and decoded with four different transforms:

 DCT: 8channel, 8tap filters
 TypeI Fast LOT: 8channel, 16tap filters
 LiftLT: 8channel, 16tap filters
 Wavelet: 9/7tap biorthogonal.
In this comparison, we use the same SPIHT's quantizer and entropy coder, A. Said and W. A. Pearlman, “A new fast and efficient image coder based on set partitioning in hierarchical trees,” IEEE Trans on Circuits Syst. Video Tech., vol. 6, pp. 243250, June 1996, for every transform. In the blocktransform cases, we use the modified zerotree structure in T. D. Tran and T. Q. Nguyen, “A lapped transform embedded image coder,” ISCAS, Monterey, May 1998, where each block of transform coefficients is treated analogously to a full wavelet tree and three more levels of decomposition are employed to decorrelate the DC subband further.
Table 1 contains a comparison of the complexity of these four coding systems, comparing numbers of operations needed per 8 transform coefficients:
No.  
Transform  Multiplications  No. Additions  No. Shifts 
8 × 8 DCT  13  29  0 
8 × 16 TypeI Fast LOT  22  54  0 
917 Wavelet, 1level  36  56  0 
8 × 6 Fast LiftLT  14  51  6 
In such a comparison, the number of multiplication operations dominates the “cost” of the transform in terms of computing resources and time, and number of additions and number of shifts have negligible effect. In this table, it is clear that the fast LiftLT is almost as low as the DCT in complexity and more than twice as efficient as the wavelet transform.
Table 2 sets forth a number of different performance measures for each of the four methods:
DC  Stopband  
Coding  Atten.  Atten.  Mir. Freq.  
Transform  Gain (dB)  (−dB)  (−dB)  Atten. (−dB) 
8 × 8 DCT  8.83  310.62  9.96  322.1 
8 × 16 TypeI Fast LOT  9.2  309.04  17.32  314.7 
8 × 16 Optional LT  9.62  327.4  13.5  55.54 
8 × 16 Fast LiftLT  9.54  312.56  13.21  304.85 
The fast LiftLT is comparable to the optional 8×16 LT transform in coding gain and stopband attenuation an significantly better than the DCT.
Reconstructed images for a standard 512×512 “Barbara” test image at 1:32 compression ratio are shown in
Lena  Goldhill  Barbara  
Comp.  9/7 WL  8 × 8  8 × 16  8 × 16  9/7 WL  8 × 8  8 × 16  8 × 16  9/7 WL  8 × 8  8 × 16  8 × 16 
Ratio  SPIHT  DCT  LOT  LiftLT  SPIHT  DCT  LOT  LiftLT  SPIHT  DCT  LOT  LiftLT 
8  40.41  39.91  40.02  40.21  36.55  36.25  36.56  36.56  36.41  36.31  37.22  37.57 
16  37.21  36.38  36.69  37.11  33.13  32.76  33.12  33.22  31.4  31.11  32.52  32.82 
32  34.11  32.9  33.49  34  30.56  30.07  30.52  30.63  27.58  27.28  28.71  28.93 
64  31.1  29.67  30.43  30.9  28.48  27.93  28.34  28.54  24.86  24.58  25.66  25.93 
100  29.35  27.8  28.59  29.03  27.38  26.65  27.08  27.28  23.76  23.42  24.32  24.5 
128  28.38  26.91  27.6  28.12  26.73  26.01  26.46  26.7  23.35  22.68  23.36  23.47 
PSNR is an acronym for power signal to noise ratio and represents the logarithm of the ratio of maximum amplitude squared to the mean square error of the reconstructed signal expressed in decibels (dB).
The LiftLT outperforms its block transform relatives for all test images at all bit rates. Comparing to the wavelet transform, the LiftLT is quite competitive on smooth images—about 0.2 dB below on Lena. However, for more complex images such as Goldhill or Barbara, the LiftLT consistently surpasses the 9/7tap wavelet. The PSNR improvement can reach as high as 1.5 dB.
Claims (39)
Priority Applications (2)
Application Number  Priority Date  Filing Date  Title 

US09212210 US6421464B1 (en)  19981216  19981216  Fast lapped image transforms using lifting steps 
US10629303 USRE40081E1 (en)  19981216  20030729  Fast signal transforms with lifting steps 
Applications Claiming Priority (2)
Application Number  Priority Date  Filing Date  Title 

US10629303 USRE40081E1 (en)  19981216  20030729  Fast signal transforms with lifting steps 
US11896522 US20080075377A1 (en)  20030729  20070904  Fast lapped image transforms using lifting steps 
Related Parent Applications (1)
Application Number  Title  Priority Date  Filing Date  

US09212210 Reissue US6421464B1 (en)  19981216  19981216  Fast lapped image transforms using lifting steps 
Related Child Applications (1)
Application Number  Title  Priority Date  Filing Date 

US11896522 Continuation US20080075377A1 (en)  19981216  20070904  Fast lapped image transforms using lifting steps 
Publications (1)
Publication Number  Publication Date 

USRE40081E1 true USRE40081E1 (en)  20080219 
Family
ID=22790031
Family Applications (2)
Application Number  Title  Priority Date  Filing Date 

US09212210 Active US6421464B1 (en)  19981216  19981216  Fast lapped image transforms using lifting steps 
US10629303 Active  Reinstated USRE40081E1 (en)  19981216  20030729  Fast signal transforms with lifting steps 
Family Applications Before (1)
Application Number  Title  Priority Date  Filing Date 

US09212210 Active US6421464B1 (en)  19981216  19981216  Fast lapped image transforms using lifting steps 
Country Status (1)
Country  Link 

US (2)  US6421464B1 (en) 
Cited By (5)
Publication number  Priority date  Publication date  Assignee  Title 

US20050141609A1 (en) *  20010918  20050630  Microsoft Corporation  Block transform and quantization for image and video coding 
US20070081734A1 (en) *  20051007  20070412  Microsoft Corporation  Multimedia signal processing using fixedpoint approximations of linear transforms 
US20070276894A1 (en) *  20030929  20071129  Agency For Science, Technology And Research  Process And Device For Determining A Transforming Element For A Given Transformation Function, Method And Device For Transforming A Digital Signal From The Time Domain Into The Frequency Domain And Vice Versa And Computer Readable Medium 
US20080198935A1 (en) *  20070221  20080821  Microsoft Corporation  Computational complexity and precision control in transformbased digital media codec 
US9609336B2 (en)  20130416  20170328  Fastvdo Llc  Adaptive coding, transmission and efficient display of multimedia (acted) 
Families Citing this family (26)
Publication number  Priority date  Publication date  Assignee  Title 

JP3757116B2 (en) *  19981211  20060322  松下電器産業株式会社  Deblocking filter operation apparatus and the deblocking filter operation method 
US20080075377A1 (en) *  20030729  20080327  Topiwala Pankaj N  Fast lapped image transforms using lifting steps 
US6587588B1 (en) *  19990316  20030701  At&T Corp.  Progressive image decoder for wavelet encoded images in compressed files and method of operation 
US6771828B1 (en) *  20000303  20040803  Microsoft Corporation  System and method for progessively transform coding digital data 
US6826584B1 (en) *  20001222  20041130  Sony Corporation  Refinement of interpolated signals 
JP3450831B2 (en) *  20010208  20030929  株式会社東芝  Information storage device, a control program, and a program recording medium 
US8705613B2 (en) *  20030626  20140422  Sony Corporation  Adaptive joint source channel coding 
US8582640B2 (en) *  20031216  20131112  Sony Corporation  Adaptive joint source channel coding 
US7471726B2 (en) *  20030715  20081230  Microsoft Corporation  Spatialdomain lapped transform in digital media compression 
US7724827B2 (en) *  20030907  20100525  Microsoft Corporation  Multilayer run level encoding and decoding 
US7369709B2 (en)  20030907  20080506  Microsoft Corporation  Conditional lapped transform 
EP1538826A3 (en) *  20031205  20070307  Samsung Electronics Co., Ltd.  Color transformation method and apparatus 
US7564874B2 (en)  20040917  20090721  UniPixel Displays, Inc.  Enhanced bandwidth data encoding method 
US7471850B2 (en) *  20041217  20081230  Microsoft Corporation  Reversible transform for lossy and lossless 2D data compression 
US7428342B2 (en) *  20041217  20080923  Microsoft Corporation  Reversible overlap operator for efficient lossless data compression 
US20060262860A1 (en) *  20050223  20061123  Chou Jim C  Macroblock adaptive frame/field coding architecture for scalable coding 
US20060288065A1 (en) *  20050617  20061221  Docomo Communications Laboratories Usa, Inc.  Method and apparatus for lapped transform coding and decoding 
US8036274B2 (en) *  20050812  20111011  Microsoft Corporation  SIMD lapped transformbased digital media encoding/decoding 
US8548265B2 (en) *  20060105  20131001  Fastvdo, Llc  Fast multiplierless integer invertible transforms 
KR100715743B1 (en)  20060116  20070501  한국과학기술연구원  Image processing system and method for changing size of image using liftlt transform 
US8155462B2 (en) *  20061229  20120410  Fastvdo, Llc  System of master reconstruction schemes for pyramid decomposition 
US8139880B2 (en) *  20080324  20120320  Microsoft Corporation  Liftingbased directional lapped transforms 
US8369638B2 (en)  20080527  20130205  Microsoft Corporation  Reducing DC leakage in HD photo transform 
US8447591B2 (en) *  20080530  20130521  Microsoft Corporation  Factorization of overlapping tranforms into two block transforms 
US8275209B2 (en)  20081010  20120925  Microsoft Corporation  Reduced DC gain mismatch and DC leakage in overlap transform processing 
RU2583734C1 (en) *  20150518  20160510  Акционерное общество "Научноисследовательский институт телевидения"  Method of generating noiseimmune radio signals 
Citations (24)
Publication number  Priority date  Publication date  Assignee  Title 

US5081645A (en) *  19900806  19920114  Aware, Inc.  Novel spread spectrum codec apparatus and method 
US5339265A (en) *  19920831  19940816  University Of Maryland At College Park  Optimal unified architectures for the realtime computation of timerecursive discrete sinusoidal transforms 
US5592569A (en) *  19930510  19970107  Competitive Technologies, Inc.  Method for encoding and decoding images 
US5604824A (en) *  19940922  19970218  Houston Advanced Research Center  Method and apparatus for compression and decompression of documents and the like using splines and splinewavelets 
US5764698A (en) *  19931230  19980609  International Business Machines Corporation  Method and apparatus for efficient compression of high quality digital audio 
US5805739A (en) *  19960402  19980908  Picturetel Corporation  Lapped orthogonal vector quantization 
US5812219A (en) *  19941109  19980922  U.S. Philips Corporation  System and method for transmitting picture or sound signals 
US5857036A (en) *  19960304  19990105  Iterated Systems, Inc.  System and method for the fractal encoding of datastreams 
US5859788A (en) *  19970815  19990112  The Aerospace Corporation  Modulated lapped transform method 
US5883981A (en) *  19951020  19990316  Competitive Technologies Of Pa, Inc.  Lattice vector transform coding method for image and video compression 
US5898798A (en) *  19951018  19990427  U.S. Philips Corporation  Regionbased texture coding and decoding method and corresponding systems 
US5901251A (en) *  19970318  19990504  HewlettPackard Company  Arithmetic coding compressor using a context model that is adaptive to variable length patterns in bilevel image data 
US5903669A (en) *  19950131  19990511  Canon Kabushiki Kaisha  Image processing apparatus and method 
US5946038A (en) *  19960227  19990831  U.S. Philips Corporation  Method and arrangement for coding and decoding signals 
US5960123A (en) *  19950727  19990928  Fuji Photo Film Co., Ltd.  Method and apparatus for enhancing contrast in images by emphasis processing of a multiresolution frequency band 
US5973755A (en) *  19970404  19991026  Microsoft Corporation  Video encoder and decoder using bilinear motion compensation and lapped orthogonal transforms 
US5995668A (en) *  19951025  19991130  U.S. Philips Corporation  Segmented picture coding method and system, and corresponding decoding method and system 
US5999656A (en) *  19970117  19991207  Ricoh Co., Ltd.  Overlapped reversible transforms for unified lossless/lossy compression 
US6018753A (en) *  19970729  20000125  Lucent Technologies Inc.  Interpolating filter banks in arbitrary dimensions 
US6094631A (en) *  19980709  20000725  Winbond Electronics Corp.  Method of signal compression 
US6104982A (en) *  19951201  20000815  Schlumberger Technology Corporation  Compression method and apparatus for seismic data 
US6144773A (en) *  19960227  20001107  Interval Research Corporation  Waveletbased data compression 
US6144771A (en) *  19960628  20001107  Competitive Technologies Of Pa, Inc.  Method and apparatus for encoding and decoding images 
US6198412B1 (en) *  19990120  20010306  Lucent Technologies Inc.  Method and apparatus for reduced complexity entropy coding 
Patent Citations (24)
Publication number  Priority date  Publication date  Assignee  Title 

US5081645A (en) *  19900806  19920114  Aware, Inc.  Novel spread spectrum codec apparatus and method 
US5339265A (en) *  19920831  19940816  University Of Maryland At College Park  Optimal unified architectures for the realtime computation of timerecursive discrete sinusoidal transforms 
US5592569A (en) *  19930510  19970107  Competitive Technologies, Inc.  Method for encoding and decoding images 
US5764698A (en) *  19931230  19980609  International Business Machines Corporation  Method and apparatus for efficient compression of high quality digital audio 
US5604824A (en) *  19940922  19970218  Houston Advanced Research Center  Method and apparatus for compression and decompression of documents and the like using splines and splinewavelets 
US5812219A (en) *  19941109  19980922  U.S. Philips Corporation  System and method for transmitting picture or sound signals 
US5903669A (en) *  19950131  19990511  Canon Kabushiki Kaisha  Image processing apparatus and method 
US5960123A (en) *  19950727  19990928  Fuji Photo Film Co., Ltd.  Method and apparatus for enhancing contrast in images by emphasis processing of a multiresolution frequency band 
US5898798A (en) *  19951018  19990427  U.S. Philips Corporation  Regionbased texture coding and decoding method and corresponding systems 
US5883981A (en) *  19951020  19990316  Competitive Technologies Of Pa, Inc.  Lattice vector transform coding method for image and video compression 
US5995668A (en) *  19951025  19991130  U.S. Philips Corporation  Segmented picture coding method and system, and corresponding decoding method and system 
US6104982A (en) *  19951201  20000815  Schlumberger Technology Corporation  Compression method and apparatus for seismic data 
US6144773A (en) *  19960227  20001107  Interval Research Corporation  Waveletbased data compression 
US5946038A (en) *  19960227  19990831  U.S. Philips Corporation  Method and arrangement for coding and decoding signals 
US5857036A (en) *  19960304  19990105  Iterated Systems, Inc.  System and method for the fractal encoding of datastreams 
US5805739A (en) *  19960402  19980908  Picturetel Corporation  Lapped orthogonal vector quantization 
US6144771A (en) *  19960628  20001107  Competitive Technologies Of Pa, Inc.  Method and apparatus for encoding and decoding images 
US5999656A (en) *  19970117  19991207  Ricoh Co., Ltd.  Overlapped reversible transforms for unified lossless/lossy compression 
US5901251A (en) *  19970318  19990504  HewlettPackard Company  Arithmetic coding compressor using a context model that is adaptive to variable length patterns in bilevel image data 
US5973755A (en) *  19970404  19991026  Microsoft Corporation  Video encoder and decoder using bilinear motion compensation and lapped orthogonal transforms 
US6018753A (en) *  19970729  20000125  Lucent Technologies Inc.  Interpolating filter banks in arbitrary dimensions 
US5859788A (en) *  19970815  19990112  The Aerospace Corporation  Modulated lapped transform method 
US6094631A (en) *  19980709  20000725  Winbond Electronics Corp.  Method of signal compression 
US6198412B1 (en) *  19990120  20010306  Lucent Technologies Inc.  Method and apparatus for reduced complexity entropy coding 
NonPatent Citations (4)
Title 

Liang et al., "ITUTelecommunications Standardization Sector", A 16bit architecture for H.26L treating DCT Transforms and quantization, pp. 112, May 29, 2001. * 
Liang, et al., "ITUTelecommunications Standardization Sector", A 16bit architecture for H.26L treating DCT Transforms anf quantization, pp. 12, May 29, 2001. * 
Nayebi et al., "A time domain view of filter banks and wavelets", Signals, Systems and Computers, 1991. 1991 Conference Record of the TwentyFifth Asimolar Conference on, 1991, pp. 736740 vol. 2. * 
Sweldens, Wim, "The Lifting Scheme: A custom design construction of biorthogonal wavelets", pp. 129, Nov. 1994. * 
Cited By (14)
Publication number  Priority date  Publication date  Assignee  Title 

US7773671B2 (en)  20010918  20100810  Microsoft Corporation  Block transform and quantization for image and video coding 
US20050180503A1 (en) *  20010918  20050818  Microsoft Corporation  Block transform and quantization for image and video coding 
US20050213659A1 (en) *  20010918  20050929  Microsoft Corporation  Block transform and quantization for image and video coding 
US8971405B2 (en)  20010918  20150303  Microsoft Technology Licensing, Llc  Block transform and quantization for image and video coding 
US20110116543A1 (en) *  20010918  20110519  Microsoft Corporation  Block transform and quantization for image and video coding 
US7881371B2 (en)  20010918  20110201  Microsoft Corporation  Block transform and quantization for image and video coding 
US7839928B2 (en)  20010918  20101123  Microsoft Corporation  Block transform and quantization for image and video coding 
US20050141609A1 (en) *  20010918  20050630  Microsoft Corporation  Block transform and quantization for image and video coding 
US20070276894A1 (en) *  20030929  20071129  Agency For Science, Technology And Research  Process And Device For Determining A Transforming Element For A Given Transformation Function, Method And Device For Transforming A Digital Signal From The Time Domain Into The Frequency Domain And Vice Versa And Computer Readable Medium 
US7689052B2 (en)  20051007  20100330  Microsoft Corporation  Multimedia signal processing using fixedpoint approximations of linear transforms 
US20070081734A1 (en) *  20051007  20070412  Microsoft Corporation  Multimedia signal processing using fixedpoint approximations of linear transforms 
US20080198935A1 (en) *  20070221  20080821  Microsoft Corporation  Computational complexity and precision control in transformbased digital media codec 
US8942289B2 (en)  20070221  20150127  Microsoft Corporation  Computational complexity and precision control in transformbased digital media codec 
US9609336B2 (en)  20130416  20170328  Fastvdo Llc  Adaptive coding, transmission and efficient display of multimedia (acted) 
Also Published As
Publication number  Publication date  Type 

US6421464B1 (en)  20020716  grant 
Similar Documents
Publication  Publication Date  Title 

Creusere  A new method of robust image compression based on the embedded zerotree wavelet algorithm  
Said et al.  Reversible image compression via multiresolution representation and predictive coding  
Acharya et al.  JPEG2000 standard for image compression  
Christopoulos et al.  The JPEG2000 still image coding system: an overview  
Rabbani et al.  An overview of the JPEG 2000 still image compression standard  
US6549666B1 (en)  Reversible embedded wavelet system implementation  
Taubman et al.  JPEG2000: Standard for interactive imaging  
US6757437B1 (en)  Compression/decompression using reversible embedded wavelets  
US5808683A (en)  Subband image coding and decoding  
US6195465B1 (en)  Method and apparatus for compression using reversible wavelet transforms and an embedded codestream  
US6381280B1 (en)  Single chip motion wavelet zero tree codec for image and video compression  
US6229927B1 (en)  Reversible embedded wavelet system implementation  
US6101279A (en)  Image compression system using block transforms and treetype coefficient truncation  
US5909518A (en)  System and method for performing waveletlike and inverse waveletlike transformations of digital data  
US5126962A (en)  Discrete cosine transform processing system  
US5841473A (en)  Image sequence compression and decompression  
Strobach  Treestructured scene adaptive coder  
Luo et al.  Artifact reduction in low bit rate DCTbased image compression  
Karlsson et al.  Extension of finite length signals for subband coding  
Simoncelli et al.  Subband transforms  
US6873734B1 (en)  Method and apparatus for compression using reversible wavelet transforms and an embedded codestream  
Vetterli  Subband Coding  
US5546477A (en)  Data compression and decompression  
Villasenor et al.  Wavelet filter evaluation for image compression  
Tran et al.  Lapped transform via timedomain preand postfiltering 
Legal Events
Date  Code  Title  Description 

AS  Assignment 
Owner name: FASTVDO, LLC, MARYLAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:PTIP, LLC;REEL/FRAME:019747/0027 Effective date: 20070816 

FPAY  Fee payment 
Year of fee payment: 8 

REMI  Maintenance fee reminder mailed  
REIN  Reinstatement after maintenance fee payment confirmed  
LAPS  Lapse for failure to pay maintenance fees  
SULP  Surcharge for late payment  
FPAY  Fee payment 
Year of fee payment: 12 

AS  Assignment 
Owner name: RPX CORPORATION, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FASTVDO LLC;REEL/FRAME:038249/0458 Effective date: 20140912 

PRDP  Patent reinstated due to the acceptance of a late maintenance fee 
Effective date: 20080219 