Patent US6803920B2 successfully refreshed from Google Patents.
US6803920B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for digital image segmentation using an iterative method
Assignee: Altera Corp
•
Filing: 2001-07-31
•
Granted: 2004-10-12
•
Expires: 2021-07-31
Abstract
Abstract A digital image is divided into segments, wherein the digital image comprises an array of pixels each having a pixel location and a pixel color value. A method comprises obtaining an image frame comprising an array of pixels each having a pixel color value, assigning an initial segment identifier to each pixel in the image frame independent of each pixel's pixel color value, testing, using an appropriateness test, pixels for possible reassignment from a current segment to a neighboring segment, and if the appropriateness test indicates a pixel should be reassigned, reassigning the segment identifier of the pixel.
Inventors
- 👤 Phil Gossett
- 👤 Edward Ratner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 10:56
CPC Classifications
G; G06; G06T; G06T5/00; G06T5/20; G06T7/00; G06T7/10; G06T7/12; G06T7/194; G06T7/90; G06T2207/00; G06T2207/10; G06T2207/10016
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
100 words
A method of dividing a digital image into segments, wherein the digital image comprises an array of pixels each having a pixel location and a pixel color value, the method comprising: obtaining an image frame comprising an array of pixels each having a pixel color value; assigning an initial segment identifier to each pixel in the image frame independent of each pixel's pixel color value; testing, using an appropriateness test, pixels for possible reassignment from a current segment to a neighboring segment; and if the appropriateness test indicates a pixel should be reassigned, reassigning the segment identifier of the pixel.
Claim 2
Independent Claim
100 words
A method of dividing a digital image into segments, wherein the digital image comprises an array of pixels each having a pixel location and a pixel color value, the method comprising: obtaining an image frame comprising an array of pixels each having a pixel color value; assigning an initial segment identifier to each pixel in the image frame independent of each pixel's pixel color value; testing, using an appropriateness test, pixels for possible reassignment from a current segment to a neighboring segment; and if the appropriateness test indicates a pixel should be reassigned, reassigning the segment identifier of the pixel.
Claim 3
Dependent Claim
24 words
The method of claim 1 , further comprising reassigning the pixel color of outlier pixels to the representative color of the immediately adjacent pixels.
Claim 4
Dependent Claim
36 words
The method of claim 1 , wherein the pixel segment identifier is based upon the pixel's location with a logical grid, the logical grid having a unique segment identifier corresponding initially to a logical grid section.
Claim 5
Dependent Claim
92 words
The method of claim 1 , wherein reassigning comprises: obtaining a boundary pixel, wherein a boundary pixel is a pixel located proximate to a pixel having a different segment identifier than that of the boundary pixel; considering pixel values in a neighborhood adjacent to the boundary pixel; logically grouping the neighboring pixels by commonality of segment identifiers; computing a representative color value for each pixel group; and reassigning the segment identifier of the boundary pixel to match the group whose representative color value most closely matches the color of the boundary pixel.
Claim 6
Dependent Claim
30 words
The method of claim 1 , further comprising repeating the steps of testing and reassigning until the segment boundaries converge such that the testing step results in no possible reassignments.
Claim 7
Dependent Claim
34 words
The method of claim 1 , further comprising repeating the steps of testing and reassigning until the segment boundaries converge such that the testing step results in less than a threshold amount of reassignment.
Claim 8
Dependent Claim
20 words
The method of claim 6 , wherein the threshold amount of reassignment is measured as a predetermined number of pixels.
Claim 9
Independent Claim
79 words
A method of dividing a digital image into segments, wherein the digital image comprises an array of pixels each having a pixel location and a pixel color value, the method comprising: obtaining an image frame comprising an array of pixels each having a pixel color value; overlaying a logical grid over the image data such that initially each subsection of the grid encompasses at least two pixels; and adjusting the grid subsection boundaries to create at least one segment.
Claim 10
Independent Claim
79 words
A method of dividing a digital image into segments, wherein the digital image comprises an array of pixels each having a pixel location and a pixel color value, the method comprising: obtaining an image frame comprising an array of pixels each having a pixel color value; overlaying a logical grid over the image data such that initially each subsection of the grid encompasses at least two pixels; and adjusting the grid subsection boundaries to create at least one segment.
Claim 11
Dependent Claim
71 words
The method of claim 8 , wherein moving further comprises the steps of: obtaining a boundary pixel; considering pixel values in the grid subsections adjacent to and including the boundary pixel; computing a representative pixel color value for each considered grid subsection; and adjusting the grid subsection boundaries such that the considered boundary pixel is associated with the grid subsection with the closest color value to the boundary pixel's color value.
Claim 12
Dependent Claim
25 words
The method of claim 8 , the method further comprising reassigning the pixel color of outlier pixels to a representative color of immediately adjacent pixels.
Claim 13
Dependent Claim
23 words
The method of claim 8 , wherein considering the pixels comprises considering only the pixels within a given neighborhood of the boundary pixel.
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) | 2007-10-12 | 2008-04-12 | 2008-10-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2011-10-12 | 2012-04-12 | 2012-10-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2015-10-12 | 2016-04-12 | 2016-10-12 | $7700.00 | Window Closed / Lapsed |