Patent US3952299A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3952299A Expired / Lapsed US ⏱️ 0.0 years remaining

Data line correlator

Assignee: Boeing North American Inc
•
Filing: 1969-07-28
•
Granted: 1976-04-20
•
Expires: 1989-07-28
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A line correlator for use as a pattern matching device in a high resolution radar system. Binary coded a priori target area information is digitally correlated with binary coded video range trace signals for a plurality of range and azimuth sets in parallel or multiplexed channels (representing an area of interest), the quantitative correlation for each set being stored. Upon determination of the comparatively better correlation coefficient, the associated range and azimuth data set are retrieved and may be employed for terminal guidance purposes.

Inventors

  • 👤 Winston W. Hodge
  • 👤 David Rosenstock

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 22:53
CPC Classifications
G; G01; G01S; G01S7/00; G01S7/02; G01S7/28; G01S7/285; G01S7/04

Claims Analysis

Total Claims: 19
Claim 1
Independent Claim 202 words
A line correlator for correlation of a binary coded two-dimensional data matrix of interest with a binary coded one-dimensional data reference and including means for determining the correlation coefficient M(τ,θ) of the correlation of said data matrix and said data reference in accordance with the following relationship: ##EQU4## N(11) = number of matched 1's N R (1) = number of 1's in reference N r (0) = number of 0's in reference N s (1) = number of 1's in sensed map line segment being correlated N s (0) = number of 0's in sensed map line segment being correlated L = n r (1) + n r (0) = n s (1) + n s (0) = bit length of data reference τ = displacement (in bits) of the data reference relative to the data matrix θ = reference orientation of the data reference relative to the data matrix n = an integer of at least unity said device further including means responsive to the function M(τ, θ) for a number of selected combinations of data matrix positions (τ) and orientations (θ) for determining that combination of position and orientation having a maximum value of the function M(τ, θ) associated therewith.
Claim 2
Dependent Claim 202 words
A line correlator for correlation of a binary coded two-dimensional data matrix of interest with a binary coded one-dimensional data reference and including means for determining the correlation coefficient M(τ,θ) of the correlation of said data matrix and said data reference in accordance with the following relationship: ##EQU4## N(11) = number of matched 1's N R (1) = number of 1's in reference N r (0) = number of 0's in reference N s (1) = number of 1's in sensed map line segment being correlated N s (0) = number of 0's in sensed map line segment being correlated L = n r (1) + n r (0) = n s (1) + n s (0) = bit length of data reference τ = displacement (in bits) of the data reference relative to the data matrix θ = reference orientation of the data reference relative to the data matrix n = an integer of at least unity said device further including means responsive to the function M(τ, θ) for a number of selected combinations of data matrix positions (τ) and orientations (θ) for determining that combination of position and orientation having a maximum value of the function M(τ, θ) associated therewith.
Claim 3
Dependent Claim 192 words
A line correlator for correlation of a binary coded two-dimensional data matrix of interest with a binary coded one-dimensional data reference and including means for determining the correlation coefficient M(τ, θ) of the correlation of said data matrix and said data reference in accordance with the following relationship: ##EQU5## N(11) = number of matched 1's N R (1) = number of 1's in reference N r (0) = number of 0's in reference N s (1) = number of 1's in sensed map line segment being correlated N s (0) = number of 0's in sensed map line segment being correlated L = n r (1) + n r (0) = n s (1) + n s (0) = bit length of data reference τ = displacement (in bits) of the data reference relative to the data matrix θ = reference orientation of the data reference relative to the data matrix n = an integer of at least unity said device further including means responsive to the function M(τ, θ) for a number of successive data matrix orientations (θ) for determining that orientation having a maximum value of the function associated therewith.
Claim 4
Dependent Claim 192 words
A line correlator for correlation of a binary coded two-dimensional data matrix of interest with a binary coded one-dimensional data reference and including means for determining the correlation coefficient M(τ, θ) of the correlation of said data matrix and said data reference in accordance with the following relationship: ##EQU5## N(11) = number of matched 1's N R (1) = number of 1's in reference N r (0) = number of 0's in reference N s (1) = number of 1's in sensed map line segment being correlated N s (0) = number of 0's in sensed map line segment being correlated L = n r (1) + n r (0) = n s (1) + n s (0) = bit length of data reference τ = displacement (in bits) of the data reference relative to the data matrix θ = reference orientation of the data reference relative to the data matrix n = an integer of at least unity said device further including means responsive to the function M(τ, θ) for a number of successive data matrix orientations (θ) for determining that orientation having a maximum value of the function associated therewith.
Claim 5
Dependent Claim 160 words
A line correlator for correlation of a binary coded one-dimensional data source of interest with a binary coded one-dimensional data reference, including means for determining the correlation coefficient M(τ) of the correlation of said data source of interest with said reference data in accordance with the following relationship: ##EQU6## where: N(11) = number of matched 1' s N r (1) = number of 1' s in reference N r (0) = number of 0' s in reference N s (1) = number of 1' s in sensed map line segment being correlated L = n r (1) + n r (0) = n s (1) + n s (0) = bit length of data reference = displacement of the reference relative to the data matrix n ≧ 1 and further including means responsive to the function M(τ) for a number of successive data matrix position (τ) for determining that position having a maximum value of the function M(τ) associated therewith.
Claim 6
Dependent Claim 160 words
A line correlator for correlation of a binary coded one-dimensional data source of interest with a binary coded one-dimensional data reference, including means for determining the correlation coefficient M(τ) of the correlation of said data source of interest with said reference data in accordance with the following relationship: ##EQU6## where: N(11) = number of matched 1' s N r (1) = number of 1' s in reference N r (0) = number of 0' s in reference N s (1) = number of 1' s in sensed map line segment being correlated L = n r (1) + n r (0) = n s (1) + n s (0) = bit length of data reference = displacement of the reference relative to the data matrix n ≧ 1 and further including means responsive to the function M(τ) for a number of successive data matrix position (τ) for determining that position having a maximum value of the function M(τ) associated therewith.
Claim 7
Independent Claim 240 words
A method for determining that portion of a data image which best matches a reference image, comprising the steps of sampling said data image in different directions θ from a common vantage point to obtain a series of binary coded data lines; sampling said reference image at like directions as said sampled data image to obtain binary coded reference data lines; correlating for each sampled direction θ the data line and reference data line obtained for such direction to determine a better match condition (τ) for such direction; and determining that direction (θ) and condition (τ) for which the best match occurs, said step of correlating further comprising the steps of determining the product (LN(11)) of the number N(11) of matching ones of said data line and said reference data, multiplied by the bit length L of said binary coded reference data line; determining the product N R (1)N S (1) of the number of ones N R (1) in the reference data line and the number of ones N S (1) in that portion of the data line being correlated; and determining the ratio of the difference LN(11) - N R (1)N S (1) to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zeros in the binary coded reference data line N s (0) = number of zeros in that position of the binary coded data line being correlated.
Claim 8
Independent Claim 240 words
A method for determining that portion of a data image which best matches a reference image, comprising the steps of sampling said data image in different directions θ from a common vantage point to obtain a series of binary coded data lines; sampling said reference image at like directions as said sampled data image to obtain binary coded reference data lines; correlating for each sampled direction θ the data line and reference data line obtained for such direction to determine a better match condition (τ) for such direction; and determining that direction (θ) and condition (τ) for which the best match occurs, said step of correlating further comprising the steps of determining the product (LN(11)) of the number N(11) of matching ones of said data line and said reference data, multiplied by the bit length L of said binary coded reference data line; determining the product N R (1)N S (1) of the number of ones N R (1) in the reference data line and the number of ones N S (1) in that portion of the data line being correlated; and determining the ratio of the difference LN(11) - N R (1)N S (1) to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zeros in the binary coded reference data line N s (0) = number of zeros in that position of the binary coded data line being correlated.
Claim 9
Dependent Claim 252 words
In a map matching radar, means for determining that portion of a radar data image which best matches a reference image, comprising means for sampling said data image in different directions θ from a common vantage point to obtain a series of binary coded data lines; means for sampling said reference image at like directions as said sampled data image to obtain binary coded reference data lines; means for correlating for each sampled direction θ the data line and reference data lines obtained for such direction to determine a better match condition (τ) for such direction; and means for determining that direction (θ) and condition (τ) for which the best match occurs; said means for correlating comprising means for determining the product (LN(11)) of the number N(11) of matching ones of said data line and said reference data, multiplied by the bit length L of said binary coded reference data line; means for determining the product N R (1)N S (1) of the number of ones N R (11) in the reference data line and the number of ones N S (1) in that portion of the data line being correlated; and means for determining the ratio of the difference LN(11) - N R (1)N S (1) to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zeros in the binary coded reference data line N s (0) = number of zeros in that portion of the binary coded data line being correlated.
Claim 10
Dependent Claim 252 words
In a map matching radar, means for determining that portion of a radar data image which best matches a reference image, comprising means for sampling said data image in different directions θ from a common vantage point to obtain a series of binary coded data lines; means for sampling said reference image at like directions as said sampled data image to obtain binary coded reference data lines; means for correlating for each sampled direction θ the data line and reference data lines obtained for such direction to determine a better match condition (τ) for such direction; and means for determining that direction (θ) and condition (τ) for which the best match occurs; said means for correlating comprising means for determining the product (LN(11)) of the number N(11) of matching ones of said data line and said reference data, multiplied by the bit length L of said binary coded reference data line; means for determining the product N R (1)N S (1) of the number of ones N R (11) in the reference data line and the number of ones N S (1) in that portion of the data line being correlated; and means for determining the ratio of the difference LN(11) - N R (1)N S (1) to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zeros in the binary coded reference data line N s (0) = number of zeros in that portion of the binary coded data line being correlated.
Claim 11
Dependent Claim 169 words
Correlation apparatus for determination of the degree of correlation M(τ) of a binary coded one-dimensional data source of interest with a binary-coded one-dimensional data reference, comprising means for determining the product (LN(11)) of the number N(11) of matching one's of said data source and data reference, multiplied by the bit length L of said binary coded data reference, means for determining the product N R (1)N S (1) of the number of one's N R (1) in the data reference and the number of ones N S (1) in that portion of the data source of interest being correlated; means responsive to said first and second means for determining a preselected function of the ratio of the difference, LN(11) - N R (1)N S (1), to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zero's in the binary coded data reference N s (0) = number of zero's in that portion of the binary coded data source being correlated.
Claim 12
Dependent Claim 169 words
Correlation apparatus for determination of the degree of correlation M(τ) of a binary coded one-dimensional data source of interest with a binary-coded one-dimensional data reference, comprising means for determining the product (LN(11)) of the number N(11) of matching one's of said data source and data reference, multiplied by the bit length L of said binary coded data reference, means for determining the product N R (1)N S (1) of the number of one's N R (1) in the data reference and the number of ones N S (1) in that portion of the data source of interest being correlated; means responsive to said first and second means for determining a preselected function of the ratio of the difference, LN(11) - N R (1)N S (1), to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zero's in the binary coded data reference N s (0) = number of zero's in that portion of the binary coded data source being correlated.
Claim 13
Dependent Claim 161 words
A correlation method for determination of the degree of correlation M(τ) of a binary coded one-dimensional data source of interest with a binary-coded one-dimensional data reference comprising the steps of determining the product (LN(11)) of the number N(11) of matching one's of said data source and data reference, multiplied by the bit length L of said binary coded data reference; determining the product N R (1)N S (1) of the number of one's N R (11) in the data reference and the number of one's N S (1) in that portion of the data source of interest being correlated; and determining a preselected function of the ratio of the difference LN(11) - N R (1)N S (1) to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zero's in the binary coded data reference N s (0) = number of zero's in that portion of the binary coded data source being correlated.
Claim 14
Dependent Claim 161 words
A correlation method for determination of the degree of correlation M(τ) of a binary coded one-dimensional data source of interest with a binary-coded one-dimensional data reference comprising the steps of determining the product (LN(11)) of the number N(11) of matching one's of said data source and data reference, multiplied by the bit length L of said binary coded data reference; determining the product N R (1)N S (1) of the number of one's N R (11) in the data reference and the number of one's N S (1) in that portion of the data source of interest being correlated; and determining a preselected function of the ratio of the difference LN(11) - N R (1)N S (1) to the product N S (1)N S (0)N R (1)N S (1), where: N r (0) = number of zero's in the binary coded data reference N s (0) = number of zero's in that portion of the binary coded data source being correlated.
Claim 15
Dependent Claim 36 words
The method of claim 7 in which there is further included the step of determining for a number of successive data matrix positions (τ) that position having a maximum value of the function M(τ) associated therewith.
Claim 16
Dependent Claim 37 words
The method of claim 7 in which there is included the further step of determining for a number of successive data matrix orientations (θ) that orientation having a maximum value of the function M(τ, θ) associated therewith.
Claim 17
Dependent Claim 48 words
The method of claim 7 in which there is included the further step of determining for a number of selected combinations of data matrix positions (τ) and orientations (θ) for determining that combination of position and orientation having a maximum value of the function M(τ, θ) associated therewith.
Claim 18
Dependent Claim 125 words
In a map matching directional radar, means for determining that lineal strip portion of a radar data image which best matches a lineal strip of a reference image, comprising means for radial strip sampling said data image in successive directions θ from a common vantage point to obtain a series of binary coded data lines; means for strip sampling said reference image at like directions as said sampled data image to obtain binary coded reference data lines; means for correlating for each sampled direction θ the data line and reference data line for successive conditions (τ) obtained for such direction to determine a better match condition for such direction; and means for determining that direction (θ) and condition (τ) for which the best match occurs.
Claim 19
Dependent Claim 125 words
In a map matching directional radar, means for determining that lineal strip portion of a radar data image which best matches a lineal strip of a reference image, comprising means for radial strip sampling said data image in successive directions θ from a common vantage point to obtain a series of binary coded data lines; means for strip sampling said reference image at like directions as said sampled data image to obtain binary coded reference data lines; means for correlating for each sampled direction θ the data line and reference data line for successive conditions (τ) obtained for such direction to determine a better match condition for such direction; and means for determining that direction (θ) and condition (τ) for which the best match occurs.

References Cited (Backward Citations)

US2964639A Cited
US2989890A Cited
US3196395A Cited
US3299425A Cited
US3398269A Cited
US3292149A Cited
US3441724A Cited
US3492469A Cited
US3553690A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1979-04-20 1979-10-20 1980-04-20 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1983-04-20 1983-10-20 1984-04-20 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1987-04-20 1987-10-20 1988-04-20 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag