← Back to Patent Explorer
US5068664A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and device for recognizing a target

Assignee: Airbus Group SAS
•
Filing: 1990-10-24
•
Granted: 1991-11-26
•
Expires: 2010-10-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and device are disclosed for recognizing a target (T) among a plurality of n known targets Ti (with i=1, 2, 3, . . . , n). According to the invention, by direct examination of said target (T) to be recognized and from first values (Cki) representative of a plurality of p recognition criteria Ck (with k=1, 2, 3, . . . , p), at least p third values (pCk(Ti)) are established representative of the probabilities that, for each recognition criterion (Ck), the target (T) to be recognized is each of said known targets (Ti); and said third values associated with the same known target (Ti) are merged while taking into account second values (PCk(Ti)) representative of the probabilities that a target (Ti) is recognized, in so far as criterion Ck is concerned, when it is examined so as to obtain n fourth values (p(Ti)), each of which is representative of the probability that the target to be recognized is one of the known targets (Ti).

Inventors

  • 👤 Alain Appriou
  • 👤 Regis Barthelemy
  • 👤 Colette Coulombeix

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 22:08
CPC Classifications
G; G01; G01S; G01S7/00; G01S7/02; G01S7/28; G01S7/285; G01S7/292; G01S7/2923; G01S7/295; G01S7/41; G01S7/411; G01S7/412; G06; G06V; G06V10/00; G06V10/20; G06V10/255

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 258 words
Method for recognizing a target (T) among a plurality of n known targets Ti (with i=1,3,4, . . . , n), wherein: in a first preparatory step, for each of said known targets (Ti) first values (CKi) are determined representative of a plurality of p recognition criteria Ck (with k=1,2,3, . . . , p); in a second preparatory step, from direct examination of said n known targets (Ti), using said first values (CKi) and for each recognition criterion (Ck), nxp second values (PCk(Ti)) are established each representative of the probability for a target (Ti) to be recognized when it is examined whereas it is the target (Tj) which is examined (j=1,2,3, . . . , n); and in a step for recognizing said target: by direct examination of said target (T) to be recognized and from said first values (CKi) determined by said first preparatory step, at least p third values (pCk(Ti)) are established representative of the probabilities, for each recognition criterion (Ck), that the target (T) to be recognized is each of said n known target (Ti) insofar as each of said p criteria is concerned; said nxp third values associated with the same known target (Ti) are merged together by taking into account said nxp second values, so as to obatin n fourth values (p(Ti)), each of which is representative of the probability that the target to be recognized is one of the known targets (Ti); and the identity of the target to be recognized (T) is determined from the largest of said fourth values.
Claim 2
Dependent Claim 258 words
Method for recognizing a target (T) among a plurality of n known targets Ti (with i=1,3,4, . . . , n), wherein: in a first preparatory step, for each of said known targets (Ti) first values (CKi) are determined representative of a plurality of p recognition criteria Ck (with k=1,2,3, . . . , p); in a second preparatory step, from direct examination of said n known targets (Ti), using said first values (CKi) and for each recognition criterion (Ck), nxp second values (PCk(Ti)) are established each representative of the probability for a target (Ti) to be recognized when it is examined whereas it is the target (Tj) which is examined (j=1,2,3, . . . , n); and in a step for recognizing said target: by direct examination of said target (T) to be recognized and from said first values (CKi) determined by said first preparatory step, at least p third values (pCk(Ti)) are established representative of the probabilities, for each recognition criterion (Ck), that the target (T) to be recognized is each of said n known target (Ti) insofar as each of said p criteria is concerned; said nxp third values associated with the same known target (Ti) are merged together by taking into account said nxp second values, so as to obatin n fourth values (p(Ti)), each of which is representative of the probability that the target to be recognized is one of the known targets (Ti); and the identity of the target to be recognized (T) is determined from the largest of said fourth values.
Claim 3
Dependent Claim 42 words
The method as claimed in claim 1, wherein merging of said third values is obtained by using mathematical laws given by any one of the theories which are BAYES inference, entropy maximum, the theory of evidence or the theory of fuzzy sets.
Claim 4
Dependent Claim 14 words
The method as claimed in claim 1, wherein said third values are certain values.
Claim 5
Dependent Claim 14 words
The method as claimed in claim 1, wherein said third values are uncertain values.
Claim 6
Dependent Claim 44 words
The method as claimed in claim 1, wherein, in said first preparatory step, said first values are recorded criterion by criterion for all said known targets (Ti), so that all said first values of all said targets corresponding to a criterion are grouped together.
Claim 7
Dependent Claim 23 words
The method as claimed in claim 1, wherein determination of said first values is achieved by direct examination of said known targets (Ti).
Claim 8
Dependent Claim 23 words
The method as claimed in claim 1, wherein determination of said first values is achieved from models or plans of said known targets.
Claim 9
Dependent Claim 44 words
The method as claimed in claim 1, wherein, in said second preparatory step, said second values are obtained by comparison of said first values with measurement of each of said targets in accordance with each of said criteria, said measurements being repeated numerous times.
Claim 10
Dependent Claim 60 words
The method as claimed in claim 1, wherein said second values are recorded in matrix memories (MC1 to MCp), each matrix memory being associated with a criterion and in each recording position (10.ji) of such a matrix memory the probability is recorded, for said criterion, that the target (Ti) is recognized whereas the target (Tj) is subjected to direct examination.

References Cited (Backward Citations)

US3634822A Cited
US4462081A Cited
US4881270A Cited
FR2593608A1 Cited
US4864307A Cited
EP0235946A1 Cited
US4707697A Cited
US4847817A Cited
US4972193A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-11-25 1995-05-27 1995-11-26 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-11-25 1999-05-27 1999-11-26 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-11-25 2003-05-27 2003-11-26 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag