US5023729A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for generating a density concurrent matrix
Assignee: Sharp Corp
•
Filing: 1989-04-06
•
Granted: 1991-06-11
•
Expires: 2009-04-06
Abstract
Abstract An image processing method and apparatus generates a concurrence matrix for identifying characteristics in an image. Pixel density values of an original image are stored, and a shifted image is generated by shifting the pixels of the original image by a predetermined distance. A set of counts is generated. Each count corresponds to one density value selected out of the range of possible densities. Each count is the number of times that a pixel in the shifted image equals the selected density simultaneously with a corresponding pixel in the original image equaling a predetermined value. One column in the correspondence matrix corresponds to the counts for one predetermined value. The shift distance is varied to generate a set of matrices. From these matrices, contrast, texture and other characteristics in an image can be quantitatively recognized.
Inventors
- 👤 Ryohei Kumagai
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 16:36
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/10; G06T7/00; G06T7/40; G06T7/41; G06T7/45
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
77 words
An image processing method comprising steps of: storing pixel density values of an original image; generating a shifted image by shifting the pixel density values of the original image by a predetermined distance; generating a set of counts, each count corresponding to a selected density value, each count being a number of times that a pixel in the shifted image equals selected density value simultaneously with a corresponding pixel in the original image equaling a predetermined value.
Claim 2
Dependent Claim
77 words
An image processing method comprising steps of: storing pixel density values of an original image; generating a shifted image by shifting the pixel density values of the original image by a predetermined distance; generating a set of counts, each count corresponding to a selected density value, each count being a number of times that a pixel in the shifted image equals selected density value simultaneously with a corresponding pixel in the original image equaling a predetermined value.
Claim 3
Dependent Claim
45 words
An image processing method according to claim 1 further comprising the steps of: changing the predetermined value through a range; and generating a matrix, each vector of the matrix corresponding to a different predetermined value, each scalar entry corresponding to count for a selected density.
Claim 4
Dependent Claim
69 words
An image processing method according to claim 1, further comprising the steps of: sequentially processing corresponding pairs of points, one from the original image and one from the shifted image; generating a partial count for a selected density value; and incrementing the partial count each time a pixel in the shifted image equals the selected density simultaneously with a corresponding pixel in the original image equaling a predetermined value.
Claim 5
Dependent Claim
42 words
A method as in claim 2 further comprising the steps of: generating a second shifted image by shifting the pixel density values of the original image by a second shift distance; generating a second matrix corresponding to the second different shift distance.
Claim 6
Dependent Claim
41 words
A method as in claim 2 further comprising at least one of the following steps: recognizing a texture of a region of the original image from the matrix; recognizing a contrast of a region of the original image from the matrix.
Claim 7
Dependent Claim
168 words
An image processing system comprising: first memory means for storing pixel density values of an image; second memory means for storing pixel density values of the image in an order shifted with respect to the order of the first memory means, pixel density values in the second memory means corresponding to pixel density values in the first memory means; reading means connected to the first and second memory means for successively reading corresponding pixel density values from the first and second memories; comparator means connected to the first memory means for generating a flag signal when a pixel density value read from the first memory equals a predetermined value; counting means connected to the comparator means and to the second memory for generating a set of counts, each count corresponding to a selected density value, each count being a number of times that a pixel in the shifted image equals the selected density value simultaneously with a corresponding pixel value in the original image equaling the predetermined value.
Claim 8
Dependent Claim
168 words
An image processing system comprising: first memory means for storing pixel density values of an image; second memory means for storing pixel density values of the image in an order shifted with respect to the order of the first memory means, pixel density values in the second memory means corresponding to pixel density values in the first memory means; reading means connected to the first and second memory means for successively reading corresponding pixel density values from the first and second memories; comparator means connected to the first memory means for generating a flag signal when a pixel density value read from the first memory equals a predetermined value; counting means connected to the comparator means and to the second memory for generating a set of counts, each count corresponding to a selected density value, each count being a number of times that a pixel in the shifted image equals the selected density value simultaneously with a corresponding pixel value in the original image equaling the predetermined value.
Claim 9
Dependent Claim
47 words
A system as in claim 6 further comprising sequencing means for sequencing the predetermined value and for generating a plurality of sets of counts, one set for each predetermined value and for generating a matrix having vectors corresponding to predetermined values and scalar entries corresponding to counts.
Claim 10
Dependent Claim
65 words
A system as in claim 6 wherein the counting means comprises: high speed memory means for storing count values; and computational means having an input connected to the output of the high speed memory means and having an output connected to the input of the high speed memory means for incrementing the values read from the high speed memory and for storing the incremented values.
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) | 1994-06-10 | 1994-12-10 | 1995-06-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1998-06-10 | 1998-12-10 | 1999-06-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2002-06-10 | 2002-12-10 | 2003-06-11 | $7700.00 | Window Closed / Lapsed |