US5838830A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Vertex-based hierarchical shape representation and coding method and apparatus
Assignee: Rakuten Group Inc
•
Filing: 1997-04-03
•
Granted: 1998-11-17
•
Expires: 2017-04-03
Abstract
Abstract A method of vertex-based hierarchical shape representation and coding includes selecting an image of interest, defining a boundary about an object of interest within the image of interest, wherein the boundary is defined by a set of contour points, selecting a number of layers, each layer having a predefined saliency parameter associated therewith, wherein the saliency parameter defines a range of layers from a most salient layer to a least salient layer, identifying the most salient contour points in the boundary and placing the most salient contour points in the most salient layer, identifying the next most salient contour points in the boundary and placing the next most salient contour points in the next most salient layer until all of the selected layers have contour points placed therein, and hierarchically storing the layers in a database. A vertex-based hierarchical shape representation and coding system includes an image input which contains and image of interest, an analyzer to select an object of interest within the image, a manipulation mechanism to define a boundary about the object of interest and define a set of contour points on that boundary, and a selections mechanism to place selected contour points into hierarchical layers of like salient contour points.
Inventors
- 👤 Richard J. Qian
- 👤 M. Ibrahim Sezan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 11:49
CPC Classifications
H; H04; H04N; H04N19/00; H04N19/30; H04N19/33; H04N19/20; H04N19/29
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
120 words
A method of vertex-based hierarchical shape representation and coding comprising: selecting an image of interest; defining a representation of the shape of the image of interest; establishing a boundary between the object of interest and the remainder of the image of interest; tracing the contour of the image of interest to determine the coordinates of all of a collection of contour points on the contour; determining a number of hierarchical layers in which the contour points will be stored; selecting the most salient contour points on the contour; storing the most salient contour points in a base hierarchical layer; storing less salient contour points in successive less salient hierarchical layers; and building a content-based data base of shape-representative hierarchical layers.
Claim 2
Independent Claim
120 words
A method of vertex-based hierarchical shape representation and coding comprising: selecting an image of interest; defining a representation of the shape of the image of interest; establishing a boundary between the object of interest and the remainder of the image of interest; tracing the contour of the image of interest to determine the coordinates of all of a collection of contour points on the contour; determining a number of hierarchical layers in which the contour points will be stored; selecting the most salient contour points on the contour; storing the most salient contour points in a base hierarchical layer; storing less salient contour points in successive less salient hierarchical layers; and building a content-based data base of shape-representative hierarchical layers.
Claim 3
Dependent Claim
70 words
The method of claim 1 wherein said selecting the salient contour points for any layer includes selecting a predetermined saliency parameter for each layer, and recording each predetermined saliency parameter in an array of saliency parameters; extracting salient contour points in a layer by locating selected contour points located at greater than a preselected distance from a line connecting the contour points on either side of the selected contour point.
Claim 4
Dependent Claim
25 words
The method of claim 1 wherein said selecting the salient contour points for any layer includes using an iterative refinement method for determining hierarchical vertices.
Claim 5
Dependent Claim
10 words
The method of claim 1 which includes scalable shape coding.
Claim 6
Independent Claim
142 words
A method of vertex-based hierarchical shape representation and coding comprising: selecting an image of interest; defining a boundary about an object of interest within the image of interest, wherein the boundary is defined by a set of contour points; selecting a number of layers, each layer having a predefined saliency parameter associated therewith, wherein the saliency parameter defines a range of layers from a most salient layer to a least salient layer; identifying the most salient contour points in the boundary and placing a set of the most salient contour points in the most salient layer; identifying the next most salient contour points in the boundary and placing a set of the next most salient contour points in the next most salient layer until all of the selected layers have contour points placed therein; and hierarchically storing the layers in a database.
Claim 7
Independent Claim
142 words
A method of vertex-based hierarchical shape representation and coding comprising: selecting an image of interest; defining a boundary about an object of interest within the image of interest, wherein the boundary is defined by a set of contour points; selecting a number of layers, each layer having a predefined saliency parameter associated therewith, wherein the saliency parameter defines a range of layers from a most salient layer to a least salient layer; identifying the most salient contour points in the boundary and placing a set of the most salient contour points in the most salient layer; identifying the next most salient contour points in the boundary and placing a set of the next most salient contour points in the next most salient layer until all of the selected layers have contour points placed therein; and hierarchically storing the layers in a database.
Claim 8
Dependent Claim
26 words
The method of claim 5 wherein said defining a boundary includes analyzing the shape of an image of interest as represented by a binary shape map.
Claim 9
Dependent Claim
11 words
The method of claim 5 which further includes scalable shape coding.
Claim 10
Independent Claim
172 words
An apparatus for providing shape representation and coding of a video image comprising: a video input which contains an image of interest; an analyzer to select an object of interest within the image and to form a video object therefrom; a manipulation mechanism to split the video image into a shape component, a texture component and a motion component, and to define a boundary about the shape component of the object of interest and define a set of contour points on that boundary; a selection mechanism to place selected contour points into hierarchical layers of like salient contour points; an encoder to encode the components of the video object into signals representative of said components; a multiplexer to multiplex said signals representative of said components; a transmission mechanism to transmit said multiplexed, encoded signals; a demultiplexer to demultiplex said multiplexed, encoded signals; a decoder to decode said encoded signals; a reconstruction mechanism to reconstruct the decoded component signals into a video image; and a video output to output a reconstructed video image.
Claim 11
Independent Claim
172 words
An apparatus for providing shape representation and coding of a video image comprising: a video input which contains an image of interest; an analyzer to select an object of interest within the image and to form a video object therefrom; a manipulation mechanism to split the video image into a shape component, a texture component and a motion component, and to define a boundary about the shape component of the object of interest and define a set of contour points on that boundary; a selection mechanism to place selected contour points into hierarchical layers of like salient contour points; an encoder to encode the components of the video object into signals representative of said components; a multiplexer to multiplex said signals representative of said components; a transmission mechanism to transmit said multiplexed, encoded signals; a demultiplexer to demultiplex said multiplexed, encoded signals; a decoder to decode said encoded signals; a reconstruction mechanism to reconstruct the decoded component signals into a video image; and a video output to output a reconstructed video image.
Claim 12
Dependent Claim
29 words
The apparatus of claim 8 which includes a database for containing representations of video objects, wherein said representations comprise at least the most salient layer of a video object.
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-16 | 2002-05-18 | 2002-11-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-11-16 | 2006-05-18 | 2006-11-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-11-16 | 2010-05-18 | 2010-11-17 | $7700.00 | Window Closed / Lapsed |