Patent US4482970A successfully refreshed from Google Patents.
US4482970A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Boolean filtering method and apparatus
Assignee: Grumman Corp
•
Filing: 1981-11-06
•
Granted: 1984-11-13
•
Expires: 2001-11-06
Abstract
Abstract A filtering method and apparatus for discriminating targets from noise in space-time data consisting of a plurality of binary data frames, each containing an equal number of points, are disclosed. Noise filtering for target detection is performed by recursively determining whether the points of a sequence of M of the binary data frames form at least one continuous string, or at the next highest level of discrimination, monotonic continuous string by logically comparing each binary data frame with the two binary data frames which precede and follow it on a point by point basis.
Inventors
- 👤 Patrick E. Barry
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 20:34
CPC Classifications
G; G01; G01S; G01S3/00; G01S3/78; G01S3/782; G01S3/785; G01S3/786; G01S3/7864; G01S13/00; G01S13/66; G01S13/72; G06; G06V; G06V10/00; G06V10/20; G06V10/255
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
148 words
A method of filtering in real time space-time data consisting of a plurality of binary data frames each containing an equal number of points comprising the steps of: (a) storing sequentially each of the plurality of binary data frames; (b) recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis; and (c) outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 2
Independent Claim
148 words
A method of filtering in real time space-time data consisting of a plurality of binary data frames each containing an equal number of points comprising the steps of: (a) storing sequentially each of the plurality of binary data frames; (b) recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis; and (c) outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 3
Independent Claim
161 words
A method of filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising the steps of: (a) storing sequentially each of the plurality of binary data frames; (b) recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a continuous string; and (c) outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 4
Independent Claim
161 words
A method of filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising the steps of: (a) storing sequentially each of the plurality of binary data frames; (b) recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a continuous string; and (c) outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 5
Independent Claim
161 words
A method of filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising the steps of: (a) storing sequentially each of the plurality of binary data frames; (b) recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a monotonic string; and (c) outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a monotonic string, said outputted points being filtered space-time data.
Claim 6
Independent Claim
161 words
A method of filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising the steps of: (a) storing sequentially each of the plurality of binary data frames; (b) recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a monotonic string; and (c) outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a monotonic string, said outputted points being filtered space-time data.
Claim 7
Dependent Claim
149 words
Apparatus for filtering in real time space-time data consisting of a plurality of binary data frames containing an equal number of points comprising: (a) means for storing sequentially each of the plurality of binary data frames; (b) means for recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis; and (c) means for outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 8
Dependent Claim
149 words
Apparatus for filtering in real time space-time data consisting of a plurality of binary data frames containing an equal number of points comprising: (a) means for storing sequentially each of the plurality of binary data frames; (b) means for recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis; and (c) means for outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 9
Dependent Claim
163 words
Apparatus for filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising: (a) means for storing sequentially each of the plurality of binary data frames; (b) means for recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a continuous string; and (c) means for outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 10
Dependent Claim
163 words
Apparatus for filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising: (a) means for storing sequentially each of the plurality of binary data frames; (b) means for recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a continuous string; and (c) means for outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a continuous string, said outputted points being filtered space-time data.
Claim 11
Dependent Claim
163 words
Apparatus for filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising: (a) means for storing sequentially each of the plurality of binary data frames; (b) means for recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a monotonic string; and (c) means for outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a monotonic string, said outputted points being filtered space-time data.
Claim 12
Dependent Claim
163 words
Apparatus for filtering in real time space-time data consisting of a plurality of binary data frames each containing N×N, where N is an integer, points comprising: (a) means for storing sequentially each of the plurality of binary data frames; (b) means for recursively determining whether the points of a sequence of M, where M is an integer, of the plurality of stored binary data frames forms at least one continuous string by logically comparing each of the stored binary data frames comprising said sequence of M with the binary data frame which preceded it and the binary data frame which followed it on a point by point basis only for those previously compared points which form a monotonic string; and (c) means for outputting the points of each of said compared binary data frames which when compared with the points in the other stored binary data frames comprising said sequence of M form a monotonic string, said outputted points being filtered space-time data.
Claim 13
Independent Claim
28 words
An apparatus as recited in claims 4, 5 or 6 further comprising timing means for causing said binary data frames to be sequentially stored in said storing means.
References Cited (Backward Citations)
US3253277A
Cited
GB894148A
Cited
US3731304A
Cited
US3460137A
Cited
US3399404A
Cited
US3699573A
Cited
US3787852A
Cited
US3997973A
Cited
US4013998A
Cited
US4023170A
Cited
US3942163A
Cited
US3908116A
Cited
US4034199A
Cited
US3952188A
Cited
US4045795A
Cited
US4032867A
Cited
US4004157A
Cited
US4064533A
Cited
US4035628A
Cited
US4011438A
Cited
US4011442A
Cited
US4063200A
Cited
US4039978A
Cited
US4220967A
Cited
US4240109A
Cited
US4068311A
Cited
US4133004A
Cited
US4364087A
Cited
US4383272A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-11-13 | 1988-05-14 | 1988-11-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-11-13 | 1992-05-14 | 1992-11-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-11-13 | 1996-05-14 | 1996-11-13 | $7700.00 | Window Closed / Lapsed |