US6137915A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus and method for error concealment for hierarchical subband coding and decoding
Assignee: Sharp Corp
•
Filing: 1999-08-19
•
Granted: 2000-10-24
•
Expires: 2019-08-19
Abstract
Abstract An apparatus and a method for concealing errors in a hierarchical subband coding/decoding system. Specifically, error concealment of a corrupted or missing coefficient is achieved by using uncorrupted coefficient(s) or a window of coefficients corresponding to the same spatial location from other subbands.
Inventors
- 👤 Bing-Bing Chai
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 12:31
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/85; H04N19/89; H04N19/895; H04N19/60; H04N19/63; H04N19/61; H04N19/65
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
104 words
A method for concealing an error in an image, where said image is encoded using hierarchical subband decomposition that decomposes said image into a plurality of subbands, said method comprising the steps of: (a) detecting at least one corrupted transform coefficient at a spatial location in a first subband; (b) correlating at least one uncorrupted transform coefficient from at least one other subband at a same decomposition level for said same spatial location of said detected corrupted transform coefficient; and (c) generating a replacement transform coefficient using said at least one uncorrupted transform coefficient for replacing said detected at least one corrupted transform coefficient.
Claim 2
Independent Claim
104 words
A method for concealing an error in an image, where said image is encoded using hierarchical subband decomposition that decomposes said image into a plurality of subbands, said method comprising the steps of: (a) detecting at least one corrupted transform coefficient at a spatial location in a first subband; (b) correlating at least one uncorrupted transform coefficient from at least one other subband at a same decomposition level for said same spatial location of said detected corrupted transform coefficient; and (c) generating a replacement transform coefficient using said at least one uncorrupted transform coefficient for replacing said detected at least one corrupted transform coefficient.
Claim 3
Dependent Claim
20 words
The method of claim 1, wherein said at least one other subband comprises a second subband and a third subband.
Claim 4
Dependent Claim
41 words
The method of claim 1, wherein said correlating step b) correlates said at least one uncorrupted transform coefficient by using a window function of transform coefficients around a neighborhood that corresponds to said spatial location of said detected corrupted transform coefficient.
Claim 5
Dependent Claim
78 words
The method of claim 3, wherein said window function is implemented in accordance with: |x.sub.0 |=max [|f(y.sub.i, z.sub.j ; y.sub.i, εw(x.sub.1), z.sub.j εw(x.sub.2))|, 1] where x 0 is said replacement transform coefficient, where w(x) is a set of non-corrupted coefficients in a neighborhood of x, where x 1 and x 2 are said at least one uncorrupted transform coefficient from at least one other subband, where f is a function of pixels y i , z j .
Claim 6
Dependent Claim
40 words
The method of claim 1, wherein said correlating step b) further correlates at least one uncorrupted transform coefficient from at least one other subband at a different decomposition level for said same spatial location of said detected corrupted transform coefficient.
Claim 7
Dependent Claim
50 words
The method of claim 1, wherein said detecting step a) detects said at east one corrupted transform coefficient at a spatial location in a first subband by detecting a first texture unit number to be less than or equal to a last texture unit number of a previously decoded packet.
Claim 8
Dependent Claim
46 words
The method of claim 1, wherein said detecting step a) detects said at least one corrupted transform coefficient at a spatial location in a first subband by detecting a first texture unit number to be greater than a last texture unit number of a present packet.
Claim 9
Dependent Claim
35 words
The method of claim 1, wherein said detecting step a) detects said at least one corrupted transform coefficient at a spatial location in a first subband by detecting an occurrence of a forbidden bit pattern.
Claim 10
Dependent Claim
57 words
The method of claim 1, wherein said detecting step a) detects said at least one corrupted transform coefficient at a spatial location in a first subband by detecting a total number of texture units in a present packet to be different from a last texture unit number minus a first texture unit number plus a value one.
Claim 11
Dependent Claim
32 words
The method of claim 1, wherein said detecting step a) detects said at least one corrupted transform coefficient at a spatial location in a first subband by detecting an unexpected packet size.
Claim 12
Independent Claim
104 words
An apparatus for concealing an error in an image, where said image is encoded using hierarchical subband decomposition that decomposes said image into a plurality of subbands, said apparatus comprising: means for detecting at least one corrupted transform coefficient at a spatial location in a first subband; means for correlating at least one uncorrupted transform coefficient from at least one other subband at a same decomposition level for said same spatial location of said detected corrupted transform coefficient; and means for generating a replacement transform coefficient using said at least one uncorrupted transform coefficient for replacing said detected at least one corrupted transform coefficient.
Claim 13
Independent Claim
104 words
An apparatus for concealing an error in an image, where said image is encoded using hierarchical subband decomposition that decomposes said image into a plurality of subbands, said apparatus comprising: means for detecting at least one corrupted transform coefficient at a spatial location in a first subband; means for correlating at least one uncorrupted transform coefficient from at least one other subband at a same decomposition level for said same spatial location of said detected corrupted transform coefficient; and means for generating a replacement transform coefficient using said at least one uncorrupted transform coefficient for replacing said detected at least one corrupted transform coefficient.
Claim 14
Dependent Claim
20 words
The apparatus of claim 11, wherein said at least one other subband comprises a second subband and a third subband.
Claim 15
Dependent Claim
35 words
The apparatus of claim 11, wherein said at least one uncorrupted transform coefficient comprises a window function of transform coefficients around a neighborhood that corresponds to said spatial location of said detected corrupted transform coefficient.
Claim 16
Dependent Claim
78 words
The apparatus of claim 13, wherein said window function is implemented in accordance with: |x.sub.0 |=max [|f(y.sub.i, z.sub.j ; y.sub.i, εw(x.sub.1), z.sub.j εw(x.sub.2))|, 1] where x 0 is said replacement transform coefficient, where w(x) is a set of non-corrupted coefficients in a neighborhood of x, where x 1 and x 2 are said at least one uncorrupted transform coefficient from at least one other subband, where f is a function of pixels y i , z j .
Claim 17
Dependent Claim
36 words
The apparatus of claim 11, wherein said at least one uncorrupted transform coefficient is from at least one other subband at a different decomposition level for said same spatial location of said detected corrupted transform coefficient.
Claim 18
Dependent Claim
102 words
A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform the steps comprising of: (a) detecting at least one corrupted transform coefficient at a spatial location in a first subband; (b) correlating at least one uncorrupted transform coefficient from at least one other subband at a same decomposition level for said same spatial location of said detected corrupted transform coefficient; and (c) generating a replacement transform coefficient using said at least one uncorrupted transform coefficient for replacing said detected at least one corrupted transform coefficient.
Claim 19
Dependent Claim
102 words
A computer-readable medium having stored thereon a plurality of instructions, the plurality of instructions including instructions which, when executed by a processor, cause the processor to perform the steps comprising of: (a) detecting at least one corrupted transform coefficient at a spatial location in a first subband; (b) correlating at least one uncorrupted transform coefficient from at least one other subband at a same decomposition level for said same spatial location of said detected corrupted transform coefficient; and (c) generating a replacement transform coefficient using said at least one uncorrupted transform coefficient for replacing said detected at least one corrupted transform coefficient.
Claim 20
Dependent Claim
21 words
The computer-readable medium of claim 16, wherein said at least one other subband comprises a second subband and a third subband.
Claim 21
Dependent Claim
42 words
The computer-readable medium of claim 16, wherein said correlating step b) correlates said at least one uncorrupted transform coefficient by using a window function of transform coefficients around a neighborhood that corresponds to said spatial location of said detected corrupted transform coefficient.
Claim 22
Dependent Claim
79 words
The computer-readable medium of claim 18, wherein said window function is implemented in accordance with: |x.sub.0 |=max [f(y.sub.i, z.sub.j ; y.sub.i εw(x.sub.1), z.sub.j εw(x.sub.2))|, 1] where x 0 is said replacement transform coefficient, where w(x) is a set of non-corrupted coefficients in a neighborhood of x, where x 1 and x 2 are said at least one uncorrupted transform coefficient from at least one other subband, where f is a function of pixels y i , z j .
Claim 23
Dependent Claim
41 words
The computer-readable medium of claim 16, wherein said correlating step b) further correlates at least one uncorrupted transform coefficient from at least one other subband at a different decomposition level for said same spatial location of said detected corrupted transform coefficient.
References Cited (Backward Citations)
US5353059A
Cited
US5268961A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-10-24 | 2004-04-24 | 2004-10-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-10-24 | 2008-04-24 | 2008-10-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-10-24 | 2012-04-24 | 2012-10-24 | $7700.00 | Window Closed / Lapsed |