US5504530A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for coding and decoding image signals
Assignee: Sony Corp
•
Filing: 1993-06-25
•
Granted: 1996-04-02
•
Expires: 2013-06-25
Abstract
Abstract A compression-coded high definition television signal is decoded and converted to a standard NTSC signal without loss of interlacing so that the resulting picture exhibits smooth motion. The compression-coding of the HDTV signal includes DCT processing to produce an 8×8 block of coefficient data. Upon decoding, the upper left quadrant of the coefficient data array is used to form a 4×4 subblock of coefficient data but the last row of elements of the subblock is replaced by corresponding elements of the eighth row of the 8×8 block of coefficient data.
Inventors
- 👤 Nobuhisa Obikane
- 👤 Katsumi Tahara
- 👤 Yoichi Yagasaki
- 👤 Jun Yonemitsu
- 👤 Teruhiko Suzuki
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 00:37
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/50; H04N19/503; H04N19/51; H04N19/577; H04N19/10; H04N19/102; H04N19/103; H04N19/107; H04N19/112; H04N19/12; H04N19/122; H04N19/124; H04N19/132; H04N19/134; H04N19/136; H04N19/137; H04N19/146; H04N19/152; H04N19/169; H04N19/17; H04N19/174; H04N19/176; H04N19/18; H04N19/46; H04N19/59; H04N19/60; H04N19/61
Claims Analysis
Total Claims: 25
Claim 1
Independent Claim
97 words
A method of decoding image data in the form of a block of coefficient data elements produced by performing an orthogonal transformation upon a block of picture element data, comprising the steps of: forming from said block of coefficient data elements a first subblock having a smaller range than said block; forming a modified subblock by replacing at least one element of said first subblock with a corresponding at least one element of said block from outside of said first subblock; and performing an inverse orthogonal transformation on said modified subblock to produce reconstituted picture element data.
Claim 2
Independent Claim
97 words
A method of decoding image data in the form of a block of coefficient data elements produced by performing an orthogonal transformation upon a block of picture element data, comprising the steps of: forming from said block of coefficient data elements a first subblock having a smaller range than said block; forming a modified subblock by replacing at least one element of said first subblock with a corresponding at least one element of said block from outside of said first subblock; and performing an inverse orthogonal transformation on said modified subblock to produce reconstituted picture element data.
Claim 3
Dependent Claim
101 words
A method of decoding image data according to claim 1, wherein said block of coefficient data elements represents coefficient data elements arrayed in m rows and n columns, and said first subblock represents an intersection of a first j rows and a first k columns of said block of coefficient data elements, j being less than m, k being less than n; and said step of forming said modified subblock includes replacing a last j row of elements of said first subblock with corresponding elements of a last m row of said block, j, k, m, and n being positive integers.
Claim 4
Dependent Claim
30 words
A method of decoding image data according to claim 1, wherein said orthogonal transformation is a discrete cosine transform and said inverse orthogonal transformation is an inverse discrete cosine transform.
Claim 5
Dependent Claim
102 words
A method of decoding image data according to claim 1, wherein said block of picture element data is produced from a frame of picture element data consisting of two interlaced fields, said coefficient data elements having been produced on the basis of differences between reference picture data and encoding predictive picture data generated with motion compensation in one of a frame predictive mode and a field predictive mode; and further comprising the steps of: generating decoding predictive picture data using motion compensation in said one of said predictive modes; and combining said reconstituted picture element data and said decoding predictive picture data.
Claim 6
Dependent Claim
30 words
A method of decoding image data according to claim 4, wherein said decoding predictive picture data includes picture elements that correspond to picture elements of said encoding predictive picture data.
Claim 7
Dependent Claim
46 words
A method of decoding image data according to claim 4, wherein positions of picture elements of said decoding predictive picture data coincide with positions of corresponding picture elements of said encoding predictive picture data, if said one of said predictive modes is said field predictive mode.
Claim 8
Dependent Claim
50 words
A method of decoding image data according to claim 4, wherein a field parity of picture elements of said decoding predictive picture data coincides with a field parity of corresponding picture elements of said encoding predictive picture data, if said one of said predictive modes is said frame predictive mode.
Claim 9
Dependent Claim
37 words
A method of decoding image data according to claim 7, wherein picture elements of said decoding predictive picture data are formed by interpolation if corresponding picture elements of said encoding predictive picture data were formed by interpolation.
Claim 10
Independent Claim
106 words
A method of decoding image data in the form of a block of coefficient data elements produced by performing an orthogonal transformation upon a block of picture element data, comprising the steps of: forming from said block of coefficient data elements a first subblock having a smaller range than said block; forming a modified subblock by replacing at least one element of said first subblock with a sum of said at least one element and a corresponding at least one element of said block from outside of said first subblock; and performing an inverse orthogonal transformation on said modified subblock to produce reconstituted picture element data.
Claim 11
Independent Claim
106 words
A method of decoding image data in the form of a block of coefficient data elements produced by performing an orthogonal transformation upon a block of picture element data, comprising the steps of: forming from said block of coefficient data elements a first subblock having a smaller range than said block; forming a modified subblock by replacing at least one element of said first subblock with a sum of said at least one element and a corresponding at least one element of said block from outside of said first subblock; and performing an inverse orthogonal transformation on said modified subblock to produce reconstituted picture element data.
Claim 12
Dependent Claim
30 words
A method of decoding image data according to claim 9, wherein said orthogonal transformation is a discrete cosine transform and said inverse orthogonal transformation is an inverse discrete cosine transform.
Claim 13
Dependent Claim
102 words
A method of decoding image data according to claim 9, wherein said block of picture element data is produced from a frame of picture element data consisting of two interlaced fields, said coefficient data elements having been produced on the basis of differences between reference picture data and encoding predictive picture data generated with motion compensation in one of a frame predictive mode and a field predictive mode; and further comprising the steps of: generating decoding predictive picture data using motion compensation in said one of said predictive modes; and combining said reconstituted picture element data and said decoding predictive picture data.
Claim 14
Dependent Claim
30 words
A method of decoding image data according to claim 11, wherein said decoding predictive picture data includes picture elements that correspond to picture elements of said encoding predictive picture data.
Claim 15
Dependent Claim
46 words
A method of decoding image data according to claim 11, wherein positions of picture elements of said decoding predictive picture data coincide with positions of corresponding picture elements of said encoding predictive picture data, if said one of said predictive modes is said field predictive mode.
Claim 16
Dependent Claim
50 words
A method of decoding image data according to claim 11, wherein a field parity of picture elements of said decoding predictive picture data coincides with a field parity of corresponding picture elements of said encoding predictive picture data, if said one of said predictive modes is said frame predictive mode.
Claim 17
Dependent Claim
37 words
A method of decoding image data according to claim 14, wherein picture elements of said decoding predictive picture data are formed by interpolation if corresponding picture elements of said encoding predictive picture data were formed by interpolation.
Claim 18
Independent Claim
151 words
A method of decoding image data in the form of a block of coefficient data elements produced by performing an orthogonal transformation upon a block of picture element data, wherein said block of coefficient data represents coefficient data elements arrayed in m rows and n columns, comprising the steps of: forming from said block of coefficient data elements a first subblock having a smaller range than said block, said first subblock represents an intersection of the first j rows and first k columns of said block of coefficient data elements, j being less than m, k being less than n; forming a modified subblock by replacing at least each element of the last row of said first subblock with a sum of said element and a corresponding element of the last row of said block; and performing an inverse orthogonal transformation on said modified subblock to produce reconstituted picture element data.
Claim 19
Independent Claim
151 words
A method of decoding image data in the form of a block of coefficient data elements produced by performing an orthogonal transformation upon a block of picture element data, wherein said block of coefficient data represents coefficient data elements arrayed in m rows and n columns, comprising the steps of: forming from said block of coefficient data elements a first subblock having a smaller range than said block, said first subblock represents an intersection of the first j rows and first k columns of said block of coefficient data elements, j being less than m, k being less than n; forming a modified subblock by replacing at least each element of the last row of said first subblock with a sum of said element and a corresponding element of the last row of said block; and performing an inverse orthogonal transformation on said modified subblock to produce reconstituted picture element data.
Claim 20
Dependent Claim
14 words
A method of decoding image data according to claim 16, wherein m=n and j=k.
Claim 21
Dependent Claim
14 words
A method of decoding image data according to claim 17, wherein m=n=8 and j=k=4.
Claim 22
Independent Claim
207 words
An apparatus for decoding a block of image data that was generated by performing an orthogonal transformation upon a block of picture element data from a frame of picture elements consisting of two interlaced fields, said orthogonal transformation producing a block of coefficient data elements representing coefficient data elements arrayed in m rows and n columns, and then quantizing and variable-length-encoding said block of coefficient data elements; the apparatus comprising: variable length decoding means for performing variable length decoding upon said image data to form decoded data; dequantization means for dequantizing the decoded data to recover said block of coefficient data elements; subblock forming means for forming a j row by k column subblock from said recovered block of coefficient data elements, j being less than m, k being less than n, the first j-1 rows of said subblock being formed as an intersection of the first j-1 rows and first k columns of said recovered block of coefficient data elements, each element of the jth row of said subblock being formed as the sum of respective corresponding elements of the jth and mth rows of said recovered block of coefficient data elements; and inverse orthogonal transformation means for performing an inverse orthogonal transformation upon said subblock.
Claim 23
Independent Claim
207 words
An apparatus for decoding a block of image data that was generated by performing an orthogonal transformation upon a block of picture element data from a frame of picture elements consisting of two interlaced fields, said orthogonal transformation producing a block of coefficient data elements representing coefficient data elements arrayed in m rows and n columns, and then quantizing and variable-length-encoding said block of coefficient data elements; the apparatus comprising: variable length decoding means for performing variable length decoding upon said image data to form decoded data; dequantization means for dequantizing the decoded data to recover said block of coefficient data elements; subblock forming means for forming a j row by k column subblock from said recovered block of coefficient data elements, j being less than m, k being less than n, the first j-1 rows of said subblock being formed as an intersection of the first j-1 rows and first k columns of said recovered block of coefficient data elements, each element of the jth row of said subblock being formed as the sum of respective corresponding elements of the jth and mth rows of said recovered block of coefficient data elements; and inverse orthogonal transformation means for performing an inverse orthogonal transformation upon said subblock.
Claim 24
Dependent Claim
19 words
An apparatus according to claim 19, wherein m=n and j=k, with j, k, m, and n being positive integers.
Claim 25
Dependent Claim
26 words
An apparatus according to claim 19, wherein said orthogonal transformation is a discrete cosine transform and said inverse orthogonal transformation is an inverse discrete cosine transform.
References Cited (Backward Citations)
US5055927A
Cited
JPH03114384A
Cited
US5155593A
Cited
US5196933A
Cited
US5235421A
Cited
US5128791A
Cited
US5049992A
Cited
WO1992006563A2
Cited
EP0535272A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-04-02 | 1999-10-02 | 2000-04-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-04-02 | 2003-10-02 | 2004-04-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-04-02 | 2007-10-02 | 2008-04-02 | $7700.00 | Window Closed / Lapsed |