×

Random set-based cluster tracking

  • US 7,193,557 B1
  • Filed: 04/29/2004
  • Issued: 03/20/2007
  • Est. Priority Date: 04/29/2003
  • Status: Expired due to Fees
First Claim
Patent Images

1. A system for performing random-set based cluster tracking of observable objects, the system comprising:

  • a plurality of detection sensor devices, each of which generates a series of dataframes, each dataframe containing a timestamp and containing location data and amplitude data corresponding to each detected observable object in the dataframe;

    a tracking processor unit which receives dataframes from one or more of the detection sensor devices, the tracking processor unit including a memory and at least one processing unit, the memory storing scene nodes, track nodes and observation nodes, and also storing program steps for execution by the processing unit, the program steps including;

    an observation node generation step of generating a new observation node for each observable object location data contained in a received dataframe;

    a propagating step of propagating forward, to a time value of the timestamp, a set of state parameters of a group track node to obtain a set of posterior observable positions, a plurality of previously-generated track nodes being assigned to the group track node;

    a projecting step of projecting the posterior observable positions onto a field of regard of the received dataframe;

    a gate generation step of generating a gate for each posterior observable position and projecting each gate over each respective posterior observable position on the received dataframe;

    a feasible track assignment step of determining a set of feasible track assignments for the dataframe which correlate each one of a plurality of new track nodes to at least one of the new observation nodes based on the proximity of each new observation node to at least one of the gates over the posterior observable positions, updating a set of state parameters for each track node assigned to the group track node based on the determined set of feasible track assignments, and generating a probability score for the feasible track assignments;

    a feasible observation assignment step of determining a set of feasible observation assignments for the dataframe which correlate each new observation node to at least one new track node based on the proximity of each new observation node to at least one of the gates over the posterior observable positions, updating a set of state parameters for each track node assigned to the group track node based on the determined set of feasible observation assignments, and generating a probability score for the feasible observation assignments;

    a feasible composite assignment step of determining a set of feasible composite assignments for a composite set of track nodes and observation nodes which correspond to at least the received dataframe, updating a set of state parameters for each track node assigned to the group track node based on the determined set of feasible composite assignments, and generating a probability score for each feasible composite assignment based on the probability scores for the feasible track assignments and the feasible observation assignments corresponding to the track nodes and observation nodes in the composite set; and

    a joint assignment determination step of determining a set of joint assignments based on the set of feasible composite assignments and their respective probability scores by using a loss minimization algorithm and a set of constraints, the selected set of joint assignments including at least one of the feasible composite assignments.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×