Patent US6636637B1 successfully refreshed from Google Patents.
← Back to Patent Explorer
US6636637B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Method and arrangement for coding and decoding a digitized image

Assignee: Siemens AG
•
Filing: 1998-01-07
•
Granted: 2003-10-21
•
Expires: 2018-01-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The method and apparatus have a shape-adapted transformation coding is in which in the intra-image coding and the inter-image coding different shape-adapted transformation codings are carried out. A first shape-adapted transformation coding takes place in the intra-image coding, and a second shape-adapted transformation coding, different from the first shape-adapted image coding, takes place in the inter-image coding.

Inventors

  • 👤 Andre Kaup

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 21:33
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/60; H04N19/649; H04N19/10; H04N19/102; H04N19/12; H04N19/122; H04N19/124; H04N19/134; H04N19/136; H04N19/14; H04N19/157; H04N19/159; H04N19/169; H04N19/17; H04N19/176; H04N19/18; H04N19/61

Claims Analysis

Total Claims: 28
Claim 1
Independent Claim 98 words
A method for coding a digitized image that have image objects with a number of image points, comprising the steps of: performing image coding in one of an intra-image coding mode or in an inter-image coding mode; transforming in the intra-image coding mode the image information of the image points; transforming in the inter-image coding mode difference image information of image information of two successive images; carrying out in the inter-image coding mode a first shape-adapted transformation coding; and carrying out in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding.
Claim 2
Independent Claim 98 words
A method for coding a digitized image that have image objects with a number of image points, comprising the steps of: performing image coding in one of an intra-image coding mode or in an inter-image coding mode; transforming in the intra-image coding mode the image information of the image points; transforming in the inter-image coding mode difference image information of image information of two successive images; carrying out in the inter-image coding mode a first shape-adapted transformation coding; and carrying out in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding.
Claim 3
Dependent Claim 39 words
The method according to claim 1 , wherein a variant of a shape-adapted discrete cosine transformation is used as a first shape-adapted transformation coding, and wherein a shape-adapted discrete cosine transformation is used as a second shape-adapted transformation coding.
Claim 4
Dependent Claim 57 words
The method according to claim 1 , wherein at least one of the first shape-adapted transformation coding and the second shape-adapted transformation coding takes place such that a signal energy of the image points to be transformed in a spatial domain is approximately equal to a signal energy of the transformed image points in the frequency domain.
Claim 5
Independent Claim 173 words
A method for coding a digitized image that have image objects with a number of image points, comprising the steps of: performing image coding in one of an intra-image coding mode or in an inter-image coding mode; transforming in the intra-image coding mode the image information of the image points; transforming in the inter-image coding mode difference image information of image information of two successive images; carrying out in the inter-image coding mode a first shape-adapted transformation coding; and carrying out in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding; wherein transformation coefficients c j of the image points x j transformed according to the first shape-adapted transformation coding are formed according to the following rule: c j =((2 /N )) DCT−N ( p,k )· x j , whereby N designates a size of an image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1).
Claim 6
Independent Claim 173 words
A method for coding a digitized image that have image objects with a number of image points, comprising the steps of: performing image coding in one of an intra-image coding mode or in an inter-image coding mode; transforming in the intra-image coding mode the image information of the image points; transforming in the inter-image coding mode difference image information of image information of two successive images; carrying out in the inter-image coding mode a first shape-adapted transformation coding; and carrying out in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding; wherein transformation coefficients c j of the image points x j transformed according to the first shape-adapted transformation coding are formed according to the following rule: c j =((2 /N )) DCT−N ( p,k )· x j , whereby N designates a size of an image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1).
Claim 7
Dependent Claim 20 words
The method according to claim 1 , wherein the first shape-adapted transformation coding is applied only to edge image blocks.
Claim 8
Independent Claim 104 words
A method for decoding a digitized image that have image objects with a number of image points, comprising the steps of: performing the image decoding in at least one of an intra-image decoding mode or in an inter-image decoding mode; transforming in the intra-image decoding mode the image information of the image points; transforming in the inter-image decoding mode difference image information of image information of two successive images; carrying out in the inter-image decoding mode a first inverse shape-adapted transformation coding; and carrying out in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding.
Claim 9
Independent Claim 104 words
A method for decoding a digitized image that have image objects with a number of image points, comprising the steps of: performing the image decoding in at least one of an intra-image decoding mode or in an inter-image decoding mode; transforming in the intra-image decoding mode the image information of the image points; transforming in the inter-image decoding mode difference image information of image information of two successive images; carrying out in the inter-image decoding mode a first inverse shape-adapted transformation coding; and carrying out in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding.
Claim 10
Dependent Claim 43 words
The method according to claim 6 , wherein a variant of a shape-adapted inverse discrete cosine transformation is used as a first inverse shape-adapted transformation coding, and wherein an inverse shape-adapted discrete cosine transformation is used as a second inverse shape-adapted transformation coding.
Claim 11
Dependent Claim 59 words
The method according to claim 6 , wherein at least one of the first inverse shape-adapted transformation coding and the second inverse shape-adapted transformation coding takes place such that a signal energy of the image points to be transformed in a spatial domain is approximately equal to a signal energy of the transformed image points in the frequency domain.
Claim 12
Independent Claim 188 words
A method for decoding a digitized image that have image objects with a number of image points, comprising the steps of: performing the image decoding in at least one of an intra-image decoding mode or in an inter-image decoding mode; transforming in the intra-image decoding mode the image information of the image points; transforming in the inter-image decoding mode difference image information of image information of two successive images; carrying out in the inter-image decoding mode a first inverse shape-adapted transformation coding; and carrying out in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding; wherein, in the first inverse shape-adapted transformation coding, transformed image points x j are formed from transformation coefficients c j according to the following rule: x j =((2 /N ))( DCT−N ( p,k )) −1 ·c j , whereby N designates a size of the image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1), ( ) − designates an inversion of a matrix.
Claim 13
Independent Claim 188 words
A method for decoding a digitized image that have image objects with a number of image points, comprising the steps of: performing the image decoding in at least one of an intra-image decoding mode or in an inter-image decoding mode; transforming in the intra-image decoding mode the image information of the image points; transforming in the inter-image decoding mode difference image information of image information of two successive images; carrying out in the inter-image decoding mode a first inverse shape-adapted transformation coding; and carrying out in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding; wherein, in the first inverse shape-adapted transformation coding, transformed image points x j are formed from transformation coefficients c j according to the following rule: x j =((2 /N ))( DCT−N ( p,k )) −1 ·c j , whereby N designates a size of the image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1), ( ) − designates an inversion of a matrix.
Claim 14
Dependent Claim 21 words
The method according to claim 6 , wherein the first inverse shape-adapted transformation coding is applied only to edge image blocks.
Claim 15
Dependent Claim 121 words
An arrangement for coding a digitized image having image objects with a number of image points, comprising: device for receiving image point of the digitized image; and a processor unit connected to said device and structured such that the image coding takes place in one of an intra-image coding mode or in an inter-image coding mode, in the intra-image coding mode the image information of the image points is transformed, in the inter-image coding mode difference image information of image information of two successive images is transformed, in the inter-image coding mode a first shape-adapted transformation coding is carried out, and in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding, is carried out.
Claim 16
Dependent Claim 121 words
An arrangement for coding a digitized image having image objects with a number of image points, comprising: device for receiving image point of the digitized image; and a processor unit connected to said device and structured such that the image coding takes place in one of an intra-image coding mode or in an inter-image coding mode, in the intra-image coding mode the image information of the image points is transformed, in the inter-image coding mode difference image information of image information of two successive images is transformed, in the inter-image coding mode a first shape-adapted transformation coding is carried out, and in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding, is carried out.
Claim 17
Dependent Claim 45 words
The arrangement according to claim 11 , wherein the processor unit is structured such that a variant of a shape-adapted discrete cosine transformation is used as a first shape-adapted transformation coding, and a shape-adapted discrete cosine transformation is used as a second shape-adapted transformation coding.
Claim 18
Dependent Claim 63 words
The arrangement according to claim 11 , wherein the processor unit is structured such that at least one of the first shape-adapted transformation coding and the second shape-adapted transformation coding takes place such that a signal energy of the image points to be transformed in a spatial domain is approximately equal to a signal energy of transformed image points in a frequency domain.
Claim 19
Dependent Claim 204 words
A arrangement for coding a digitized image having image objects with a number of image points, comprising: device for receiving image point of the digitized image; and a processor unit connected to said device and structured such that the image coding takes place in one of an intra-image coding mode or in an inter-image coding mode, in the intra-image coding mode the image information of the image points is transformed, in the inter-image coding mode difference image information of image information of two successive images is transformed, in the inter-image coding mode a first shape-adapted transformation coding is carried out, and in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding, is carried out; wherein the processor unit is set up such that transformation coefficients c j of the image points x j transformed according to the first shape-adapted transformation coding are formed according to the following rule: c j =((2 /N )) DCT−N ( p,k )· x j , whereby N designates a size of an image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1).
Claim 20
Dependent Claim 204 words
A arrangement for coding a digitized image having image objects with a number of image points, comprising: device for receiving image point of the digitized image; and a processor unit connected to said device and structured such that the image coding takes place in one of an intra-image coding mode or in an inter-image coding mode, in the intra-image coding mode the image information of the image points is transformed, in the inter-image coding mode difference image information of image information of two successive images is transformed, in the inter-image coding mode a first shape-adapted transformation coding is carried out, and in the intra-image coding mode a second shape-adapted transformation coding, different from the first shape-adapted transformation coding, is carried out; wherein the processor unit is set up such that transformation coefficients c j of the image points x j transformed according to the first shape-adapted transformation coding are formed according to the following rule: c j =((2 /N )) DCT−N ( p,k )· x j , whereby N designates a size of an image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1).
Claim 21
Dependent Claim 27 words
The arrangement according to claim 11 , wherein the processor unit is structured such that the first shape-adapted transformation coding is applied only to edge image blocks.
Claim 22
Dependent Claim 125 words
An arrangement for decoding a digitized image having image objects having an arbitrary number of image points, comprising: device for receiving image points of the digitized image; and a processor unit connected to the device and structured such that the image decoding takes place in one of an intra-image decoding mode or in an inter-image decoding mode, in the intra-image decoding mode the image information of the image points is transformed, in the inter-image decoding mode difference image information of image information of two successive images is transformed, in the inter-image decoding mode a first inverse shape-adapted transformation coding is carried out, and in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding, is carried out.
Claim 23
Dependent Claim 125 words
An arrangement for decoding a digitized image having image objects having an arbitrary number of image points, comprising: device for receiving image points of the digitized image; and a processor unit connected to the device and structured such that the image decoding takes place in one of an intra-image decoding mode or in an inter-image decoding mode, in the intra-image decoding mode the image information of the image points is transformed, in the inter-image decoding mode difference image information of image information of two successive images is transformed, in the inter-image decoding mode a first inverse shape-adapted transformation coding is carried out, and in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding, is carried out.
Claim 24
Dependent Claim 47 words
The arrangement according to claim 16 , wherein the processor unit is such that a variant of a shape-adapted inverse discrete cosine transformation is used as a first inverse shape-adapted transformation coding, and an inverse shape-adapted discrete cosine transformation is used as second inverse shape-adapted transformation coding.
Claim 25
Dependent Claim 64 words
The arrangement according to claim 16 , the processor unit is structured such that at least one of the first inverse shape-adapted transformation coding and the second inverse shape-adapted transformation coding takes place such that a signal energy of the image points to be transformed in a spatial domain is approximately equal to a signal energy of transformed image points in a frequency domain.
Claim 26
Dependent Claim 216 words
A arrangement for decoding a digitized image having image objects having an arbitrary number of image points, comprising: device for receiving image points of the digitized image; and a processor unit connected to the device and structured such that the image decoding takes place in one of an intra-image decoding mode or in an inter-image decoding mode, in the intra-image decoding mode the image information of the image points is transformed, in the inter-image decoding mode difference image information of image information of two successive images is transformed, in the inter-image decoding mode a first inverse shape-adapted transformation coding is carried out, and in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding, is carried out; wherein the processor unit is structured such that image points x j transformed in the first inverse shape-adapted transformation coding are formed from transformation coefficients c j according to the following rule: x j =((2 /N ))( DCT−N ( p,k )) −1 ·c j , whereby N designates a size of the image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1), ( ) − designates an inversion of a matrix.
Claim 27
Dependent Claim 216 words
A arrangement for decoding a digitized image having image objects having an arbitrary number of image points, comprising: device for receiving image points of the digitized image; and a processor unit connected to the device and structured such that the image decoding takes place in one of an intra-image decoding mode or in an inter-image decoding mode, in the intra-image decoding mode the image information of the image points is transformed, in the inter-image decoding mode difference image information of image information of two successive images is transformed, in the inter-image decoding mode a first inverse shape-adapted transformation coding is carried out, and in the intra-image decoding mode a second inverse shape-adapted transformation coding, different from the first inverse shape-adapted transformation coding, is carried out; wherein the processor unit is structured such that image points x j transformed in the first inverse shape-adapted transformation coding are formed from transformation coefficients c j according to the following rule: x j =((2 /N ))( DCT−N ( p,k )) −1 ·c j , whereby N designates a size of the image vector to be transformed in which the transformed image points are contained, DCT−N designates a transformation matrix of size N×N, p, k designate indices, with p, k ε(0, N−1), ( ) − designates an inversion of a matrix.
Claim 28
Dependent Claim 28 words
The arrangement according to claim 16 , wherein the processor unit is structured such that the first inverse shape-adapted transformation coding is applied only to edge image blocks.

References Cited (Backward Citations)

US6049629A Cited
US5802213A Cited
US6222881B1 Cited
US5978514A Cited
US6324301B1 Cited
US5946419A Cited
US5748789A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2006-10-20 2007-04-21 2007-10-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2010-10-20 2011-04-21 2011-10-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2014-10-20 2015-04-21 2015-10-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag