US5845013A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Region-based texture coding method and decoding method, and corresponding systems
Assignee: US Philips Corp
•
Filing: 1996-10-18
•
Granted: 1998-12-01
•
Expires: 2016-10-18
Abstract
Abstract The invention relates to an image sequence coding method in which images are segmented and coded with respect to their contours and textures. The texture coding step is carried out by means of a lattice vector quantization method adapted to region-based coding schemes where regions have arbitrary shapes, for applications allowing to reach very low bit rates while keeping a good image quality.
Inventors
- 👤 Lionel Bouchard
- 👤 Regine Askenatzis
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 10:40
CPC Classifications
G; G06; G06T; G06T9/00; G06T9/008; H; H04; H04N; H04N19/00; H04N19/60; H04N19/649; H04N19/90; H04N19/94; H04N19/20
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
134 words
A method of coding images of an image sequence, the method comprising the following steps: (A) segmenting each image in the image sequence into homogeneous regions comprised of textures and contours; (B) coding the contours of said regions; and (C) coding the textures of said regions; wherein, for each region, said texture coding step comprises: (a) building a smallest rectangle surrounding the region; (b) splitting the rectangle into 2×2 blocks; (c) storing transformed coefficients for each of the 2×2 blocks in vectors having sizes defined as 1, 2, 3 or 4; (d) selecting a codebook for each vector, the selecting step selecting a codebook for each vector that corresponds to a size of the vector; and (e) performing lattice vector quantization on each vector in accordance with the codebook selected in the selecting step.
Claim 2
Independent Claim
134 words
A method of coding images of an image sequence, the method comprising the following steps: (A) segmenting each image in the image sequence into homogeneous regions comprised of textures and contours; (B) coding the contours of said regions; and (C) coding the textures of said regions; wherein, for each region, said texture coding step comprises: (a) building a smallest rectangle surrounding the region; (b) splitting the rectangle into 2×2 blocks; (c) storing transformed coefficients for each of the 2×2 blocks in vectors having sizes defined as 1, 2, 3 or 4; (d) selecting a codebook for each vector, the selecting step selecting a codebook for each vector that corresponds to a size of the vector; and (e) performing lattice vector quantization on each vector in accordance with the codebook selected in the selecting step.
Claim 3
Dependent Claim
106 words
A decoding method for decoding signals corresponding to images of an image sequence that have been coded using the method of claim 1, wherein said decoding method comprises the following steps, which are performed for each region of a coded image: (a) building a smallest rectangle surrounding the region; (b) splitting the rectangle into 2×2 blocks; (c) determining sizes of vectors which store transformed coefficients for each one of the 2×2 blocks; (d) selecting a codebook, for each vector, that corresponds to a size of the vector; and (e) performing lattice vector dequantization on each vector in accordance with the codebook selected in the selecting step.
Claim 4
Dependent Claim
20 words
A method according to claim 1, wherein the rectangle built in the building step has equal horizontal and vertical dimensions.
Claim 5
Dependent Claim
12 words
A method according to claim 1, wherein the regions have arbitrary shapes.
Claim 6
Independent Claim
126 words
A system for coding images of an image sequence, the system comprising: segmentation means for defining homogeneous regions in each image in the image sequence; contour coding means for coding contours of the regions of each image; and texture coding means for coding textures of the regions of each image, said texture coding means comprising a processor which, for each region, (a) builds a smallest rectangle surrounding the region, (b) splits said rectangle into 2×2 blocks, (c) stores transformed coefficients for each of the 2×2 blocks in vectors having sizes defined as 1, 2, 3 or 4, (d) selects a codebook for each vector corresponding to a size of the vector, and (e) performs lattice vector quantization on each vector in accordance with a selected codebook.
Claim 7
Independent Claim
126 words
A system for coding images of an image sequence, the system comprising: segmentation means for defining homogeneous regions in each image in the image sequence; contour coding means for coding contours of the regions of each image; and texture coding means for coding textures of the regions of each image, said texture coding means comprising a processor which, for each region, (a) builds a smallest rectangle surrounding the region, (b) splits said rectangle into 2×2 blocks, (c) stores transformed coefficients for each of the 2×2 blocks in vectors having sizes defined as 1, 2, 3 or 4, (d) selects a codebook for each vector corresponding to a size of the vector, and (e) performs lattice vector quantization on each vector in accordance with a selected codebook.
Claim 8
Dependent Claim
155 words
A decoding system for decoding coded signals corresponding to images of an image sequence that have been coded in the coding system of claim 5, said decoding system comprising: contour decoding means for decoding coded signals corresponding to contours of the regions; texture decoding means for decoding coded signals corresponding to textures of the regions; and reconstruction means for reconstructing images that correspond to original images in the image sequence based on decoded signals from the contour decoding means and the texture decoding means, said reconstruction means comprising a processor which, for each region, (a) builds a smallest rectangle surrounding the region, (b) splits said rectangle into 2×2 blocks, (c) determines sizes of vectors which store transformed coefficients for each one of the 2×2 blocks, (d) selects a codebook for each vector, that corresponds to a size of the vector, and (e) performs lattice vector dequantization on each vector in accordance with a selected codebook.
Claim 9
Dependent Claim
19 words
A system according to claim 5, wherein the rectangle built by the processor has equal horizontal and vertical dimensions.
Claim 10
Dependent Claim
12 words
A system according to claim 5, wherein the regions have arbitrary shapes.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-11-30 | 2002-06-01 | 2002-12-01 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-30 | 2006-06-01 | 2006-12-01 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-30 | 2010-06-01 | 2010-12-01 | $7700.00 | Window Closed / Lapsed |