DE60227688C5 - Implementierung von einer transformation und einer nachfolgenden quantisierung - Google Patents

Implementierung von einer transformation und einer nachfolgenden quantisierung Download PDF

Info

Publication number
DE60227688C5
DE60227688C5 DE60227688.8T DE60227688T DE60227688C5 DE 60227688 C5 DE60227688 C5 DE 60227688C5 DE 60227688 T DE60227688 T DE 60227688T DE 60227688 C5 DE60227688 C5 DE 60227688C5
Authority
DE
Germany
Prior art keywords
matrix
diagonal
simplified
transform
elements
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.)
Expired - Lifetime
Application number
DE60227688.8T
Other languages
English (en)
Other versions
DE60227688D1 (de
Inventor
Antti Hallapuro
Kim Simelius
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Technologies Oy
Original Assignee
Nokia Technologies Oy
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=25479298&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=DE60227688(C5) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Nokia Technologies Oy filed Critical Nokia Technologies Oy
Application granted granted Critical
Publication of DE60227688D1 publication Critical patent/DE60227688D1/de
Publication of DE60227688C5 publication Critical patent/DE60227688C5/de
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC 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, Karhunen-Loeve, 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/124—Quantisation
    • 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/124—Quantisation
    • H04N19/126—Details of normalisation or weighting functions, e.g. normalisation matrices or variable uniform quantisers
    • 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/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/18—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a set of transform coefficients
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Mathematical Physics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • Discrete Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Algebra (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)
  • Complex Calculations (AREA)
  • Radar Systems Or Details Thereof (AREA)

Abstract

A method for implementing an approximation of a discrete cosine transform and a quantization operation, said method comprising:
- factorizing a discrete cosine transform matrix into a product of matrices, at least one of the matrices being a diagonal matrix and at least one of the matrices being a non-diagonal simplified transform matrix comprising elements constituting irrational numbers; and
- approximating elements of said non-diagonal simplified transform matrix constituting irrational numbers by rational numbers to form a further simplified transform matrix; said method characterized by
- adjusting elements of said diagonal matrix to compensate for said approximation of elements of said non-diagonal simplified transform matrix by rational numbers; and
- calculating elements of a quantization matrix based on a quantization parameter and on said adjusted elements of said diagonal matrix.

Description

  • Betreffend das am 16.07.2008 veröffentlichte europäische Patent EP 1 440 515 B1 mit Wirkung für die Bundesrepublik Deutschland (nationale Patentnummer DE 602 27 688 ) hat das Deutsche Patent- und Markenamt am 28.11.2019 beschlossen:
    • Das Patent wird auf den am 10.09.2019 eingegangenen Antrag der Patentinhaberin gemäß § 64 des Patentgesetzes durch die am 10.09.2019 eingegangenen Patentansprüche Nr. 1 bis 38 beschränkt.

Claims (38)

  1. A method for implementing an approximation of a discrete cosine transform and a quantization operation, said method comprising: - factorizing a discrete cosine transform matrix into a product of matrices, at least one of the matrices being a diagonal matrix and at least one of the matrices being a non-diagonal simplified transform matrix comprising elements constituting irrational numbers; and - approximating elements of said non-diagonal simplified transform matrix constituting irrational numbers by rational numbers to form a further simplified transform matrix; said method characterized by - adjusting elements of said diagonal matrix to compensate for said approximation of elements of said non-diagonal simplified transform matrix by rational numbers; and - calculating elements of a quantization matrix based on a quantization parameter and on said adjusted elements of said diagonal matrix.
  2. A method according to claim 1, wherein said elements of said diagonal matrix are adjusted such that a product of a reassembled matrix and the transpose of said reassembled matrix is equal to the identity matrix, when said reassembled matrix is formed from said further simplified transform matrix and said adjusted diagonal matrix.
  3. A method according to claim 1 or 2, wherein said rational numbers can be represented by fractions having a denominator equal to 2n, wherein n is an integer.
  4. A method according to claim 3, wherein in said transform implementation divisions are realized by bit-shifting.
  5. A method according to one of the preceding claims, the approximated discrete cosine transform is implemented with only addition, subtraction and bit-shifting operations.
  6. A method according to one of the preceding claims, wherein said discrete cosine transform matrix is a 4x4 matrix of a form: [ a a a a b c − c − b a − a − a a c − b b − c ] ,
    Figure DE000060227688C5_0001
    wherein a=1/2, b = 1 / 2 ⋅ cos ( π / 8 ) ,
    Figure DE000060227688C5_0002
     c = 1 / 2 ⋅ cos ( 3 π / 8 ) ,
    Figure DE000060227688C5_0003
    wherein ‚c‘ is substituted in said matrix according to an equation d=c/b, and wherein said discrete cosine transform matrix is factorized into a diagonal matrix comprising diagonal values {a, b, a, b} and a non-diagonal simplified transform matrix comprising only elements having absolute values of ‚1‘ and ‚d‘.
  7. A method according to claim 6, wherein in said non-diagonal simplified transform matrix said value ‚d‘ is approximated by a rational number 7/16.
  8. A method according to claim 6, wherein in said non-diagonal simplified transform matrix said value ‚d‘ is approximated by a rational number, and wherein in said diagonal matrix said value ‚b‘ is adjusted to b = 0.5 1 + d 2 ,
    Figure DE000060227688C5_0004
    ‚d‘ being in said equation said rational number.
  9. A method according to claim 6, wherein in said non-diagonal simplified transform matrix said value ‚d‘ is approximated by a rational number 7/16, and wherein said transform is implemented for a transform of a one-dimensional sequence of four values X[0],X[1],X[2],X[3] respectively with the following equations: e = X [ 0 ] + X [ 3 ] ,
    Figure DE000060227688C5_0005
     f = X [ 1 ] + X [ 2 ] ,
    Figure DE000060227688C5_0006
     Y [ 0 ] = e + f ,
    Figure DE000060227688C5_0007
     Y [ 2 ] = e − f ,
    Figure DE000060227688C5_0008
     e = X [ 0 ] − X [ 3 ] ,
    Figure DE000060227688C5_0009
     f = X [ 1 ] − X [ 2 ] ,
    Figure DE000060227688C5_0010
     Y [ 1 ] = e + ( f − f / 8 ) / 2,
    Figure DE000060227688C5_0011
    and Y [ 3 ] = ( e − e / 8 ) / 2 − f ,
    Figure DE000060227688C5_0012
    wherein Y[0],Y[1],Y[2],Y[3] is a one-dimensional sequence of four transformed values, and wherein e and f are auxiliary variables.
  10. A method according to one of claims 1 to 5, wherein said discrete cosine transform matrix is a 8x8 matrix of a form: [ a a a a a a a a b c d e − e − d − c − b f g − g − f − f − g g f c − e − b − d d b e − c a − a − a a a − a − a a d − b e c − c − e b − d g − f f − g − g f − f g e − d c − b b − c d − e ]
    Figure DE000060227688C5_0013
    wherein a = 1 / ( 2 2 ) ,
    Figure DE000060227688C5_0014
    b = 1/2 · cos(π /16), c =1/2·cos(3π/16), d = 1/2·cos(5π/16), e=1/2·cos(7π/16), f=1/2·cos(π/8), g=1/2·cos(3π/8), wherein ‚c‘ is substituted in said matrix according to an equation cb=c/b, wherein ‚d‘ is substituted in said matrix according to an equation db=d/b, wherein ‚e‘ is substituted in said matrix according to an equation eb=e/b, wherein ‚g‘ is substituted in said matrix according to an equation gf=g/f, and wherein said discrete cosine transform matrix is factorized into a diagonal matrix comprising diagonal values {a, b, f, b, a, b, f, b} and a non-diagonal simplified transform matrix comprising only elements having absolute values of ‚1‘, ‚cb‘, ‚db‘, ‚eb‘ and ‚gf‘.
  11. A method according to claim 10, wherein in said non-diagonal simplified transform matrix said value ‚cb‘ is approximated by a rational number 15/16, said value ‚db‘ is approximated by a rational number 9/16, said value ‚eb‘ is approximated by a rational number 1/4, and said value ‚gf‘ is approximated by a rational number 7/16.
  12. A method according to claim 10, wherein in said non-diagonal simplified transform matrix said values ‚cb‘, ‚db‘, ‚eb‘. and ‚gf‘ are approximated by rational numbers, and wherein in said diagonal matrix said values ‚b‘ and ‚f‘ are adjusted to b = 1 2 1 1 + c b 2 + d b 2 + e b 2
    Figure DE000060227688C5_0015
    and f = 1 2 1 1 + g f 2 ,
    Figure DE000060227688C5_0016
    values ‚cb‘, ‚db‘, ‚eb‘ and ‚gf‘ being in said equation said rational numbers.
  13. A method according to one of the preceding claims, wherein for a two-dimensional transform to be applied to two-dimensional.digital data, said non-diagonal simplified transform matrix with said approximated elements and a transpose of said non-diagonal simplified transform matrix with said approximated elements are employed as basis for implementing said transform, said quantization matrix including operations removed from both of said matrices, which operations are adjusted to compensate for said approximations in both of said matrices.
  14. A method according to one of the preceding claims, wherein before being used for quantization, said elements of said quantization matrix are converted to fixed-point values.
  15. A method for implementing a dequantization and an approximation of an inverse discrete cosine transform, the method comprising: - factorizing an inverse discrete cosine transform matrix into a product of matrices, at least one of the matrices being a diagonal matrix and at least one of the matrices being a non-diagonal simplified inverse transform matrix comprising elements constituting irrational numbers; - approximating elements of said non-diagonal simplified inverse transform matrix constituting irrational numbers by rational numbers to form a further simplified inverse transform matrix; said method characterized by - adjusting elements of said diagonal matrix to compensate for said approximation of elements of said non-diagonal simplified inverse transform matrix by rational numbers; and - calculating elements of a dequantization matrix based on a quantization parameter and on said adjusted elements of said diagonal matrix.
  16. A method according to claim 15, wherein before being used for dequantization, said elements of said dequantization matrix are converted to fixed-point values.
  17. A method according to claim 15, wherein said elements of said diagonal matrix are adjusted such that a product of a reassembled matrix and the transpose of said reassembled matrix is equal to the identity matrix, when said reassembled matrix is formed from said further simplified inverse transform matrix and said adjusted diagonal matrix.
  18. A method according to one of claims 15 to 17, wherein said rational numbers can be represented by fractions having a denominator equal to 2n, wherein n is an integer.
  19. A method according to claim 18, wherein in said inverse transform implementation divisions are realized by bit-shifting.
  20. A method according to claim 18, the approximated inverse discrete cosine transform is implemented with only addition, subtraction and bit-shifting operations.
  21. A method according to one of claims 15 to 20, wherein said inverse discrete cosine transform matrix is a 4x4 matrix of a form [ a b a c a c − a − b a − c − a b a − b a − c ] ,
    Figure DE000060227688C5_0017
    wherein a=1/2, b = 1 / 2 ⋅ cos ( π / 8 ) ,
    Figure DE000060227688C5_0018
     c = 1 / 2 ⋅ cos ( 3 π / 8 ) ,
    Figure DE000060227688C5_0019
    wherein ‚c‘ is substituted in said matrix according to an equation d=c/b, and wherein said inverse discrete cosine transform matrix is factorized into a diagonal matrix comprising diagonal values {a, b, a, b} and a non-diagonal simplified inverse transform matrix comprising only elements having absolute values of ‚1‘ and ‚d‘.
  22. A method according to claim 21, wherein in said non-diagonal simplified inverse transform matrix said value ‚d‘ is approximated by a rational number 7/16.
  23. A method according to claim 21, wherein in said non-diagonal simplified inverse transform matrix said value ‚d‘ is approximated by a rational number, and wherein in said diagonal matrix said value ‚b‘ is adjusted to b = 0.5 1 + d 2 ,
    Figure DE000060227688C5_0020
    ‚d‘ being in said equation said rational number.
  24. A method according to claim 21, wherein in said non-diagonal simplified inverse transform matrix said value ‚d‘ is approximated by a rational number 7/16, and wherein said inverse transform is implemented for an inverse transform of a one-dimensional sequence of four values X[0], X[1], X[2], X[3] respectively with the following equations: e = X [ 0 ] + X [ 3 ] ,
    Figure DE000060227688C5_0021
     f = X [ 1 ] + X [ 2 ] ,
    Figure DE000060227688C5_0022
     Y [ 0 ] = e + f ,
    Figure DE000060227688C5_0023
     Y [ 2 ] = e − f ,
    Figure DE000060227688C5_0024
     e = X [ 0 ] − X [ 3 ] ,
    Figure DE000060227688C5_0025
     f = X [ 1 ] − X [ 2 ] ,
    Figure DE000060227688C5_0026
     Y [ 1 ] = e + ( f − f / 8 ) / 2,
    Figure DE000060227688C5_0027
    and Y [ 3 ] = ( e − e / 8 ) / 2 − f ,
    Figure DE000060227688C5_0028
    wherein Y[0], Y[1], Y[2], Y[3] is a one-dimensional sequence of four transformed values, and wherein e and f are auxiliary variables.
  25. A method according to one of claims 15 to 20, wherein said inverse discrete cosine transform matrix is a 8x8 matrix of a form: [ a b f c a d g e a c g − e − a − b − f − d a d − g − b − a e f c a e − f − d a c − g − b a − e − f d a − c − g b a − d − g b − a − e f − c a − c g e − a b − f d a − b f − c a − d g − e ]
    Figure DE000060227688C5_0029
    wherein a = 1 / ( 2 2 ) ,
    Figure DE000060227688C5_0030
    b =1/2 · cos(π /16), c =1/2·cos(3π /16), d=1/2·cos(5π/16), e =1/2·cos(7π/16), f=1/2·cos(π/8), g=1/2·cos(3π/8), wherein ‚c‘ is substituted in said matrix according to an equation cb=c/b, wherein ‚d‘ is substituted in said matrix according to an equation db=d/b, wherein ‚e‘ is substituted in said matrix according to an equation eb=e/b, wherein ‚g‘ is substituted in said matrix according to an equation gf=g/f, and wherein said inverse discrete cosine transform matrix is factorized into a diagonal matrix comprising diagonal values {a, b, f, b, a, b, f, b} and a simplified inverse transform matrix comprising only elements having absolute values of ‚1‘, ‚cb‘, ‚db‘, ‚eb‘ and ‚gf‘.
  26. A method according to claim 25, wherein in said non-diagonal simplified inverse transform matrix said value ‚cb‘ is approximated by a rational number 15/16, said value ‚db‘ is approximated by a rational number 9/16, said value ‚eb‘ is approximated by a rational number 1/4, and said value ‚gf‘ is approximated by a rational number 7/16.
  27. A method according to claim 25, wherein in said non-diagonal simplified inverse transform matrix said values ‚cb‘, ‚db‘, ‚eb‘ and ‚gf‘ are approximated by rational numbers, and wherein in said diagonal matrix said values ‚b‘ and ‚f‘ are adjusted to b = 1 2 1 1 + c b 2 + d b 2 + e b 2 and f = 1 2 1 1 + g f 2 ,
    Figure DE000060227688C5_0031
    values ‚cb‘, ‚db‘, ‚eb‘ and ‚gf‘ being in said equation said rational numbers.
  28. A method according to one of claims 15 to 27, wherein for a two-dimensional inverse transform to be applied to two-dimensional dequantized digital data, said non-diagonal simplified inverse transform matrix with said approximated elements and a transpose of said non-diagonal simplified inverse transform matrix with said approximated elements are employed as basis for implementing said inverse transform, said dequantization matrix including operations removed from both of said matrices, which operations are adjusted to compensate for said approximations in both of said matrices.
  29. An encoder (4) for compressing digital data comprising: - a transformer (41) for transforming digital data by applying a simplified transform to said digital data, the simplified transform being based on a transform matrix obtained by factorizing a discrete cosine transform matrix into a product of matrices, at least one of the matrices being a diagonal matrix and at least one of the matrices being a non-diagonal simplified transform matrix comprising elements constituting irrational numbers, and by approximating elements of said simplified non-diagonal transform matrix constituting irrational numbers by rational numbers to form a further simplified transform matrix as said transform matrix for said simplified transform; and - a quantization means (42) coupled to an output of said transformer (41) for quantizing said transformed digital data with a quantization, characterized in that - said quantization is based on a quantization matrix having elements which have been calculated based on a quantization parameter and on adjusted elements of said diagonal matrix, wherein said elements of said diagonal matrix are adjusted to compensate for said approximation of elements of said non-diagonal simplified transform matrix by rational numbers.
  30. An encoder (4) according to claim 29, wherein the simplified transform is implemented with only addition, subtraction and bit-shifting operations; and wherein said discrete cosine transform matrix is a 4x4 matrix of a form [ a a a a b c − c − b a − a − a a c − b b − c ] ,
    Figure DE000060227688C5_0032
    wherein a = 1/2, b = 1 / 2 ⋅ cos ( π / 8 ) ,
    Figure DE000060227688C5_0033
     c = 1 / 2 ⋅ cos ( 3 π / 8 ) ,
    Figure DE000060227688C5_0034
    wherein ‚c‘ is substituted in said matrix according to an equation d=c/b, and wherein said discrete cosine transform matrix is factorized into a diagonal matrix comprising diagonal values {a, b, a, b} and a non-diagonal simplified transform matrix of a form [ 1 1 1 1 1 d − d − 1 1 − 1 − 1 1 d − 1 1 − d ] .
    Figure DE000060227688C5_0035
  31. An encoder (4) according to claim 29 or 30, wherein said elements of said diagonal matrix are adjusted such that a product of a reassembled matrix and the transpose of said reassembled matrix is equal to the identity matrix, when said reassembled matrix is formed from said further simplified transform matrix and said adjusted diagonal matrix.
  32. An encoder (4) according to claim 30, wherein in said non-diagonal simplified transform matrix said value ‚d‘ is approximated by a rational number to form the further simplified transform matrix, the rational number being represented by a fraction having a denominator equal to 2n, wherein n is an integer, and wherein in said diagonal matrix said value ‚b‘ is adjusted to b = 0.5 1 + d 2 ,
    Figure DE000060227688C5_0036
    ‚d‘ being in said equation said rational number.
  33. A decoder (5) comprising: - a dequantization means (52) for dequantizing compressed digital data with a dequantization; and - a transformer (51) coupled to an output of said dequantization means (52) for transforming dequantized digital data by applying a simplified inverse transform that is based on an inverse transform matrix obtained by factorizing an inverse discrete cosine transform matrix into a product of matrices, at least one of the matrices being a diagonal matrix and at least one of the matrices being a non-diagonal simplified inverse transform matrix comprising elements constituting irrational numbers, and by approximating elements of said non-diagonal simplified inverse transform matrix constituting irrational numbers by rational numbers to form a further simplified inverse transform matrix as said inverse transform matrix for said simplified inverse transform; characterized in that - said dequantization applied by said dequantization means (52) is based on a matrix having elements which have been calculated based on a dequantization parameter and on adjusted elements of said diagonal matrix, wherein said elements of said diagonal matrix are adjusted to compensate for said approximation of elements of said non-diagonal simplified inverse transform matrix by rational numbers.
  34. A decoder(5) according to claim 33, wherein the simplified inverse transform is implemented with only addition, subtraction and bit-shifting operations; and wherein said inverse discrete cosine transform matrix is a 4x4 matrix of a form [ a b a c a c − a − b a − c − a b a − b a − c ] ,
    Figure DE000060227688C5_0037
    wherein a = 1/2, b = 1 / 2 ⋅ cos ( π / 8 ) ,
    Figure DE000060227688C5_0038
     c = 1 / 2 ⋅ cos ( 3 π / 8 ) ,
    Figure DE000060227688C5_0039
    wherein ‚c‘ is substituted in said matrix according to an equation d=c/b, and wherein said inverse discrete cosine transform matrix is factorized into a diagonal matrix comprising diagonal values {a, b, a, b} and a non-diagonal simplified inverse transform matrix of a form [ 1 1 1 d 1 d − 1 − 1 1 − d − 1 1 1 − 1 1 − d ] .
    Figure DE000060227688C5_0040
  35. A decoder (5) according to claim 33 or 34, wherein said elements of said diagonal matrix are adjusted such that a product of a reassembled matrix and the transpose of said reassembled matrix is equal to the identity matrix, when said reassembled matrix is formed from said further simplified inverse transform matrix and said adjusted diagonal matrix.
  36. A decoder (5) according to claim 34, wherein in said non-diagonal simplified inverse transform matrix said value ‚d‘ is approximated by a rational number to form the further simplified transform matrix, the rational number being represented by a fraction having a denominator equal to 2n, wherein n is an integer, and wherein in said diagonal matrix said value ‚b‘ is adjusted to b = 0.5 1 + d 2 ,
    Figure DE000060227688C5_0041
    ‚d‘ being in said equation said rational number.
  37. A method of encoding, the method comprising: - applying a set of equations representing an approximated discrete cosine transform to a set of source values to obtain a corresponding set of approximated transform coefficients, wherein the approximated discrete cosine transform is based on a further simplified transform matrix that has been obtained according to the method of one of claims 1 to 14; and - quantizing said transformed digital data with a quantization, which is based on elements of a quantization matrix that have been calculated according to the method of one of claims 1 to 14.
  38. A method of decoding, the method comprising: - dequantizing compressed digital data with a dequantization, which is based on elements of a dequantization matrix that have been calculated according to the method of one of claims 15 to 28; and - applying a set of equations representing an approximated inverse discrete cosine transform to dequantized digital data, wherein the approximated inverse discrete cosine transform is based on a further simplified inverse transform matrix that has been obtained according to the method of one of claims 15 to 28.
DE60227688.8T 2001-08-30 2002-08-27 Implementierung von einer transformation und einer nachfolgenden quantisierung Expired - Lifetime DE60227688C5 (de)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US943241 2001-08-30
US09/943,241 US7082450B2 (en) 2001-08-30 2001-08-30 Implementation of a transform and of a subsequent quantization
PCT/IB2002/003566 WO2003019787A2 (en) 2001-08-30 2002-08-27 Implementation of a transform and of a subsequent quantization
EP02762664A EP1440515B1 (de) 2001-08-30 2002-08-27 Implementierung von einer transformation und einer nachfolgenden quantisierung

Publications (2)

Publication Number Publication Date
DE60227688D1 DE60227688D1 (de) 2008-08-28
DE60227688C5 true DE60227688C5 (de) 2020-03-12

Family

ID=25479298

Family Applications (1)

Application Number Title Priority Date Filing Date
DE60227688.8T Expired - Lifetime DE60227688C5 (de) 2001-08-30 2002-08-27 Implementierung von einer transformation und einer nachfolgenden quantisierung

Country Status (13)

Country Link
US (3) US7082450B2 (de)
EP (2) EP1440515B1 (de)
JP (2) JP4153425B2 (de)
KR (1) KR100912415B1 (de)
CN (2) CN101261619B (de)
AT (1) ATE401703T1 (de)
AU (1) AU2002328100A1 (de)
DE (1) DE60227688C5 (de)
HK (1) HK1122622A1 (de)
HU (1) HU228603B1 (de)
MX (1) MXPA04001724A (de)
WO (1) WO2003019787A2 (de)
ZA (1) ZA200401224B (de)

Families Citing this family (48)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
AU2002220233A1 (en) * 2000-12-01 2002-06-11 Lizardtech, Inc. Method for lossless encoding of image data by approximating linear transforms and preserving selected properties
US7082450B2 (en) 2001-08-30 2006-07-25 Nokia Corporation Implementation of a transform and of a subsequent quantization
US7130876B2 (en) * 2001-11-30 2006-10-31 General Instrument Corporation Systems and methods for efficient quantization
US7760950B2 (en) * 2002-09-26 2010-07-20 Ntt Docomo, Inc. Low complexity and unified transforms for video coding
CN100411442C (zh) * 2003-03-24 2008-08-13 华为技术有限公司 一种视频图象编码方法
US7813574B2 (en) * 2003-09-24 2010-10-12 Ntt Docomo, Inc. Low complexity and unified transforms for video coding
US20070276894A1 (en) * 2003-09-29 2007-11-29 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
US7388999B2 (en) * 2003-10-29 2008-06-17 Hewlett-Packard Development Company, L.P. Transformations for denoising images
US8069201B2 (en) * 2003-11-25 2011-11-29 Texas Instruments Incorporated 8×8 transform and quantization
US7756351B2 (en) 2003-12-19 2010-07-13 Stmicroelectronics, Inc. Low power, high performance transform coprocessor for video compression
US8335811B2 (en) * 2004-03-04 2012-12-18 Broadcom Corporation Method and system for high fidelity IDCT and DCT algorithms
US8595281B2 (en) 2006-01-11 2013-11-26 Qualcomm Incorporated Transforms with common factors
TWI410098B (zh) * 2006-03-17 2013-09-21 Lg Electronics Inc 用以轉換資料之方法，及以其傳輸和接收資料之方法
US8849884B2 (en) * 2006-03-29 2014-09-30 Qualcom Incorporate Transform design with scaled and non-scaled interfaces
US8699810B2 (en) * 2006-06-26 2014-04-15 Qualcomm Incorporated Efficient fixed-point approximations of forward and inverse discrete cosine transforms
US8606023B2 (en) * 2006-06-26 2013-12-10 Qualcomm Incorporated Reduction of errors during computation of inverse discrete cosine transform
RU2417423C2 (ru) * 2006-06-26 2011-04-27 Квэлкомм Инкорпорейтед Эффективные аппроксимации с фиксированной запятой прямого и обратного дискретных косинусных преобразований
US8849183B2 (en) 2007-10-05 2014-09-30 Qualcomm Incorporated Location and time based filtering of broadcast information
US8331454B2 (en) * 2007-11-12 2012-12-11 Cisco Technology, Inc. Integer transform function for video compression systems
US7876257B2 (en) * 2008-04-28 2011-01-25 Mitsubishi Electric Research Laboratories, Inc. Method and apparatus for compressing SAR signals
US9280778B2 (en) 2008-12-15 2016-03-08 Qualcomm Incorporated Location logging and location and time based filtering
JP4594420B2 (ja) * 2008-12-25 2010-12-08 キヤノン株式会社 データ変換装置及びその制御方法
US9110849B2 (en) * 2009-04-15 2015-08-18 Qualcomm Incorporated Computing even-sized discrete cosine transforms
US9069713B2 (en) * 2009-06-05 2015-06-30 Qualcomm Incorporated 4X4 transform for media coding
US8762441B2 (en) 2009-06-05 2014-06-24 Qualcomm Incorporated 4X4 transform for media coding
US9118898B2 (en) * 2009-06-24 2015-08-25 Qualcomm Incorporated 8-point transform for media data coding
US8451904B2 (en) * 2009-06-24 2013-05-28 Qualcomm Incorporated 8-point transform for media data coding
US9081733B2 (en) * 2009-06-24 2015-07-14 Qualcomm Incorporated 16-point transform for media data coding
US9075757B2 (en) * 2009-06-24 2015-07-07 Qualcomm Incorporated 16-point transform for media data coding
US9185422B2 (en) 2010-07-15 2015-11-10 Qualcomm Incorporated Variable localized bit-depth increase for fixed-point transforms in video coding
US8417045B2 (en) 2010-07-29 2013-04-09 Infoprint Solutions Company Llc Mechanism for processing order-16 discrete cosine transforms
CN101938654B (zh) * 2010-08-17 2013-04-10 浙江大学 一种变换系数的优化量化方法及装置
CN101968528B (zh) * 2010-08-19 2012-11-07 詹文法 集成电路测试中的测试数据压缩方法
WO2012044076A2 (ko) 2010-09-28 2012-04-05 삼성전자 주식회사 비디오의 부호화 방법 및 장치, 복호화 방법 및 장치
US8620166B2 (en) * 2011-01-07 2013-12-31 Raytheon Bbn Technologies Corp. Holevo capacity achieving joint detection receiver
US9824066B2 (en) 2011-01-10 2017-11-21 Qualcomm Incorporated 32-point transform for media data coding
KR20120098499A (ko) * 2011-02-25 2012-09-05 삼성전자주식회사 영상의 변환 방법 및 장치, 및 영상의 역변환 방법 및 장치
WO2012115487A2 (ko) * 2011-02-25 2012-08-30 삼성전자 주식회사 영상의 변환 및 역변환 방법, 및 이를 이용한 영상의 부호화 및 복호화 장치
US9485108B2 (en) 2011-03-14 2016-11-01 Qualcomm Incorporated System and apparatus for using multichannel file delivery over unidirectional transport (“FLUTE”) protocol for delivering different classes of files in a broadcast network
US9451401B2 (en) 2011-05-27 2016-09-20 Qualcomm Incorporated Application transport level location filtering of internet protocol multicast content delivery
JP6120490B2 (ja) 2011-11-07 2017-04-26 キヤノン株式会社 画像符号化装置、画像符号化方法及びプログラム、画像復号装置、画像復号方法及びプログラム
US9558251B2 (en) * 2012-04-03 2017-01-31 Teradata Us, Inc. Transformation functions for compression and decompression of data in computing environments and systems
CN103491375B (zh) * 2013-05-29 2018-11-02 东南大学 基于binDCT算法的JPEG压缩系统
US10638146B2 (en) 2018-10-01 2020-04-28 Tencent America LLC Techniques for QP coding for 360 image and video coding
US11076152B2 (en) * 2019-03-18 2021-07-27 Sony Group Corporation Quantization step parameter for point cloud compression
CN110856000B (zh) * 2019-10-22 2020-10-27 深圳市华星光电技术有限公司 图像解压缩方法及装置
CN111556313B (zh) * 2020-04-26 2021-05-04 武汉理工大学 基于整数近似的低复杂度dtt与自适应量化的图像压缩方法
CN116366867A (zh) * 2021-12-28 2023-06-30 中国电信股份有限公司 数据变换与恢复方法、装置、系统、电子设备及存储介质

Family Cites Families (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5129015A (en) 1990-04-19 1992-07-07 Ricoh Company Ltd. Apparatus and method for compressing still images without multiplication
US5625713A (en) * 1991-08-09 1997-04-29 Ricoh Corporation Apparatus and method for increasing the throughput of an acoustic or image compression system
US5539836A (en) 1991-12-20 1996-07-23 Alaris Inc. Method and apparatus for the realization of two-dimensional discrete cosine transform for an 8*8 image fragment
US5519503A (en) * 1992-04-13 1996-05-21 Sony Corporation Picture reproducing apparatus
CA2094524A1 (en) 1992-07-30 1994-01-31 Ephraim Feig Digital image processor for color image compression
CA2094523C (en) * 1992-07-30 1999-05-25 Ephraim Feig Digital image processor for color image transmission
US5523847A (en) 1992-10-09 1996-06-04 International Business Machines Corporation Digital image processor for color image compression
JPH0746136A (ja) 1993-01-21 1995-02-14 Ricoh Co Ltd 音響又は画像変換プロセッサ、音響又は画像データ処理装置、音響又は画像データ処理方法、算術プロセッサ、及びデータプロセッサ
JP3289478B2 (ja) 1993-03-05 2002-06-04 カシオ計算機株式会社 ビットシリアルデジタル信号処理装置
JPH06334986A (ja) * 1993-05-19 1994-12-02 Sony Corp 重み付きコサイン変換方法
JP3076201B2 (ja) * 1994-07-28 2000-08-14 日本電気株式会社 画像データ伸張方式
CN1076838C (zh) * 1994-08-19 2001-12-26 财团法人工业技术研究院 离散余弦转换/反离散余弦转换电路的转置存储器
US5748786A (en) * 1994-09-21 1998-05-05 Ricoh Company, Ltd. Apparatus for compression using reversible embedded wavelets
US5867602A (en) * 1994-09-21 1999-02-02 Ricoh Corporation Reversible wavelet transform and embedded codestream manipulation
US6058215A (en) * 1997-04-30 2000-05-02 Ricoh Company, Ltd. Reversible DCT for lossless-lossy compression
US6222944B1 (en) * 1998-05-07 2001-04-24 Sarnoff Corporation Down-sampling MPEG image decoder
US6189021B1 (en) 1998-09-15 2001-02-13 Winbond Electronics Corp. Method for forming two-dimensional discrete cosine transform and its inverse involving a reduced number of multiplication operations
WO2001031906A2 (en) 1999-10-23 2001-05-03 Fastvideo Llc Method for local zerotree image coding
US7082450B2 (en) 2001-08-30 2006-07-25 Nokia Corporation Implementation of a transform and of a subsequent quantization
US6856701B2 (en) 2001-09-14 2005-02-15 Nokia Corporation Method and system for context-based adaptive binary arithmetic coding
CN100454339C (zh) 2001-09-14 2009-01-21 诺基亚有限公司 基于上下文的自适应二进制算术编码的方法和系统
US6950469B2 (en) 2001-09-17 2005-09-27 Nokia Corporation Method for sub-pixel value interpolation
US6690307B2 (en) 2002-01-22 2004-02-10 Nokia Corporation Adaptive variable length coding of digital video
RU2322770C2 (ru) 2002-04-23 2008-04-20 Нокиа Корпорейшн Способ и устройство для указания параметров квантователя в системе видеокодирования
FI114679B (fi) 2002-04-29 2004-11-30 Nokia Corp Satunnaisaloituspisteet videokoodauksessa
US6795584B2 (en) 2002-10-03 2004-09-21 Nokia Corporation Context-based adaptive variable length coding for adaptive block transforms
KR101089489B1 (ko) 2003-11-18 2011-12-02 스칼라도 아베 디지털 이미지 처리 방법 및 이미지 표현 포맷
US8116374B2 (en) * 2004-05-07 2012-02-14 Broadcom Corporation Method and system for generating a transform size syntax element for video decoding
SE533185C2 (sv) 2007-02-16 2010-07-13 Scalado Ab Metod för behandling av en digital bild samt bildrepresentationsformat
SE531398C2 (sv) 2007-02-16 2009-03-24 Scalado Ab Generering av en dataström och identifiering av positioner inuti en dataström
CN101658042B (zh) 2007-03-13 2016-03-02 诺基亚技术有限公司 用于视频编码和解码的系统和方法
BRPI0809668B1 (pt) 2007-04-09 2020-07-28 Nokia Technologies Oy vetores de movimento de alta precisão para codificação de vídeos com baixa complexidade de codificação e decodificação
EP2193825B1 (de) 2008-12-03 2017-03-22 Alcatel Lucent Mobile Vorrichtung für Anwendungen mit erweiteter Realität
RU2542946C2 (ru) 2009-11-19 2015-02-27 Нокиа Корпорейшн Способ и устройство для отслеживания и распознавания объектов с использованием дескрипторов, инвариантных относительно вращения

Also Published As

Publication number Publication date
US20060294173A1 (en) 2006-12-28
KR100912415B1 (ko) 2009-08-14
MXPA04001724A (es) 2004-05-31
EP1914894A3 (de) 2009-05-06
KR20040036923A (ko) 2004-05-03
EP1440515B1 (de) 2008-07-16
EP1914894B1 (de) 2021-05-05
US7082450B2 (en) 2006-07-25
ATE401703T1 (de) 2008-08-15
CN100392982C (zh) 2008-06-04
JP2005501462A (ja) 2005-01-13
JP4153425B2 (ja) 2008-09-24
CN101261619B (zh) 2013-06-05
EP1440515A2 (de) 2004-07-28
US10515134B2 (en) 2019-12-24
WO2003019787A2 (en) 2003-03-06
JP4444940B2 (ja) 2010-03-31
CN1575546A (zh) 2005-02-02
HUP0401627A2 (en) 2004-11-29
DE60227688D1 (de) 2008-08-28
CN101261619A (zh) 2008-09-10
WO2003019787A3 (en) 2004-05-06
JP2007129731A (ja) 2007-05-24
HK1122622A1 (en) 2009-05-22
EP1914894A2 (de) 2008-04-23
ZA200401224B (en) 2005-06-29
US20100195923A1 (en) 2010-08-05
US20030078953A1 (en) 2003-04-24
HU228603B1 (en) 2013-04-29
AU2002328100A1 (en) 2003-03-10

Similar Documents

Publication Publication Date Title
DE60227688C5 (de) Implementierung von einer transformation und einer nachfolgenden quantisierung
DE69220541T2 (de) Adaptive Quantisierung innerhalb des Sequentiellmodus der JPEG
AU2005237142B2 (en) Reversible transform for lossy and lossless 2-D data compression
CA2737864A1 (en) Method for reduced bit-depth quantization
EP2288162A3 (de) Verfahren zur Erzeugung eines dequantizierten DC-Chrominanz Koeffizient
EP1294198A3 (de) Verbesserte Blocktransformbildkodierung und -videokodierung, Verbesserte Bildsignalquantisierung und Videosignalquantisierung
JP2005501462A5 (de)
US6411740B1 (en) Method for non-uniform quantization in a resolution hierarchy by use of a nonlinearity
KR940008495A (ko) 화상데이타의 압축, 해제방법 및 그 장치
US6675185B1 (en) Hybrid domain processing of multi-dimensional transformed data
US7046852B2 (en) Fast image decompression via look up table
EP1705923A3 (de) Analoge Recheneinheit zur Ermittlung der Summen von Produkten
Lee et al. Comparison of image transforms in the coding of the displaced frame difference for block-based motion compensation
Cheung et al. A novel multiwavelet-based integer transform for lossless image coding
KR970057914A (ko) 블럭 간 상관관계를 이용하는 부호화 기법 및 장치
KR940003199A (ko) 적응 양자화 기능을 갖는 영상압축 및 신장방법과 그 장치
JPH04117088A (ja) 画像符号化用ｋｌ変換演算量低減方法
JPH0746407A (ja) 画像データ圧縮装置および画像データ復元装置
KR20050061448A (ko) 부호기 내에서 데이터를 통신하는 방법
Furuta GENERALIZED FURUTA INEQUALITY IN BANACH∗–ALGEBRAS AND ITS APPLICATIONS
JPH03238564A (ja) 画像データ符号化及び復元方法並びに装置
KR960036718A (ko) 영상 신호 부호화 장치
JPH03270573A (ja) 画像データ符号化装置及び画像データ復号化装置

Legal Events

Date Code Title Description
8364 No opposition during term of opposition