US4499597A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Small-object location utilizing centroid accumulation
Assignee: Raytheon Co
•
Filing: 1982-03-29
•
Granted: 1985-02-12
•
Expires: 2002-03-29
Abstract
Abstract In the disclosed image-analysis scheme, a processing window of M by N pixels is successively scanned in single-pixel steps over a sensed image, with the centroid of the image data contained in each window position then being determined. When a pixel-by-pixel tabulation is made of the number of times each pixel has been determined to be the windowed-data centroid, those pixels having the higher tabulated centroid counts will tend to be the intra-image locations of any objects which are smaller than about M/2 by N/2 pixels.
Inventors
- 👤 James F. Alves
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 00:22
CPC Classifications
G; G06; G06T; G06T7/00; G06V; G06V10/00; G06V10/20; G06V10/24; G06V10/36; G06V10/40; G06V10/42
Claims Analysis
Total Claims: 5
Claim 1
Independent Claim
169 words
In a scene-sensing and imaging system having data-analysis apparatus which includes (a) an array for storing a given pixel-based scene image, (b) window gating networks associated with said image-storage array, and (c) an accumulation array, a method of operating said data-analysis apparatus so as to locate smaller-dimensioned objects in predetermined sectors of said given image, this method comprising the steps of: (A) utilizing said gating networks both to establish at least one processing window dimensioned with respect to desired small objects in said scene, and then to read out of said image array each dimensioned-window grouping of pixels in said image sector; (B) for each such dimensioned-window pixel grouping, determining which pixel is the intra-window image centroid; (C) utilizing said accumulation array to tabulate the number of times each pixel in said sector is determined to be a windowed-pixel centroid; and then (D) interrogating said accumulation array for a pixel having a high tabulated centroid account, with any such pixel being the location of smaller-demensioned objects in said scene.
Claim 2
Dependent Claim
169 words
In a scene-sensing and imaging system having data-analysis apparatus which includes (a) an array for storing a given pixel-based scene image, (b) window gating networks associated with said image-storage array, and (c) an accumulation array, a method of operating said data-analysis apparatus so as to locate smaller-dimensioned objects in predetermined sectors of said given image, this method comprising the steps of: (A) utilizing said gating networks both to establish at least one processing window dimensioned with respect to desired small objects in said scene, and then to read out of said image array each dimensioned-window grouping of pixels in said image sector; (B) for each such dimensioned-window pixel grouping, determining which pixel is the intra-window image centroid; (C) utilizing said accumulation array to tabulate the number of times each pixel in said sector is determined to be a windowed-pixel centroid; and then (D) interrogating said accumulation array for a pixel having a high tabulated centroid account, with any such pixel being the location of smaller-demensioned objects in said scene.
Claim 3
Dependent Claim
41 words
A method according to claim 1 in which: the dimensioned processing window is a rectangle covering M by N pixels, whereby intra-scene objects of dimension smaller than about M/2 by N/2 pixels tend to give rise to high tabulated centroid counts.
Claim 4
Dependent Claim
45 words
A method according to claim 1 in which the interrogation step includes the steps of: (1) determining which of the scene's pixels has the highest tabulated centroid count; and (2) designating this highest-count pixel as being the location within the scene of a smaller-dimensioned object.
Claim 5
Dependent Claim
38 words
A method according to claim 3 which includes, after the small-object, location-designation step, the steps of: (1) reducing the subject highest count to zero, and then (2) iteratively performing the sequence of highest-count determination, location-designation and highest-count reduction.
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) | 1988-02-12 | 1988-08-13 | 1989-02-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-02-12 | 1992-08-13 | 1993-02-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-02-12 | 1996-08-13 | 1997-02-12 | $7700.00 | Window Closed / Lapsed |