US 20020008657 A1 Abstract A method and system for real-time tracking of objects is disclosed. A region is repeatedly scanned providing a plurality of images or data sets having points corresponding to objects in the region to be tracked. Given a previously determined track for each object in the region, an M-dimensional combinatorial optimization assignment problem is formulated using the points from M−1 of the images or data sets, wherein each point is preferably used in extending at most one track. The M-dimensional problem is subsequently solved for an optimal or near-optimal assignment of the points to the tracks, extending the tracking of the objects so that a response to each object can be initiated by the system in real-time. Speed and accuracy is provided by an iterative Lagrangian Relaxation technique wherein a plurality of constraint dimensions are relaxed simultaneously to yield a reduced dimensional optimization problem whose solution is used to formulate an assignment problem of dimensionality less than M. The iterative reducing of dimensions terminates when exact solutions are determined for two-dimensional cases. A recovery procedure is used for determining a higher dimensional assignment problem solution from a problem having one less dimension. The procedure is useful when the reduced dimensional optimizational problem has two constraint dimensions.
Claims(1) 1. A method for tracking a plurality of objects, comprising:
repeatedly scanning a region containing a set consisting of one or more moving objects and generating N sequential images or data sets of said region, a plurality of observations in said images or data sets providing positional information for objects in said set; determining a plurality of tracks, at least one track for each object in said set; determining a plurality of costs, wherein each cost is for assigning one of said observations to one of said tracks; defining a linear programming problem:
Minimize Σ
_{i} _{ 1 } _{. . . i} _{ N }c_{i} _{ 1 }. . . _{i} _{ N }z_{i} _{ 1 }. . . _{i} _{ N } Subject To Σ
_{i} _{ 2 } _{i} _{ 3 } _{. . . i} _{ N }z_{i} _{ 1 }. . . _{i} _{ N }=1 (i_{1}=1, . . . ,M_{1}) Σ
_{i} _{ 1 } _{i} _{ 3 } _{. . . i} _{ N }z_{i} _{ 1 }. . . _{i} _{ N }=1 (i_{1}=1, . . . ,M_{1}) Σ
_{i} _{ 1 } _{. . . i} _{ p−1 } _{i} _{ p+1 } _{. . . i} _{ N }z_{i} _{ 1 }. . . _{i} _{ N }=1
(i
_{p}=1, . . . ,M_{p }and p=2, . . .N−1) Σ
_{i} _{ 1 } _{i} _{ 2 } _{. . . i} _{ N−1 }z_{i} _{ 1 }. . . _{i} _{ N }=1 (i_{N}=1, . . . ,M_{N})
0≦z
_{i} _{ 1 } _{. . . i} _{ N }≦1 for all i_{1}, . . . , i_{N}, wherein each c _{i} _{ 1 } _{. . . i} _{ N }is included in said plurality of costs, each M_{i}, i=1, . . . ,N, being one of: (a) a number of observations in an i^{th }image or data set of said N sequential images or data sets; (b) a sum of a number of tracks in said plurality of tracks, and a number of said observations in the i^{th }image or data set not assigned to one of said tracks; and (c) a number of tracks in said plurality of tracks; solving said linear programming problem for values of z _{i} _{ 1 }. . . _{i} _{ N }for each i_{1}. . . i_{N}; determining a value z _{i} _{ 1 } _{. . . } _{i} _{ N }in {0,1} for each i .l.i N corresponding to each z_{i} _{ 1 } _{. . . i} _{ N }, wherein said values z_{il}. . . _{1N }provide an optimal or near optimal solution to said linear programming problem; taking one or more of the following actions based on said optimal or near-optimal assignment of said plurality of points to said plurality of tracks:
sending a warning to aircraft or a ground or sea facility,
controlling air traffic, controlling anti-aircraft or anti-missile equipment, taking evasive action, working on one of said one or more objects, surveilling one of said one or more objects. Description [0001] This application is a continuation-in-part of U.S. patent appication Ser. No. 08/404,024, filed Mar. 14, 1995 and issued Jul. 16, 1996 as U.S. Pat. No. 5,537,119, which is a continuation-in-part of U.S. patent application Ser. No. 08/171,327 filed Dec. 21, 1993, now U.S. Pat. No. 5,406,289. [0002] The invention relates generally to computerized techniques for processing data obtained from radiation reflections used to track multiple discrete object. [0003] The invention relates generally to computerized techniques for processing data obtained from radar to track multiple discrete objects. [0004] There are many situations where the courses of multiple objects in a region must be tracked. Typically, radar is used to scan the region and generate discrete images or “snapshots” based on sets of returns or observations. In some types of tracking systems, all the returns from any one object are represented in an image as a single point unrelated to the shape or size of the objects. “Tracking” is the process of identifying a sequence of points from a respective sequence of the images that represents the motion of an object. The tracking problem is difficult when there are multiple closely spaced objects because the objects can change their speed and direction rapidly and move into and out of the line of sight for other objects. The problem is exacerbated because each set of returns may result from noise as well as echoes from the actual objects. The returns resulting from the noise are also called false positives. Likewise, the radar will not detect all echoes from the actual objects and this phenomena is called a false negative or “missed detect” error. For tracking airborne objects, a large distance between the radar and the objects diminishes the signal to noise ratio so the number of false positives and false negatives can be high. For robotic applications, the power of the radar is low and as a result, the signal to noise ratio can also be low and the number of false positives and false negatives high. [0005] In view of the proximity of the objects to one another, varied motion of the objects and false positives and false negatives, multiple sequential images should be analyzed collectively to obtain enough information to properly assign the points to the proper tracks. Naturally, the larger the number of images that are analyzed, the greater the amount of information that must be processed. [0006] While identifying the track of an object, a kinematic model describing the object's location, velocity and acceleration may be generated. Such a model provides the means by which the object's future motion can be predicted. Based upon such a prediction, appropriate action may be initiated. For example, in a military application there is a need to track multiple enemy aircraft or missiles in a region to predict their objective, plan responses and intercept them. Alternatively, in a commercial air traffic control application there is a need to track multiple commercial aircraft around an airport to predict their future courses and avoid collision. Further, in these and other applications, such as robotic applications, may use radar, sonar, infrared or other object detecting radiation bandwidths for tracking objects. In particular, in robotic applications reflected radiation can be used to track a single object which moves relative to the robot (or vice versa) so the robot can work on the object. [0007] Consider the very simple example of two objects being tracked and no false positives or false negatives. The radar, after scanning at time t [0008] It is known from prior art to determine a figure of merit or cost for assigning each of the points in the images to a track. The figure of merit or cost is based on the likelihood that the point is actually part of the track. For example, the figure of merit or cost may be based on the distance from the point to an extrapolation of the track. FIG. 1 illustrates costs δ [0009]FIG. 2 illustrates a two by two by two matrix, c, that contains the costs for each point in relation to each possible track. The cost matrix is indexed along one axis by the track number, along another axis by the image number and along the third axis by a point number. Thus, each position in the cost matrix lists the cost for a unique combination of points and a track, one point from each image. FIG. 2 also illustrates a {0, 1} assignment matrix, z, which is defined with the same dimensions as the cost matrix. Setting a position in the assignment matrix to “one” means that the equivalent position in the cost matrix is selected into the solution. The illustrated solution matrix selects the {h [0010] A solution to the assignment problem satisfies two constraints—first, the sum of the associated costs for assigning points to a track extension is minimized and, second, if no false positives or false negatives exist, then each point is assigned to one and only one track. [0011] When false positives exist, however, additional hypothetical track extensions incorporating the false positives will be generated. Further note that the random locations of false positives will, in general, not fit well with true data and such additional hypothetical track extensions will result in higher costs. Also note that when false negative errors exist, then the size of the cost matrix must grow to include hypothetical track extensions formulated with “gaps” (i.e., data omissions where there should be legitimate observation data) for the false negatives. Thus, the second criteria must be weakened to reflect false positives not being as signed and also to permit the gap filler to be multiply assigned. With hypothetical cost calculated in this manner then the foregoing criteria for minimization will tend to materialize the false negatives and avoid the false positives. [0012] For a 3-dimensional problem, as is illustrated in FIG. 1, but with N [0013] where “c” is the cost and “z” is a point or observation assignment, as in FIG. 2. [0014] The minimization equation or equivalently objective function [1.0] (a) specifies the sum of the element by element product of the c and z matrices. The summation includes hypothesis representations z [0015] The only known method to solve Problem Formulation [1.0] exactly is a method called “Branch and Bound.” This method provides a systematic ordering of the potential solutions so that solutions with a same partial solution are accessible via a branch of a tree describing all possible solutions whereby the cost of unexamined solutions on a branch are incrementally developed as the cost for other solutions on the branch are determined. When the developing cost grows to exceed the previously known minimal cost (i.e., the bound) then enumeration of the tree branch terminates. Evaluation continues with a new branch. If evaluation of the cost of a particular branch completes, then that branch has lower cost than the previous bound so the new cost replaces the old bound. When all possible branches are evaluated or eliminated then the branch that had resulted in the last used bound is the solution. If we assume that N [0016] This workload is unsuited to real time evaluation. [0017] The Branch and Bound algorithm has been used in past research on the Traveling Salesman Problem. Messrs. Held and Karp showed that if the set of constraints was relaxed by a method of Lagrangian Multipliers (described in more detail below) then tight lower bounds could be developed in advance of enumerating any branch of the potential solution. By initiating the branch and bound algorithm with such a tight lower bound, significant performance improvements result in that branches will typically evaluate to less than half their full length. [0018] Messrs. Frieze and Yadagar in dealing with a problem related to scheduling combinations of resources, as in job, worker and work site, showed that Problem Formulation [1.0] applied. They further described a solution method based upon an extension of the Lagrangian Relaxation previously mentioned. The two critical extensions provided by Messrs. Frieze and Yadagar were: (1) an iterative procedure that permitted the lower bound on the solution to be improved (by “hill climbing” described below) and (2) the recognition that when the lower bound of the relaxed problem was maximized, then there existed a method to recover the solution of the non-relaxed problem in most cases using parameters determined at the maximum. The procedures attributed to Messrs. Frieze and Yadagar are only applicable to the 3-dimensional problem posed by Problem Formulation [1.0] and where the cost matrix is fully populated. However, tracking multiple airborne objects usually requires solution of a much higher dimensional problem. [0019]FIGS. 1 and 2 illustrate an example where “look ahead” data from the second image improved the assignment accuracy for the first image. Without the look ahead, and based only upon a simple nearest neighbor approach, the assignments in the first set would have been reversed. Problem Formulation [1.0] and the prior art only permit looking ahead one image. In the prior art it was known that the accuracy of assignments will improve if the process looks further ahead, however no practical method to optimally incorporate look ahead data existed. Many real radar tracking problems involve hundreds of tracks, thousands of observations per observation set and matrices with dimensions in the range of 3 to 25 including many images of look ahead. [0020] It was also known that the data assignment problem may be simplified (without reducing the dimension of the assignment problem) by eliminating from consideration for each track those points which, after considering estimated limits of speed and turning ability of the objects, could not physically be part of the track. One such technique, denoted hereinafter the “cone method,” defines a cone as a continuation of each previously determined track with the apex of the cone at the end of the previously defined track. The length of the cone is based on the estimated maximum speed of the object and the size of the arc of the cone is based on the estimated maximum turning ability of the object. Thus, the cone defines a region outside of which no point could physically be part of the respective track. For any such points outside of the cones, an infinite number could be put in the cost matrix and a zero could be preassigned in the assignment matrix. It was known for the tracking problem that these elements will be very common in the cost and selection matrices (so these matrices are “sparse”). [0021] It was also known in the prior art that one or more tracks which are substantially separated geographically from the other tracks can be separated also in the assignment problem. This is done by examining the distances from each point to the various possible tracks. If the distances from one set of points are reasonably short only in relation to one track, then they are assigned to that track and not further considered with the remainder of the points. Similarly, if a larger group of points can only be assigned to a few tracks, then the group is considered a different assignment problem. Because the complexity of assignment problems increases dramatically with the number of possible tracks and the total number of points in each matrix, this partitioning of the group of points into a separate assignment problem and removal of these points from the matrices for the remaining points, substantially reduces the complexity of the overall assignment problem. [0022] A previously known Multiple Hypothesis Testing (MHT) algorithm (see Blackman, Multiple-Target Tracking with Radar Applications, Chapter 10, Artech House Norwood Mass., 1986) related to formulation and scoring. The MHT procedure describes how to formulate the sparse set of all reasonable extension hypothesis (for FIG. 1 the set {h [0023] In theory, the MHT procedure uses the extendable costing procedure to defer assignment decision until the accumulated evidence supporting the assignment becomes overwhelming. When it makes the assignment decision it then eliminates all potential assignments invalidated by the decision in a process called “pruning the tree.” In practice, the MHT hypothesis tree is limited to a fixed number of generations and the overwhelming evidence rule is replaced by a most likely and feasible rule. This rule considers each track independently of others and is therefore a local decision rule. [0024] A general object of the present invention is to provide an efficient and accurate process for assigning each point object in a region from multiple images to a proper track and then taking an action based upon the assignments. [0025] A more specific object of the present invention is to provide a technique of the foregoing type which determines the solution of a k-dimensional assignment problem where “k” is greater than or equal to three. [0026] The present invention relates to a method and apparatus for tracking objects. In particular, the present invention tracks movement or trajectories of objects by analyzing radiation reflected from the objects, the invention being especially useful for real-time tracking in noisy environments. [0027] In providing such a tracking capability, a region containing the objects is repeatedly scanned to generate a multiplicity of sequential images or data observation sets of the region. One or more points (or equivalently observations), in each of the images or observation sets are detected wherein each such observation either corresponds to an actual location of an object or is an erroneous data point due to noise. Subsequently, for each observation detected, figures of merit or costs are determined for assigning the observation to each of a plurality of previously determined tracks. *Afterwards, a first optimization problem is specified which includes: [0028] (a) a first objective function for relating the above mentioned costs to potential track extensions through the detected observations (or simply observations); and [0029] (b) a first collection of constraint sets wherein each constraint set includes constraints to be satisfied by the observations in a particular scan to which the constraint set is related. In general, there is a constraint for each observation of the scan, wherein the constraint indicates the number of track extensions to which the observation may belong. [0030] In particular, the first optimization problem is formulated, generated or defined as an M-dimensional assignment problem wherein there are M constraint sets in the first collection of constraint sets (i.e., there are M scans being examined) and the first objective function minimizes a total cost for assigning observations to various track extensions wherein terms are included in the cost, such that the terms have the figures of merit or costs for hypothesized combinations of assignments of the observations to the tracks. Subsequently, the formulated M-dimensional assignment problem is solved by reducing the complexity of the problem by generating one or more optimization problems each having a lower dimension and then solving each lower dimension optimization problem. That is, the M-dimensional assignment problem is solved by solving a plurality of optimization problems each having a lower number of constraint sets. [0031] The reduction of the M-dimensional assignment problem to a lower dimensioned problems is accomplished by relaxing the constraints on the points of one or more scans thereby permitting these points to be assigned to more than one track extension. In relaxing the constraints, terms having penalty factors are added into the objective function thereby increasing the total cost of an assignment when one or more points are assigned to more than one track. Thus, the reduction in complexity by this relaxation process is iteratively repeated until a sufficiently low dimension is attained such that the lower dimensional problem may be solved directly by known techniques. [0032] In one embodiment of the invention, each k-dimensional assignment problem 2<k≦M, is iteratively reduced to a k−1 dimensional problem until a 2-dimensional problem is specified or formulated. Subsequently, the 2-dimensional problem formulated is solved directly and a “recovery” technique is used to iteratively recover an optimal or near-optimal solution to each k-dimensional problem from a derived (k−1) dimensional problem k=2,3,4, . . .M. [0033] In performing each recovery step (of obtaining a solution to a k-dimensional problem using a solution to a (k−1)-dimensional problem) an auxiliary function, is utilized. In particular, to recover an optimal or near-optimal solution to a k-dimensional problem, an auxiliary function, ψ [0034] Each Auxiliary function ψ [0035] According to one feature of this first embodiment of the present invention, the following steps are also performed before the step of defining the auxiliary function. A preliminary auxiliary function is defined for each of the lower dimensional problems having a dimension equal or one greater than the dimension at which the penalized cost function is solved directly. The preliminary auxiliary function is a function of lower order penalty values and a solution at the dimension at which the penalized cost function was solved directly. In determining a gradient of the preliminary auxiliary function, step in the direction of the gradient to identify a peak region of the preliminary auxiliary function and determine penalty factors at the peak region. Iteratively repeat the defining, gradient determining, stepping and peak determining steps to define auxiliary functions at successively higher dimensions until the auxiliary function at 6-18 (k−1) dimension is determined. In an alternative second embodiment of the present invention, instead of reducing the dimentiality of the M-dimensional assignment problem by a single dimension at a time, a plurality of dimensions are relaxed simultaneously. This new strategy has the advantage that when the M-dimensional problem is relaxed directly to a 2-dimensional assignment problem, then all computations may be performed precisely without utilizing an auxiliary function such as ψ [0036] a) the second objective function is a combination of the first objective function and penalty factors or terms determined for incorporating M-m constraint sets of the first optimization problem into the second objective function; [0037] b) the constraint sets of the second collection include only m of the constraint sets of the first collection of constraints, [0038] wherein 2<m≦M−1. Note that, once the second optimization problem has been specified or formulated, an optimal or near-optimal solution is determined and that solution is used in specifying (i.e, creating, generating, formulating and/or defining) a third optimization problem of M-m dimensions (or equivalently constraint sets) . The third optimization problem is subsequently solved by decomposing it using the same procedure of this second embodiment as was used to decompose the first optimization problem above. Thus, a plurality of instantiations of the third optimization problem are specified, each successive instantiation having a lower number of dimensions, until an instance of the third optimization problem is a two dimensional assignment problem which can be solved directly. Subsequently, whenever an instance of the third optimization problem is solved, the solution is used to recover a solution to the instance of the first optimization problem from which this instance of the third optimization was derived. Thus, an optimal or near-optimal solution to the original first optimization problem may be recovered through iteration of the above steps. [0039] As mentioned above, the second embodiment of the present invention is especially advantageous when m=2, since in this case all computations may be performed precisely and without utilizing auxiliary functions. [0040] Other features and benefits of the present invention will become apparent from the detailed description with the accompanying drawings contained hereinafter. [0041]FIG. 1 is a graph of images or data sets generated by a scan of a region and possible tracks within the images or data sets according to the prior art. [0042]FIG. 2 illustrates cost and assignment matrices for the data sets of FIG. 1 according to the prior art. [0043]FIG. 3 is a block diagram of the present invention. [0044]FIG. 4 is a flow chart of a process according to the prior art for solving a 3-dimensional assignment problem. [0045]FIG. 5 Is a flow chart of a process according to the present invention for solving a k-dimensional assignment problem where “k” is greater than or equal to 3. [0046]FIG. 6 is a graph of various functions used to explain the present invention. [0047]FIG. 7 is another block diagram of the present invention for solving the k-dimensional assignment problem where “k” is greater than or equal to 3. [0048]FIG. 8 is a flowchart describing the procedure for solving a n-dimensional assignment problem according to the second embodiment of the invention. [0049] Referring now to the other figures in detail wherein like reference numerals indicate like elements throughout the several views, FIG. 3 illustrates a system generally designated [0050] The invention generates k-dimensional matrices where k is the number of images or sets of observation data in the look ahead window plus one. Then, the invention formulates a k-dimensional assignment problem as in [1.0] above. [0051] The k-dimensional assignment problem is subsequently relaxed to a (k−1)-dimensional problem by incorporating one set of constraints into the objective function using a Lagrangian relaxation of this set. Given a solution of the (k−1)-dimensional problem, a feasible solution of the k-dimensional problem is then reconstructed. The (k−1)-dimensional problem is solved in a similar manner, and the process is repeated until it reaches the two-dimensional problem that can be solved exactly. The ideas behind the Lagrangian relaxation scheme are outlined next. [0052] Consider the integer programming problem
[0053] where the partitioning of the constraints is natural in some sense. Given a multiplier vector u≧0, the Lagrangian relaxation of [1.0.1] relative to the constraints Bz≦d is defined to be
[0054] If the constraint set Bz=d is replaced by Bz=d, the nonnegativity constraint on u is removed. ζ=c [0055] FACT A.1. If {overscore (z)} is an optimal solution to [1.0.1], then Φ≦v({overscore (z)}) for all u≧0. If an optimal solution {circumflex over (z)} of [1.0.2] is feasible for [1.0.2], then {circumflex over (z)} is an optimal solution for [1.0.1] and Φ [0056] Algorithm k [0057] 1. Generate in initial approximation u [0058] 2. Given u [0059] 3. Given u [0060] 4. Check the termination criteria. If the algorithm is not finished, set k=k+1 and return to Step [0061] If {circumflex over (z)} is an optimal solution of [1.0.1], then Φ [0062] Since the optimal solution {circumflex over (z)}={circumflex over (z)}(u) of [1.0.2] is usually not a feasible solution of [1.0.1] for any choice of the multipliers, Φ [0063] Φαα [0064] Φ [0065] αα [0066] [0067] where c and z are similarly dimensioned matrices representing costs and hypothetical assignments. Note, in general, for tracking problems these matrices are sparse. [0068] After formulating the k-dimensional assignment problem as in [1.1], the present invention solves the resulting problem so as to generate the outputs required by devices [0069]FIG. 7 illustrates various processes implemented upon receipt of each observation set. Except for the addition of the k-dimensional assignment solving process [0070] As noted above, the foregoing track extension process requires knowledge of a previous track. For the initial observations, the following gating process [0071] The output of each of the filtering processes [0072] The assignment solving process [0073] The assignment solving process [0074] I. A FIRST EMBODIMENT OF THE k-DIMENSIONAL ASSIGNMENT SOLVER [0075] In describing a first embodiment of the k-dimensional assignment solver [0076] In step [0077] Step [0078] The cost or objective function for the reduced problem as defined by [2.2](a), if evaluated at all possible values of u is a surface over the domain of U [0079] Φu [0080] u [0081] coefficients u [0082] u [0083] dimensional assignment problem requires solving the Equation 2.2 problem corresponding to u [0084] In step [0085] Thus, after this first iteration, the points have been assigned based on all “u” values being arbitrarily set to zero. Because the “u” values have been arbitrarily assigned, it is unlikely that these assignments are correct and it is likely that further iterations are required to properly assign the points. Step [0086] u [0087] Hill climbing Step [0088] With this new set of “u” values, steps [0089] Step [0090] Φ [0091] ΦΦ [0092] Φ [0093] Φ [0094] by the set of observations {o [0095] The objective of the assignment solving process is to select from the set of all possible combinations of track extensions a subset that satisfies two criteria. First, each point in the subset of combinations should be assigned to one and only one track and therefore, included in one and only one combination of the subset, and second, the total of the scoring sums for the combinations of the subset should be minimized. This yields the following M-dimensional equations where k=M:
[0096] and where c [0097] While direct solution to [3.1] would give the precise assignment, the solution of k-dimensional equations directly for large k is too complex and time consuming for practice. Thus, the present invention solves this problem indirectly. [0098] The following is a short description of many aspects of the present invention and includes some steps according to the prior art. The first step in solving the problem indirectly is to reduce the complexity of the problem by the previously known and discussed Lagrangian Relaxation technique. According to the Lagrangian Relaxation technique, the absolute requirement that each point is assigned to one and only one track is relaxed such that for some one image, points can be assigned to more than one track. However, a penalty based on a respective Lagrangian Coefficient u [0099] values originally assigned. Then, the gradient of the hill-shaped Φ [0100] u [0101] previously selected for the one point on the hill (corresponding to the minimum of the penalized cost Φ ^{3 } [0102] which the corresponding problem will result in the peak of the Φααcharacteristic. The next task is to recover the solution of the proper u [0103] exact definition of the Φ [0104] case of Φ [0105] the iteration can result in a greater than approximation of Φ [0106] function ΨααΦ [0107] u [0108] gradient of the Ψ [0109] u [0110] results in a new 3-dimensional problem and requires the 2-dimensional hill climbing based upon new 2-dimensional problems. At the peak of the 3-dimensional Ψ to a complete solution. This process is repeated iteratively until the u [0111] Φ [0112] Coefficient u [0113] Because the constraint on single assignment of elements from the last image has been eliminated, a M−1 dimensional problem can be developed by eliminating some of the possible assignments. As shown in Equations [3.3], this is done by selecting the smallest cost clement from each of the M [0114] The cost vectors are selected as follows. Define an index array m [0115] The resulting M−1 dimensional problem is (where k=M):
[0116] Assignment Problem [3.1] and Problem Formulation [3.4] differ only in the dimension M vs. M−1, respectively. An optimal solution to [3.4] is also an optimal solution to equation [3.2]. This relationship is the basis for an iterative sequence of reductions indicated by steps [0117] In step [0118] should be adjusted so as to perform the hill climbing function. As was previously described the objective is to produce a sequence of u [0119] αα [0120] u [0121] to the peak of Φ [0122] flow moves to step [0123] Φ [0124] u [0125] values which result in z values that are closer to the proper z values for the highest k-dimension. This hill climbing process (which is different than that used in the prior art of FIG. 4 for recovering only the three dimensional solution) is used iteratively at all lower dimensions k of the M-dimensional problem (including the 3-dimensional level where it replaces prior art) even when k is much larger than three. FIG. 6 helps to explain this new hill climbing technique and illustrates the original k-dimensional cost function v [0126] For purposes of explanation, assume that in FIG. 6, k=4 (the procedure is used for all k≧3). This problem is reduced by two iterations of Lagrangian Relaxation to a 2-dimensional penalized cost function Φ [0127] Φ [0128] Φ [0129] and [3.4] were solved at all possible values of u [0130] than the v [0131] the Φ [0132] v [0133] minimization problem described by [3.1](a). Let {overscore (z)} Φ [0134] Consequently, the z [0135] Instead, the present invention defines all auxiliary function Ψ [0136] dimensional penalized cost function problem, lower order z [0137] explicitly makes the function Φ [0138] order sets of Lagrangian Coefficients with the expanded notation: Φ [0139] where v [0140] From the definition of Φ [0141] compared with Problem Formulation [3.2]):
[0142] it follows that:
[0143] and with that Equation 3.5 is extended to: Ψ [0144] This relationship means that either Φ [0145] that it equals Φ [0146] therefore always used, even for hill climbing from the second dimension. The use of the Ψ [0147] u [0148] u [0149] Ψ [0150] climbing/peak detection are to determine the gradient of the Ψ [0151] and then move up the Ψ [0152] increasing portion of the gradient. As shown in FIG. 6, any upward step on the Ψ [0153] the Φ [0154] is closer to the ideal set of u [0155] and then determine if the peak has been reached, the present invention optimizes this process by determining the single step size from the starting point at the minimum of Φ [0156] Ψ [0157] Ψ [0158] determine the gradient of each Ψ [0159] Ψ [0160] Ψ“bundle”) are determined at several points on the Ψ [0161] subdifferential set defined as: δΨ [0162] (where v [0163] Next, a subgradient vector is determined from this function. If z [0164] The iterative nature of the solution process at each dimension yields a set of such subgradients. Except for a situation described below where the resultant averaged gradient does not point toward the peak, the most recent set of such subgradients are saved and used as the “bundle” for the peak finding process for this dimension. For example, at the k level there is a bundle of subgradients of the Ψ [0165] I.2.3. Step Size and Termination Criterion [0166] After the average gradient of the Ψ [0167] is to first specify an arbitrary step size, and then calculate the value of Ψ [0168] gradient. If the Ψ [0169] this probably means that the step has not yet reached the peak. Consequently, the step size is doubled and a new Ψ [0170] previous one. At that time, the step has gone too far and crossed over the peak. Consequently, the last doubling is rolled-back and that step size is used for the iteration. If the initial estimated Ψ [0171] step size is decreased by 50%. If this still results in a smaller Ψ [0172] previous step size is decreased by 25%. The following is a more detailed description of this process. [0173] With a suitable bundle of subgradients determined as just described. Wolfe's algorithm can be used to determine the effective subgradient (d) and the Upgraded value u
[0174] is calculated as an estimate of u [0175] Three distinct criterion are used to determine when u [0176] 1. The Wolfe's algorithm criterion of d=0 given that the test has been repeated with the bundle containing only the most recent subgradient. [0177] 2. The difference between the lower bound Φ [0178] 3. An iteration count being exceeded. [0179] The use of limits on the iteration are particularly effective for iterations at the level 3 through n-1 levels, as these iterations will be repeated so as to resolve higher order coefficient sets. With limited iterations the process is in general robust enough to improve the estimate of upper order Lagrangian Coefficients. By limiting the iteration counts then the total processing time for the algorithm becomes deterministic. That characteristic means the process can be effective for real time problems such as radar, where the results of the last scan of the environment must be processed prior to the next scan being received. [0180] I.2.4. Solution Recovery [0181] The following process determines if the u [0182] approximate the u [0183] Formulation [3.2] to determine a set of z assignments for k−1 points. During the foregoing reduction process, Problem Formulation [3.4] yielded a tentative list of k selected z points that can be described by their indices as:
[0184] where N [0185] with m [0186] However, if the solution for Problem Formulation [3.2] is not feasible (decision h [0187] and j=0, . . . , N [0188] If the resulting 2-dimensional assignment problem,
[0189] has a feasible solution then the indices of that solution map to the solution of Problem Formulation [3.1] for the k-dimensional problem. The first index in each resultant solution entry is the pointer back to an element of the
[0190] list. That element supplies the first k-1 indices of the solution. The second index of the solution to the recovery problem is the k [0191] If Problem Formulation [3.9] does not have a feasible solution then the value of u [0192] I.3. Partitioning [0193] A partitioning process is used to divide the cost matrix that results from the Scoring step [0194] In partitioning to groups no consideration is given to the actual cost values. The analysis depends strictly on the basis of two or more cost elements sharing the same specific axis of the cost matrix. In a 2-dimensional case two cost elements must be in the same group if they share a row or a column. If the two elements are in the same row, then each other cost clement that is also in the same row, as well as any cost elements that are in columns occupied by members of the row must be included in the group. The process continues recursively. In literature it is referred to as “Constructing a Spanning Forest.” The k-dimensional case is analogous to the 2-dimensional case. The specific method we have incorporated is a depth first search, presented by Aho, Hopecraft, and Ullman, in “Design and Analysis of Computer Algorithms,” section 5.2, published by Addison-Westley, Mass. [0195] The result of partitioning at level M is the set of problems described as {P [0196] As hypothesis are constructed the first clement is used to refer to the track id. Any problem in the partitioned set which does not have shared costs in the first scan represent a case where a track could be extended in several ways but none of the ways share an observation with any other track. The required solution hypothesis for this case is the particular hypothesis with the maximum likelihood. For this case all likelihoods are determined as was described in Scoring and the maximum is selected. [0197] In addition to partitioning at the M level, partitioning is applied to each subsequent level M−1, . . . , 2. For each problem that was not eliminated by either by the prior selection partitioning is repeated, ignoring observations that are shared in the last set of observations. Partitioning recognizes that relaxation will eliminate the last constraint set and thus partitioning is feasible for the lower level problems that will result from relaxation. This process is repeated for all levels down to k=3. The full set of partitionings can be performed in the Problem Formulation Step [0198] There are two possible solution methods for the remaining problems. “Branch and Bound” as was previously described, or assigned to both tracks. The fruitfulness of partitioning increases for lower and lower levels of relaxation. [0199] The following is a more detailed description of the partitioning method. Its application at all but the M level depends upon the relaxation process described in this invention. The recursive partitioning is therefore a distinct part of this invention. The advantage of this method is greatly enhanced by the sparse cost matrix resulting from tracking problems. However the sparse nature of the problem requires special storage and search techniques. [0200] A hypothesis is the combination of the cost element c [0201] The partitioning after each level of Lagrangian Relaxation is effective because when a problem is relaxed, the constraint that requires each point to be assigned to only one track is eliminated (for one image at a time). Therefore, two tracks previously linked by contending for one point will be unlinked by the relaxation which permits the point to be the hypothesis set are stored. The hypothetical set in list form is:
[0202] For each dimension k=1 . . . M there exists a set of lists, with each list element being a pointer to a particular hypothesis:
[0203] where N [0204] Given this description of the matrix storage technique then the partitioning technique is as follows: Mark the first list L [0205] Isolated problems can result from one source track having multiple possible extensions or from a set of source tracks contending for some observations. Because one of the indices of k (in our implementation it is k=1) indicate the source track then it is possible to categorize the two problem types by observing if the isolated problem includes more than one L-list from the index level associated with tracks. [0206] I.4. Subsequent Track Prediction [0207] As noted above, after the points are assigned to the respective tracks, some action is taken such as controlling take-offs and landings to avoid collision, advising airborne aircraft to change course, warning airborne aircraft of an adjacent aircraft in a commercial environment, or aiming and firing an anti-aircraft (or anti-missile) missile, rocket or projectile, or taking evasive action in a military environment. Also, the tracking can be used to position a robot to work on an object. For some or all of these applications, usually the tracks which have just been identified are extended or extrapolated to predict a subsequent position of the aircraft or other object. The extrapolation can be done in a variety of prior art ways; for example, straight line extensions of the most likely track extension hypothesis, parametric quadratic extension of the x versus time, y versus time, etc. functions that are the result of the filtering process described earlier, least square path fitting or Kalman filtering of just the selected hypothesis. [0208] The process of gating, filtering, and gate generation as they were previously described require that a curve be fit through observations such that fit of observations to the likely path can be scored and further so that the hypothetical target future location can be calculated for the next stage of gating. In the implementation existing, quadratic functions have been fit through the measurements that occur within the window. A set of quadratics is used, one per sensor measurement. To calculate intercept locations these quadratics can be converted directly into path functions. Intercept times are then calculated by prior methods based upon simultaneous solution of path equations. [0209] The use of the fitted quadratics is not as precise as more conventional filters like the Kalman Filter. They are however much faster and sufficiently accurate for the relative scores required for the Assignment problem. When better location prediction is required then the assignment problem is executed to select the solution hypothesis and based upon the observations in those hypothesis the more extensive Kalman filter is executed. The result is tremendous computation savings when compared with the Kalman Filter being run on all hypothetical tracks. [0210] Based on the foregoing, apparatus and methods have been disclosed for tracking objects. However, numerous modifications and substitutions can be made without deviating from the scope of the present invention. For example, the foregoing Ψ [0211] u [0212] Ψ [0213] Φ [0214] be as efficient it seems likely that the method would converge. Therefore, the invention has been disclosed by way of example and not limitation, and reference should be made to the following claims to determine the scope of the present invention. [0215] II. AN ALTERNATIVE EMBODIMENT OF THE MULTI-DIMENSIONAL ASSIGNMENT SOLVING PROCESS [0216] The following description provides an alternative second embodiment of the multi-dimensional assignment solving process of section I.1. However, in order to clearly describe the present alternative embodiment, further discussion is first presented regarding the data assignment problem of partitioning measurements into tracks and false alarms and, in particular, the representation of multi-dimensional assignment problems. [0217] II.1. Formulation of the Assignment Problem [0218] The goal of this section is to explain the formulation of the data association problems, and more particularly multi-dimensional assignment problems, that govern large classes of problems in centralized or hybrid centralized-sensor level multisensor/multitarget tracking. The presentation is brief; technical details are presented for both track initiation and maintenance in A. B. Poore, [0219] The data assignment problems for multisensor and multitarget tracking considered here are generally posed as that of maximizing the posterior probability of the surveillance region (given the data) according to
[0220] where Z Γ* γ [0221] P(Γγ|Z [0222] Consider M observation sets Z(k) (k=1, . . . ,N) each of N [0223] and let Z [0224] respectively. In multisensor data fusion and multitarget tracking the data sets Z(k) may represent different classes of objects, and each data set can arise from different sensors. For track initiation the objects are measurements that must be partitioned into tracks and false alarms. In the formulation of track extensions a moving window over time of observations sets is used. The observation sets will be measurements which are: (a) assigned to existing tracks, (b) designated as false measurements, or (c) used for initiating tracks. However, note that alternative data objects instead of observation sets may also be fused such as in sensor level tracking wherein each sensor forms tracks from its own measurements and then the tracks from the sensors are fused in a central location. Note that, as one skilled in the art will appreciate, both embodiments of the present invention may be used for this type of data fusion. [0225] The data assignment problem considered presently is represented as a case of set partitioning defined in the following way. First, for notational convenience in representing tracks, a zero index is added to each of the index sets in [5.2], a gap filler z [0226] Next under appropriate independence assumptions it can be shown that:
[0227] where L [0228] Using [5.3] and the zero-one variable z [0229] where c [0230] Expressions for the likelihood ratios L [0231] Computational Optimization and Applications, 3 (1994), pp. 27-57; and Ingemar J. Cox, Pierre Hansen, and Beta Julesz, eds., Partitioning Data Sets, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, R.I., v. 19, 1995, pp. 169-198. Furthermore, the likelihood ratios are easily modified to include target features and to account for different sensor types. Also note that in track initiation, the M observation sets provide observations from M sensors, possibly all the same. Additionally note that for track maintenance, a sliding window of M observation sets and one data set containing established tracks may be used. In this latter case, the formulation is the same as above except that the dimension of the assignment problem is now M+1. [0232] II.2. Overview of the New Lagrangian Relaxation Algorithms [0233] Having formulated an M-dimensional assignment problem [5.5], we now turn to a description of the Lagrangian relaxation algorithm. Subsection II.2.1 below presents many of the relaxation properties associated with the relaxation of an n-dimensional assignment problem to an m-dimensional one via a Lagrangian relaxation of n-m sets of constraints wherein m<n≦M and preferably in the present invention embodiment n−m>1. Although any n−m constraint sets can be relaxed, the description here is based on relaxing the last n-m sets of constraints and keeping the first m sets. Given either an optimal or suboptimal solution of the relaxed problem, a technique for recovering a feasible solution of the n-dimensional problem is presented in subsection II.2.2 below and an overview of the Lagrangian relaxation algorithm is given in subsection II.2.3. [0234] The following notation will be used throughout the remainder of the work. Let M be an integer such that M≧3 and let nε{3, . . . ,M}. The n-dimensional assignment problem is
[0235] To ensure that a feasible solution of [6.1] always exists, all variables with exactly one nonzero index (i.e., variables of the form z [0236] II.2.1. The Lagrangian Relaxed Assignment Problem [0237] The n-dimensional assignment problem [6.1] has n sets of constraints. A (N [0238] wherein we have added the multiplier u [0239] An optimal (or suboptimal) solution of [6.2] can be constructed from that of an m-dimensional assignment problem. To show this, define for each (i [0240] (If (j [0241] As an aside, observe that any feasible solution z [0242] Thus, the m-dimensional assignment problem [6.4] has at least as many feasible solutions of the constraints as the original problem [6.1]. [0243] The following Fact A.2 has been shown to be true. It states that an optimal solution of Problem Formulation [6.2] can be computed from that of Problem Formulation [6.4]. Furthermore, the converse to this fact is provided in Fact A.3. Moreover, if the solution of either of these two problems [6.2] or [6.4] is ε-optimal (i.e., the objective function associated with the suboptimal solution is within “ε” of the objective function associated with the optimal solution), then so is the other. [0244] Fact A.2. Let w [0245] Then w [0246] If, in addition, w [0247] With the exception of one equality being converted to an inequality, the following Fact is a converse of Fact A.2 and has also been shown to be true. [0248] Fact A.3. Let w [0249] Then w [0250] If, in addition, w [0251] {circumflex over (Φ)} [0252] II.2.2. The Recovery Procedure [0253] The next objective is to explain a recovery procedure or method for recovering a solution to the n-dimensional problem of [6.1] from a relaxed problem having potentially substantially fewer dimensions than [6.1]. Note that this aspect of the alternative embodiment of the present invention is substantially different from the method disclosed in the first embodiment of the multi-dimensional assignment solving process of section I.1 of this specification. Further, this alternative embodiment provides substantial benefits in terms of computational efficiency and accuracy over the first embodiment, as will be discussed. Thus, given a feasible (optimal or suboptimal) solution w [0254] Let
[0255] be an enumeration of indices of w [0256] c [0257] k=m+1, . . . , n; j=0, . . . ,N [0258] Let Y denote the solution of the (n−m+1)-dimensional assignment problem:
[0259] The recovered feasible solution z [0260] This recovery procedure is valid as long as all cost coefficients c [0261] Otherwise, since all variables of the form z [0262] II.3. The Multi-Dimensional Lagrangian Relaxation Algorithm for the n-Dimensional Assignment Problem Starting with the M-dimensional assignment problem [6.1], i.e., n=M, the algorithm described below is recursive in that the M-dimensional assignment problem is relaxed to an m-dimensional problem by incorporating (n−m) sets of constrains into the objective function using Lagrangian relaxation of this set. This problem is maximized with respect to the Lagrange multipliers, and a good suboptimal solution to the original problem is recovered using an (n−m+1)-dimensional assignment problem. Each of these two (the m-dimensional and the (n−m+1)-dimensional assignment problems) can be solved in a similar manner. [0263] More precisely, reference is made to FIG. 8 which presents a flowchart of a procedure embodying the multi-dimensional relaxation algorithm, referred to immediately above. This procedure, denoted MULTI_DIM_RELAX in FIG. 8, has three formal parameters, n, PROB_FORMULATION and ASSIGNMT_SOLUTION, which are used to transfer information between recursive instantiations of the procedure. In particular, the parameter, n, is an input parameter supplying the dimension for the multi-dimensional assignment problem (as in [6.1]) which is to be solved (i.e., to obtain an optimal or near-optimal solution). The parameter, PROB_FORMULATION, is also an input parameter supplying the data structure(s) used to represent the n-dimensional assignment problem to be solved. Note that PROB_FORMULATION at least provides access to the cost matrix, [c [0264] A description of FIG. 8 follows. Assuming MULTI_DIM_RELAX is initially invoked with M as the value for the parameter n and the PROB_FORMULATION having a data structure(s) representing an M-dimensional assignment problem as in [5.5], in step [0265] Also note that for m>2, a solution to the optimization problem of step [0266] If option (a) immediately above is chosen, then the auxiliary functions are used as approximation functions for obtaining at least a near-optimal solution to the optimization problem of step [0267] Alternatively, if option (b) above is chosen, then two important advantages result: the optimization problem of step [0268] Subsequently, in step [0269] In step [0270] Alternatively, if in step [0271] II.3.1. Comments on the Various Procedures Provided by FIG. 8 [0272] There are many procedures described by FIG. 8. One such procedure is the first embodiment of the multi-dimensional assignment solving process of section I.1. That is, by specifying m=n−1 in step [0273] Between these two procedures are a host of different relaxation schemes based on relaxing n—m sets of constraints to an m-dimensional problem (2<m<n), but these all have the same difficulties as the procedure for the first embodiment of section I.1 in that the relaxed problem is an NP-hard problem. To resolve this difficulty, we use an auxiliary or merit function Ψ [0274] II.4. Details and Refinements Relating to the Flowchart of FIG. 8 [0275] Further explanation is provided here on how various steps of FIG. 8 are solved. Note that the refinements presented here can significantly increase the speed of the relaxation procedure of step [0276] II.4.1 Maximization of the Non-smooth Function Φ [0277] One of the key steps in the Lagrangian relaxation algorithm in section II.3 is the solution of the problem Maximize {Φ [0278] where u [0279] Fact A.4. Let u Φ [0280] Furthermore, Φ [0281] for all u [0282] Most of the procedures for non-smooth optimization are based on generalized gradients called subgradients, given by the following definition. [0283] Definition. At u=(u δΦ [0284] A vector qεδΦ [0285] If z [0286] If z [0287] Φ [0288] unique, then there are finitely many such solutions, say z [0289] {g [0290] II.4.2 Mathematical Description of a Merit or Auxiliary Function [0291] For real-time needs, one must address the fact that the non-smooth optimization problem of step [0292] where the multipliers {overscore (u)} [0293] be solved optimally if m=2. For sufficiently small problems (6.2) or (6.4), one can more efficiently solve the NP-hard problem by branch and bound. This is the reason for the inclusion of the first case; otherwise, the relaxed function Φ [0294] the merit function provides a lower bound for the optimal solution follows directly from Fact A.4 and the following fact. [0295] Fact A.5. Given the definition of Ψ [0296] Ψ [0297] {overscore (u)} [0298] The actual function value used in the optimization phase is Ψ [0299] with the solution z [0300] To explain how the merit function is used, suppose there is a current multiplier set (u [0301] An illustration of this merit function for m=n−1 is given in “PARTITIONING MULTIPLE DATA SETS, MULTIDIMENSIONAL ASSIGNMENTS AND LAGRANGIAN RELAXATION”, by Aubrey B. Poore and Nenad Rijavec, and in “QUADRATIC ASSIGNMENT AND RELATED PROBLEMS, DIMACS SERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE”, in American Mathematical Society, Providence, R.I., Vol. 16, 1994, pp. 25-37 edited by Panos M. Pardalos and Henry Wolkowicz. [0302] II.4.3 Non-smooth Optimization Methods [0303] By Fact A.4 the function Φ [0304] A more recent and sophisticated class of methods are the bundle methods; excellent developments are presented in the books of Hiriart-Urruty and Lemaréchal: J.-B. Hiriart-Urruty and C. Lemaréchal, [0305] All of the above non-smooth optimization methods require the computation Φ [0306] II.4.4 The Two Dimensional Assignment Problem [0307] The forward/reverse auction algorithm of Bertsekas and Castańon (as described in D. P. Bertsekas and D. A. Castańon, [0308] II.4.5. Initial Multipliers and Hot Starts [0309] The effective use of “hot starts” is fundamental for real-time applications. A good initial set of multipliers can significantly reduce the number of non-smooth iterations (and hence the number of Φ [0310] Further, for track maintenance, initial feasible solutions are generated as follows. When a new scan of information (a new observation set) arrives from a sensor, one can obtain an initial primal feasible solution by matching new reports to existing tracks via a two dimensional assignment problem. This is known as the track-while-scan (TWS) approach. Thus, an initial primal solution exists and then we use the above relaxation procedure is to make improvements to this TWS solution. Also for track maintenance, multipliers are available from a previously solved and closely related multi-dimensional assignment problems for all but the new observation set. [0311] II.4.6. Local Search Methods [0312] Given a feasible solution of the multi-dimensional assignment problem, one can consider local search procedures to improve this result, as described in C. H. Papadimitriou and K. Steiglitz, [0313] II.4.7. Problem Decomposition [0314] The procedures described thus far are all based on relaxation. Due to the sparsity of assignment problems, however, frequently a decomposition of the problem into a collection of disjoint components can be done wherein each of the components can be solved independently. Due to the setup costs of Lagrangian relaxation, a branch and bound procedure is generally more efficient for small components, say ten to twenty feasible 0-1 variables (i.e., z [0315] Z={z N={z [0316] and arcs, [0317] A={(z [0318] such that j [0319] Note that the nodes corresponding to zero index have not been included in the above defined graph, since two variables that have only the zero index in common can be assigned independently. Connected components of the graph are then easily found by constructing a spanning forest via a depth first search. (A detailed algorithm can be found in the book by Aho, Hopcroft and Ullman cited above). Furthermore, this procedure is used at each level in the relaxation, i.e., is applied to each assignment problem [3.1] for n=3, . . . ,M. [0320] The original relaxation problem is decomposed first. All relaxed assignment problems can be decomposed a priori and all recovery problems can be decomposed only after they are formulated. Hence, in the n-to-(n-1) case, we have n-2 relaxed problems that can all be decomposed initially, and the recovery problems that are not decomposed (since they are all two dimensional). In the n-to-2 case, we have only one relaxed problem that can be decomposed initially. This case yields n-3 recovery problems, which can be decomposed only after they are formulated. [0321] The ever-increasing demand for sensor surveillance systems is to accurately track and identify objects in real-time, even for dense target scenarios and in regions of high track contention. The use of multiple sensors, through more varied information, has the potential to greatly improve target state estimation and identification. However, to take full advantage of the available data, a multiple frame data association approach is needed. The most popular such approach is an enumerative technique called multiple hypothesis tracking (MHT). As an enumerative technique, MHT can be too computationally intensive for real-time needs because this problem is NP-hard. A promising approach is to utilize the recently developed Lagrangian relaxation algorithms for the multidimensional assignment problem; however, there are many other potentially good approaches to these assignment problems such as LP relaxation combined with an interior point method, GRASP, and parallelization. [0322] These data association problems are fundamentally important in tracking. Thus, our first objective is to present an overview of the tracking problem and the context within which these data association problems fit. Following a brief review of the probabilistic framework for data association, the second objective is to formulate two models for track initiation and maintenance as multidimensional assignment problems. This formulation is based on a window moving over the frames of data. The first and simpler model uses the same window length for track initiation and maintenance, while the second model uses different lengths. As the window moves over the frames of data, one creates a sequence of these multidimensional assignment problems and there is an overlap region of frames common to adjacent windows. Thus, given the solution of one problem, one can develop a warm start for the solution to the next problem in the sequence, as shown hereinafter. Such information is critically important to the design of real-time algorithms. [0323] Tracking and data fusion are complex subjects of specialization that can only be briefly summarized as they are related to the subject of this paper. The processing of track multiple targets using data from one or more sensors is typically partitioned into two stages or major functional blocks, namely, signal processing and data process. The first stage is the signal processing that takes raw sensor data and outputs reports. Reports are sometimes called observations, threshold exceedances, plots, hits, or returns, depending on the type of sensor. The true source of each report is usually unknown and can be due to a target of interest, a false signal, or persistent background objects that can be moving in the field of view of the sensor. [0324] Two principal functions of data processing are tracking and discrimination or target identification. The discrimination or target identification function distinguishes between tracks that are for targets of interest and other tracks such as those due to background. Also, if there is enough information, each track is classified as to the type of target it appears to represent. Target identification and discrimination will not be discussed further in this paper except to comment here on the use of attributes (including identification information) in the data association. [0325] There are two types of attributes or features, namely, discrete valued variables and continuous valued variables. Available attributes of either or both types should be used in computing the log likelihoods or scores for data association. In discussing tracking in this paper, the attributes will not be mentioned explicitly but it should be understood that some reports and some tracks may include attributes information that should be and can be used in the track processing (both data association and filtering) if it is useful. [0326] The tracking function accepts reports for each frame of data and constructs or maintains a target state estimate, the variance-covariance matrix of the state estimation error, and refined estimates (or probabilities) of the target attributes. The state estimate typically includes estimates of target position and velocity in three dimensions and possibly also acceleration and other variables of interest. [0327] The tracking function is typically viewed in two stages, namely, data association and filtering. Also, the process of constructing new tracks, called track initiation, is different from the process of updating existing tracks, called track maintenance. [0328] In track maintenance, the data association function decides how to relate the reports from the current frame of data to the previously computed tracks. In one approach, at most one report is assigned to each track, and in other approaches, weights are assigned to the pairings of reports to a track. After the data association, the filter function updates each target state estimate using the one or more (with weights) reports that were determined by the data association function. A filter commonly used for multiple target tracking and data fusion is the well know Kalman filter (or the extended Kalman filter in the case of nonlinear problems) or a simplified version of it. [0329] In track initiation, typically a sequence of reports is selected (one from each of a few frames of data) to construct a new track. In track initiation, the filtering function constructs a target state estimate and related information based on the selected sequence of reports. The new track is later updated by the track maintenance processing of the subsequent frames of reports. [0330] In some trackers, there is also a tentative tracking function for processing recently established tracks until there is enough confidence to include them in track maintenance. While for simplicity of presentation, tentative tracking will not be included in the processing discussed in this paper, the techniques discussed could readily include one or more tentative tracking functions. [0331] There have been numerous approaches developed to perform the data association function. Since optimal data association is far too complex to implement, good but practical sub-optimal approaches are pursued. Data association approaches can be classified in a number of ways. On way to classify data association approaches is based on the number of data frames used in the association process. In single frame data association for track maintenance, “hard decisions” are made each frame as to how the reports are to be related to the tracks. Some single frame approaches include: individual nearest neighbor, PDA, JPDA, and global nearest neighbor (sequential most probable hypothesis tracking), which uses a two dimensional assignment algorithm. In most single frame data association approaches, only one track per object is carried forward to be used in processing the next frame of reports. [0332] Multiple frame data association is more complex and frequently involves purposely carry forward more than one track per target to be used in processing the next frame of reports. By retaining more than one track per target, the tracking performance is improved at the cost of increased processing load. The best known multiple frame data association approach is an enumerative technique called multiple hypothesis tracking (MHT) which enumerates all the global hypothesis with various pruning rules. [0333] As shown hereinafter, the log likelihood of the probability of a global hypothesis can be decomposed into the sum of scores of each track that is contained in the hypothesis. As a consequence, the most probable hypothesis can be identified with the aid of a non-enumerative algorithm for the assignment so formulated. [0334] There are a number of ways that track initiation and track maintenance functions can interact. Two ways that are especially pertinent to the methods of this paper will be discussed in this section. [0335] One approach is to treat these two functions sequentially, by first assigning reports to tracks and then using the information that remains to form new tracks. A better approach is to integrate both processes where initiating tracks compete for the new frame of reports on an equal basis, i.e., at the same time. [0336] In the integrated approach, the data association for track initiation and track maintenance processing are combined and conducted simultaneously. One assignment array is created that includes the track scores for potential tracks for both track initiation and track maintenance. The first dimension of the assignment problem includes only all the tracks either created or updated in the processing of the prior frames of reports. Each of the remaining dimensions accommodates one frame of reports. [0337] After the assignment algorithm finds a solution, each of the previously established tracks are updated with the report assigned to it from the second dimension of the assignment array. The remaining reports in the second dimension that were in the assignment solution are firmly established as track initiators. The unassigned reports in the second dimension of the assignment array are discarded as false signals. The processing of the next frame of reports repeats this process using these updated tracks and the newly identified initiators in the first dimension of the cost array for processing the new frame of reports. Details of this approach are discussed hereinafter. [0338] The integrated approach just discussed, uses the same number of frames of reports for both track initiation and track maintenance. The goal in using the multi-dimensional assignment algorithm is to provide improved performance while minimizing the amount of processing required. Typically, track initiation will benefit from more frames of reports than will track maintenance. Thus a second approach that integrates track initiation and track maintenance is discussed hereinafter, wherein the number of frames of reports is not the same for these two functions. This is a novel approach that is introduced in this paper. [0339] There are many advantages and many ways to combining data from multiple sensors. There are also many ways of categorizing the different algorithmic architectures for processing data from multiple sensors. One approach outlines four generic algorithmic architectures. Two of these generic architectures are especially pertinent to this paper and are summarized briefly. [0340] In the Centralized Fusion algorithmic architecture, reports are combined from the various sensors to form global tracks. This algorithmic architecture is also called Central Level Tracking, Centralized Algorithmic Architecture, or simply the Type IV algorithmic architecture. In track maintenance for example, if a single frame data association is used, then for data association a frame of reports from one sensor is processed with the latest global tracks; then the global tracks are updated by the filter function. After the processing of this frame of reports is completed, a frame of the reports from another (or the same) sensor is processed with these updated global tracks. This process is continued as new frames of data become available to the system as a whole. [0341] In Centralized Fusion, using the multi-dimensional assignment algorithm for the data association with multiple sensors is similar to the processing of data from a single sensor. Instead of using multiple frames of reports from a single sensor, the multiple frames of reports come from multiple sensors. The frames of reports from all the sensors are ordered based on the nominal time each frame of reports is obtained and independent of which sensor provided the reports. In this way the approaches discussed in this paper can be extended to process reports from multiple sensors using the Centralized Fusion algorithmic architecture. [0342] The second pertinent algorithmic architecture is Track Fusion. This approach is also called the Hierarchical or Federated algorithmic architecture, sensor level tracking or simply the Type II algorithmic architecture. In track maintenance for example, a processor for each sensor computes single sensor tracks; these tracks are then forwarded to the global tracker to compute global tracks based on data from all sensors. [0343] After the first time a sensor processor forwards tracks to the global tracker, then subsequent tracks for the same targets are cross-correlated with the existing global tracks. This track-to-track cross-correlation is due to the common history of the current sensor tracks and the tracks from the same sensor that were forwarded earlier to the global tracker. The processing must take this cross-correlation into account and there are a number of ways of compensating for this-cross-correlations. One method for dealing with this cross-correlation is to decorrelate the sensor tracks that are sent to the global tracker. There are a variety of ways to achieve this decorrelation and some are summarized in Drummond, 1996, [0344] Once the sensor tracks are decorrelated they can be processed by the global tracker in almost the same way as reports are processed. In the case of track fusion the association process is referred to as track (or track-to-track) association rather than data (or report-to-track) association. If the sensor tracks are decorrelated, the global tracker can process the tracks from the various sensor processors in much the same way that the global tracker of Centralized Fusion processes reports. Accordingly the methods described in this paper can be readily extended to processing data from multiple sensors using either the Centralized Fusion or Track Fusion or even a hybrid combination of both algorithmic architectures. [0345] The goal of this section is to briefly outline the probabilistic framework for the data association problems presented in this work. The technical details are presented elsewhere. The data association problems for multisensor and multitarget tracking considered in this work are generally posed as that of maximizing the posterior probability of the surveillance region (given the data) according to Maximize {p(Γ=γ|Z [0346] where Z [0347] Γδ γ [0348] partition, and P(Γ γ|Z [0349] Consider N+1 data sets Z(k)(k=1, . . . , N+1), each consisting of M [0350] respectively. (The dummy report z [0351] We specialize the problem to the case of set partitioning defined in the following way. Define a “track of data” as {z [0352] Next, under appropriate independence assumptions one can show
[0353] L [0354] Then, recognizing that
[0355] the problem (3.1) can be expressed as the N+1-dimensional assignment problem
[0356] where c [0357] In this section we explain two multiframe assignment formulations to the track initiation and maintenance problem. The continued use of all prior information is computationally intensive for tracking, so that a window sliding over the frames of reports is used as the framework for track maintenance and track initiation within the window. The objectives are to describe an improved version of a simple method and then to put this into a more general framework in which track initiation and maintenance have different length moving windows. [0358] The first method as explained in this section is an improved version of our first track maintenance scheme and uses the same window length for track initiation and maintenance after the initialization step. The process is to start with a window of length N+1 anchored at frame one. In the first step one there is only track initiation in that we assume no prior existing tracks. In the second and all subsequent frames, there is a window of length N anchored at frame k plus a collection of tracks up to frame k. This window is denoted by {k; k+1, . . . , k+N}. The following explanation of the steps is much like mathematical induction in that we explain the first step and then step k to step k+1. [0359] Track Maintenance and Initiation: Step 1. Let
[0360] be an enumeration of all those zero-one variables in the solution of the assignment problem (3.5) (i.e., z [0361] Consider only the first two index sets in this enumeration (4.1) and add the zero index l [0362] The notation T [0363] To explain the costs for the new problem, one starts with the hypothesis that a partition γεΓ* being true is now conditioned on the truth of the pairings on the first two frames being correct. Corresponding to the sequence {T [0364] Next, define the cost and the corresponding zero-one variable
[0365] respectively. Then the track maintenance problem Maximize {Lγ|γεΓ* assignment
[0366] Track Maintence and Initiation: Step k. At the beginning of the k [0367] where for the first step l [0368] where T [0369] Suppose problem (4.4) has been solved and let the solution, i.e., those zero-one variables equal to one, be enumerated by
[0370] with the following exceptions. [0371] a. All zero one variables for which (l [0372] b. All zero-one variables whose subscripts have the form l [0373] c. All variables (z [0374] are all dummy. Any solution with this feature corresponds to a terminated track. [0375] Given the enumeration (4.5), one now fixes the assignments on the first two index sets in the list (4.5). The zero index l [0376] Then, for l [0377] The corresponding hypothesis about a partition γεΓ* being true is now conditioned on the truth of the L [0378] Next, define the cost and the zero-one variable by said at least one inert gas has an amount, on a molar basis, that is greater than the amount of said oxygen in said pressurized medium; c [0379] is assigned to T [0380] In the first approach the window lengths were the same for both track maintenance and initiation. This can be inefficient in that one can usually use a shorter window for track maintenance than for track initiation. This section addresses such a formulation. [0381] The General Step k. To formulate a problem for track initiation and maintenance we consider a moving window centered as frame k of length I+J+1 denoted by [k−I, . . . , k, . . . , k+J]. In this representation, the window length for track maintenance is J and that for initiation, I+J+1. The objective will be to explain the situation at this center and then the move to the same length window at center k+1 denoted by [k+1−I, . . . , k+1, . . . , k+1+J], i.e., by moving the frame one frame at time to the right. The explanation from the first step follows hereinafter. [0382] The notation for a track of data is T [0383] where the index l T T T [0384] Given this notation for the tracks and partition of the data in the frames {k−I, . . . , k, . . . , k+J} , L [0385] L [0386] L [0387] respectively. [0388] The cost for the assignment of {z [0389] respectively. Likewise, for costs associated with the false reports on the frames k-I to k and as associated with {z [0390] For the window of frames in the range [k−I, . . . , k], the easiest explanation of the partition of the reports is based on the definitions [0391] T [0392] i.e., to one of the T [0393] [0394] so that all of those reports not used in the tracks T [0395] Suppose problem (4-14) has been solved and let the solution, i.e., those zero-one variables equal to one, be
[0396] with the following exceptions. [0397] a. All zero one variables in the second list for which (i [0398] b. All false reports axe excluded, i.e., all zero-one variables in the second list whose subscripts have exactly one nonzero index. [0399] c. All variables z [0400] Given the enumeration (4.15), one now fixes the assignments on the all index sets up to and including the (k+1) [0401] Thus one can now formulate the assignment problem for the next problem exactly as in (4-14) but with k replaced by k+1. Thus, we do not repeat it here. [0402] The Initial Step. Here is one explanation for the initial step. First, assume that N=I+J. In this case, we start the track initiation with a solution of (3.5). Let
[0403] be an enumeration of the solution set of (3.5), i.e., those zero-one variables z [0404] If I+J>N, then one possibility is to start the process with N+1 frames, and assuming J≦N, proceed as before replacing I by N−J for the moment, and continue to add frames without lopping off the first frame in the window until reaches a window of length I+J+1. Then we proceed as in the previous paragraph. [0405] If I+J<N, then one can solve the track initiation problem (3.5), formulate the problem with the center of the window at k+1=N+1−J, enumerate the solutions as above, and lop off the first N−J−I frames. Then, we proceed just as in the case I+J=N. [0406] A primary objective in this work has been to demonstrate how multidimensional assignment problems arise in the tracking environment. The problem of track initiation and maintenance has been formulated within the framework of a moving window over the frames of data. The solution of these NP-hard, noisy, large scale, and sparse problems to the noise level in the problem is fundamental to superior track estimation and identification. Thus, one must utilize the special structure in the problems as well take advantage of special information that is available. Since these moving windows are overlapping, there are some algorithm efficiencies that can be identified and that take advantages of the overlap in the windows from one frame of reports to the next. Here is an example of the use of a primal solution of one problem to warm start the solution of the next problem in the sequence. [0407] Suppose we have solved problem (4.4) and have enumerated all those zero-one variables in the solution of (4.4) as in (4.5). Add the zero index l {(l [0408] With this enumeration one can define the cost by c [0409] and the two dimensional assignment problem
[0410] Let w be an optimal or feasible solution to this two-dimensional assignment problem and define
[0411] This need not satisfy the constraints in that there are usually many objects left unassigned. Thus, one can complete the assignment by using the zero-one variables in (4.4) with k replaced by k+1 with exactly one nonzero index corresponding to any unassigned object or data report. [0412] For the dual solutions, the multipliers arising from the solution of the two dimensional assignment problem (5.3) corresponding to the second variable, i.e.,
[0413] These are good initial values for use in a relaxation scheme [11,12]. Finally, note that one can also develop a warm start for problem (4.14) in a similar fashion. [0414] Multidimensional assignment problems govern the central problem of data association in multisensor and multitarget tracking, i.e., the problem of partitioning observations from multiple scans of the surveillance region and from either single or multiple sensors into tracks and false alarms. This fundamental problem can be stated as
[0415] where c [0416] The data association problems in tracking that are formulated as (1.1) have several characteristics. They are normally sparse, the cost coefficients are noisy and the problem is NP-hard, but it must be solved in real-time. The only known methods for solving this NP-hard problem optimally are enumerative in nature, with branch-and-bound being the most efficient; however, such methods are much too slow for real-time applications. Thus one must resort to suboptimal approaches. Ideally, any such algorithm should solve the problem to within the noise level, assuming, of course, that one can measure this noise level in the physical problem and the mathematical method provides a way to decide if the criterion has been met. [0417] There are many algorithms that can be used to construct suboptimal solutions to NP-hard combinatorial optimization problems. These include greedy (and its many variants), relaxation, simulated annealing, tabu search, genetic algorithms, and neural netork algorithms. For the three dimensional assignment problem, Pierskalla developed the tri-substitution method, which is a variant of the simplex method. Frieze and Yadegar introduced a method based on Lagrangian relaxation in which a feasible solution is recovered using information provided by the relaxed solution. Our choice of approaches is strongly influenced by the need to balance real-time performance and solution quality. Lagrangian relaxation based methods have been used successfully in prior tracking applications. An advantage of these methods is that they provide both an upper and lower bound on the optimal solution, which can then be used to measure the solution quality. These works extend the method of Frieze and Yadegar to the multidimensional case. [0418] The goal of this section is to explain the formulation of the data association problems that governs large classes of data association problems in centralized or hybrid centralized-sensor level multisensor/multitarget tracking. The presentation is brief; technical details are presented for both track initiation and maintenance in the work of Poore. The formulation is of sufficient generality to cover the MHT work of Reid, Blackman and Stein and modifications by Kurien to include maneuvering targets. As suggested by Blackman, this formulation can also be modified to include target features (e.g., size and type) into the scoring function. The recent work of Poore and Drummond significantly extends the work of this section to new approaches for multiple sensor centralized tracking. Future work will involve extensions to track-to-track correlation. [0419] The data association problems for multisensor and multitarget tracking considered in this work are generally posed as that of maximizing the posterior probability of the surveillance region (given the data) according to Maximize {P(Γ=γ|Z [0420] where Z [0421] Γ [0422] Γδ γ [0423] P(Γγ|Z [0424] Consider N data sets Z(k) (k=I, . . . , N) each of M [0425] and let Z [0426] respectively. In multisensor data fusion and multitarget tracking the data sets Z(k) may represent different classes of objects, and each data set can arise from different sensors. For track initiation the objects are measurements that must be partitioned into tracks and false alarms. In our formulation of track maintenance, which uses a moving window over time, one data set will be tracks and remaining data sets will be measurements which are assigned to existing tracks, as false measurements, or to initiating tracks. In sensor level tracking, the objects to be fused are tracks. In centralized fusion, the objects may all be measurements that represent targets or false reports, and the problem is to determine which measurements emanate from a common source. [0427] We specialize the problem to the case of set partitioning defined in the following way. First, for notational convenience in representing tracks, we add a zero index to each of the index sets in (2.2), a dummy report z [0428] Next under appropriate independence assumptions one can show
[0429] L [0430] Using (2.3) and the zero-one variable z [0431] where c [0432] Expressions for the likelihood ratios L [0433] To explain the costs for the new problem, one starts with the hypothesis that a partition γεΓ* conditioned on the truth of the pairings on the first two frames being correct. Corresponding to the sequence (T [0434] Next, define the cost and the corresponding zero-one variable
[0435] respectively. Then the track maintenance problem Maximize {Lγ|γεΓ* [0436] assignment
[0437] Track Maintence and Initiation: Step k. At the beginning of the k [0438] where for the first step l [0439] where T [0440] Suppose problem (4.4) has been solved and let the solution, i.e., those zero-one variables equal to one, be enumerated by
[0441] with the following exceptions. [0442] a. All zero one variables for which (l [0443] b. All zero-one variables whose subscripts have the form l [0444] c. All variables z [0445] Any solution with this feature corresponds to a terminated track. [0446] Given the enumeration (4.5), one now fixes the assignments on the first two index sets in the list (4.5). The zero index l [0447] Then, for [0448] The corresponding hypothesis about a partition γεΓ* being true is now conditioned on the truth of the L [0449] Next, define the cost and the zero-one variable by
[0450] respectively, so that the track extension problem, which was originally formulated as Maximize {L [0451] In the first approach the window lengths were the same for both track maintenance and initiation. This can be inefficient in that one can usually use a shorter window for track maintenance than for track initiation. This section addresses such a formulation. [0452] The General Step k. To formulate a problem for track initiation and maintenance we consider a moving window centered as frame k of length I+J+1denoted by [k−I, . . . , k, . . . , k+J] In this representation, the window length for track maintenance is J and that for initiation, I+J+1. The objective will be to explain the situation at this center and then the move to the same length window at center k+1 denoted by [k+1−I, . . . , k+1, . . . , k+1+J], i.e., by moving the frame one frame at time to the right. The explanation from the first step follows hereinafter. [0453] The notation for a track of data is T [0454] where the index l [0455] T [0456] T [0457] T [0458] Given this notation for the tracks and partition of the data in the frames {k-I, . . . , k, . . . , k+J}, [0459] L [0460] L [0461] The cost for the assignment of {z [0462] respectively. Likewise, for costs associated with the false reports on the frames k-I to k and as associated with {z [0463] For the window of frames in the range [k−I, . . . , k], the easiest explanation of the partition of the reports is based on the definitions [0464] F [0465] T [0466] Suppose problem (4.14) has been solved and let the solution, i.e., those zero-one variables equal to one, be enumerated by
[0467] with the following exceptions. [0468] a. All zero one variables in the second list for which (i [0469] b. All false reports are excluded, i.e., all zero-one variables in the second list whose subscripts have exactly one nonzero index. [0470] c. All variables z [0471] Given the enumeration (4.15), one now fixes the assignments on the all index sets up to and including the (k+1 ) [0472] Thus one can now formulate the assignment problem for the next problem exactly as in (4.14) but with k replaced by k+1. Thus, we do not repeat it here. [0473] The Initial Step. Here is one explanation for the initial step. First, assume that N=I+J. In this case, we start the track initiation with a solution of (3.5). Let
[0474] be an enumeration of the solution set of (3.5), i.e., those zero-one variables z [0475] If I+J>N, then one possibility is to start the process with N+1 frames, and assuming J≦N, proceed as before replacing I by N−J for the moment, and continue to add frames without lopping off the first frame in the window until reaches a window of length I+J+1. Then we proceed as in the previous paragraph. [0476] If I+J<N, then one can solve the track initiation problem (3.5), formulate the problem with the center of the window at k+1=N+1−J, enumerate the solutions as above, and lop off the first N−J−I frames. Then, we proceed just as in the case I+J=N. [0477] A primary objective in this work has been to demonstrate how multidimensional assignment problems arise in the tracking environment. The problem of track initiation and maintenance has been formulated within the framework of a moving window over the frames of data. The solution of these NP-hard, noisy, large scale, and sparse problems to the noise level in the problem is fundamental to superior track estimation and identification. Thus, one must utilize the special structure in the problems as well take advantage of special information that is available. Since these moving windows are overlapping, there are some algorithm efficiencies that can been identified and that take advantages of the overlap in the windows from one frame of reports to the next. Here is an example of the use of a primal solution of one problem to warm start the solution of the next problem in the sequence. [0478] Suppose we have solved problem (4.4) and have enumerated all those zero-one variables in the solution of (4.4) as in (4.5). Add the zero index l [0479] With this enumeration one can define the cost by c [0480] and the two dimensional assignment problem
[0481] Let w be an optimal or feasible solution to this two-dimensional assignment problem and define
[0482] This need not satisfy the constraints in that there are usually many objects left unassigned. Thus, one can complete the assignment by using the zero-one variables in (4.4) with k replaced by k+1 with exactly one nonzero index corresponding to any unassigned object or data report. [0483] For the dual solutions, the multipliers arising from the solution of the two dimensional assignment problem (5.3) corresponding to the second variable, i.e.,
[0484] These are good initial values for use in a relaxation scheme [11,12]. Finally, note that one can also develop a warm start for problem (4.14) in a similar fashion. [0485] Multidimensional assignment problems govern the central problem of data association in multisensor and multitarget tracking, i.e., the problem of partitioning observations from multiple scans of the surveillance region and from either single or multiple sensors into tracks and false alarms. This fundamental problem can be stated as
[0486] where c [0487] The data association problems in tracking that are formulated as (1.1) have several characteristics. They are normally sparse, the cost coefficients are noisy and the problem is NP-hard, but it must be solved in real-time. The only known methods for solving this NP-hard problem optimally are enumerative in nature, with branch-and-bound being the most efficient; however, such methods are much too slow for real-time applications. Thus one must resort to suboptimal approaches. Ideally, any such algorithm should solve the problem to within the noise level, assuming, of course, that one can measure this noise level in the physical problem and the mathematical method provides a way to decide if the criterion has been met. [0488] There are many algorithms that can be used to construct suboptimal solutions to NP-hard combinatorial optimization problems. These include greedy (and its many variants), relaxation, simulated annealing, tabu search, genetic algorithms, and neural netork algorithms. For the three dimensional assignment problem, Pierskalla developed the tri-substitution method, which is a variant of the simplex method. Frieze and Yadegar introduced a method based on Lagrangian relaxation in which a feasible solution is recovered using information provided by the relaxed solution. Our choice of approaches is strongly influenced by the need to balance real-time performance and solution quality. Lagrangian relaxation based methods have been used successfully in prior tracking applications. An advantage of these methods is that they provide both an upper and lower bound on the optimal solution, which can then be used to measure the solution quality. These works extend the method of Frieze and Yadegar to the multidimensional case. [0489] The goal of this section is to explain the formulation of the data association problems that governs large classes of data association problems in centralized or hybrid centralized-sensor level multisensor/multitarget tracking. The presentation is brief; technical details are presented for both track initiation and maintenance in the work of Poore. The formulation is of sufficient generality to cover the MHT work of Reid, Blackman and Stein and modifications by Kurien to include maneuvering targets. As suggested by Blackman, this formulation can also be modified to include target features (e.g., size and type) into the scoring function. The recent work of Poore and Drummond significantly extends the work of this section to new approaches for multiple sensor centralized tracking. Future work will involve extensions to track-to-track correlation. [0490] The data association problems for multisensor and multitarget tracking considered in this work are generally posed as that of maximizing the posterior probability of the surveillance region (given the data) according to Maximize {p(θ=γ|Z [0491] where Z [0492] Γ [0493] Γδγ [0494] P(Γγ|Z [0495] Consider N data sets Z(k) (k=I, . . . , N) each of M [0496] and let Z [0497] respectively. In multisensor data fusion and multitarget tracking the data sets Z(k) may represent different classes of objects, and each data set can arise from different sensors. For track initiation the objects are measurements that must be partitioned into tracks and false alarms. In our formulation of track maintenance, which uses a moving window over time, one data set will be tracks and remaining data sets will be measurements which are assigned to existing tracks, as false measurements, or to initiating tracks. In sensor level tracking, the objects to be fused are tracks. In centralized fusion, the objects may all be measurements that represent targets or false reports, and the problem is to determine which measurements emanate from a common source. [0498] We specialize the problem to the case of set partitioning defined in the following way. First, for notational convenience in representing tracks, we add a zero index to each of the index sets in (2.2), a dummy report z [0499] Next under appropriate independence assumptions one can show
[0500] L [0501] Using (2.3) and the zero-one variable z [0502] γ Δ [0503] εγ .i f(i ,i [0504] φ
[0505] where c [0506] Expressions for the likelihood ratios L [0507] Overview of the Lagrangian Relaxation Algorithm. (ABP) Having discussed the N-dimensional assignment problem (1.1), we now turn to a description of the Lagrangian relaxation algorithm. The algorithm will proceed iteratively for a loop k=1, . . . , N−2. At the completion, there remains one two—dimensional assignment problem that provides the last step which yields an optimal (sometimes) or near-optimal solution to the original N-dimensional assignment problem. In step k of this loop (summarized in Section 4) one starts with the following (N−k+1)-dimensional assignment problem with one change in notation. If k=1, then the index notation l [0508] To ensure that a feasible solution of (3.1) always exists for a sparse problem, all variables with exactly one nonzero index (i.e., variables of the form z [0509] Subsection 3.1 presents some of the properties associated with the Lagrangian relaxation of (3.1) based on relaxing the last (N−k)-sets of constraints to a two-dimensional one. A new approach to the problem of recovering a high quality feasible solution of the original (N−k+1 )-dimensional problem given a feasible solution (optimal or suboptimal) of the relaxed two-dimensional problem is described hereinafter. A summary of the relaxation algorithm is given hereinafter, following which we establish the maximization of the Lagrangian dual (an important aspect of the relaxation procedure) to be an unconstrained nonsmooth optimization problem and then present a method for computing the subgradients. [0510] The Lagrangian Relaxed Assignment Problem. The (N−k+1)-dimensional problem (3.1) has (N−k+1) sets of constraints. A (M [0511] One of the major steps in the algorithm is the maximization of Φ [0512] For a function evaluation of Φ [0513] Evaluation of Φ [0514] Given an index pair (l [0515] As an aside, two observations are in order. The first is that the search procedure needed for the computation of the relaxed cost coefficients in (3.3) is the most computationally intensive part of the entire relaxation algorithm. The second is that a feasible solution z [0516] thus, there are generally solutions other than the one nonzero index solution. [0517] The following Theorem 3.1 gives a method for evaluating Φ [0518] Theorem 3.1. Let ω [0519] Then ω [0520] problem and Φ [0521] addition, ω [0522] ω [0523] Φ [0524] Proof. Let ω [0525] Φ [0526] objective function values of (3.2) and (3.4), respectively. Direct verification shows that ω [0527] Let X [0528] Note that X [0529] Φ [0530] X [0531] optimal solution of (3.2). Next, Φ [0532] With the exception of one equality being converted to an inequality, the following theorem is a converse of Theorem 5 3.1. [0533] Theorem 3.2. Let ω [0534] and define ω [0535] Then ω [0536] (3.4) Φ [0537] Proof: Let ω [0538] objective function values of (3.2) and (3.4), respectively. [0539] Direct verification shows that ω [0540] (3.4) and Φ [0541] remainder of the proof, assume that ω [0542] and construct ω [0543] by replacing ω [0544] Φ [0545] inequality is in fact an equality. This proves the theorem. [0546] The Nonsmooth Optimization Problem. Next, we address the nonsmooth properties of the function Φ [0547] Theorem 3.4 Let Φ Φ [0548] Most of the algorithms for nonsmooth optimization are based on generalized gradients, called subgradients, given by the following definition for a concave function. [0549] Definition 3.5. At u=(u δΦ [0550] where g [0551] There is a large literature on such problems, and we have tried a variety of methods including subgradient methods and bundle methods. Of these, we have determined that for a fixed number of nonsmooth iterations (e.g., twenty) , the bundle trust method Schramm and Zowe provides excellent quality solutions with the fewest number of function and subgradient evaluations, and is therefore our currently recommended method. [0552] An Algorithm for Computing Φ [0553] 1. Starting with problem (3.1), form the relaxed problem (3.2); [0554] 2. To solve (3.2) optimally, defined the two dimensional assignment problem (3.4) via the transformation (3.3); [0555] 3. Solve the two-dimensional problem (3.4) optimally; [0556] 4. Reconstruct the optimal solution, say ŵ [0557] [0558] 6. A subgradient is given by
[0559] Several remarks are in order. First, the optimal solution of the minimiation problem (3.2) is required before one can remove the minimum sign, replace z [0560] Finally, we have presented a method for computing one subgradient. If ŵ [0561] In most nonsmooth optimization algorithms, one uses an epsilon-subdifferential [0562] Definition 3.x. At u=(u δΦ [0563] where g [0564] HOW DO YOU COMPUTE g εδΦ [0565] The Recovery Procedure. The next objective is to explain a recovery procedure, i.e., given a feasible (optimal or suboptimal) solution ω [0566] If ω [0567] Let {(l [0568] equation (5)) such that ω [0569] where l [0570] for m=2, . . .k+1 and where o denotes function composition. For example l [0571] Then the (N−k)-dimensional assignment problem that restores feasibility is
[0572] Let Y be an optimal or feasible solution to this N—k dimensional assignment problem. The recovered feasible solution z [0573] Said in a different way, the recovered reasible solution z [0574] where l [0575] The next objective is to remove the asumption that all cost coefficients are defined and all zero-one variables are free to be assigned. We first note that the above construction of a reduced dimension assignment problem (3.14) is valid as long as all cost coefficients c [0576] The last step k=N−2. The description of the algorithm ends with k=N+2. The resulting recovery problem defined in (3.14) with k=N−2 is
[0577] Let Y be an optimal or feasible solution to this 2-dimensional assignment problem. The recovered feasible solution z [0578] Said in a different way, the recovered feasible solution z [0579] where l [0580] be an enumeration of indices {l [0581] The Upper and Lower Bound. The upper bound on the feasible solution is given by v [0582] and the lower by Φ Φ [0583] where (u [0584] Reuse of Multipliers. Since the most computationally expensive part of the algorithm occurs in the maximization of Φ Φ [0585] where after the first step in the maximization of Φ [0586] Inequalities depend on solution of 2d assignment problem. Proof: Suppose we have a value of the multipliers (u Φ Subject to Σ Σ [0587] where (3.xx)
[0588] These need not be the maximizer; however, we do assume that we have solved the above minimization problem optimally to evaluate Φ [0589] be an enumeration of indices {l [0590] Then, the final value of the objective function can be expressed as Φ Minimize Φ Subject to Σ [0591] where
[0592] If now another constrain set, say the (k+2) [0593] Since the constraint Σ [0594] where the fact that {overscore (Φ)} Φ [0595] where Φ [0596] To explain how to improve this inequality, let (u [0597] Summary of the Lagrangian Relaxation Problem. (APB) Given the multidimensional assignment problem
[0598] where c [0599] Having explained many of the relaxation features, it is now appropriate to present the Lagrangian relaxation algorithm, which iteratively constructs a feasible solution to the N-dimensional assignment problem (4.1). [0600] Algorithm 4.1 (Lagrangian Relaxation Algorithm). To construct a high quality feasible solution, enoted by {circumflex over (z)} [0601] 0. Initialize the multipliers (u [0602] For k−1, . . . , N−2, do [0603] 1. For the Lagrangian relaxed problem (3.2) from the problem (3.1) by relaxing the last (N−k−1) sets of constraints. [0604] 2. Use a nonsmooth optimization technique to solve Maximize {Φ [0605] with u [0606] where ΦN−k+ [0607] 3. Given an approximate or optimal maximizer of (4.2), say ű [0608] assignment problem (3.4) corresponding to this maximizer of Φ [0609] 4. Formulate the recovery (N-k)-dimensional problem (3.13), modified as discussed at the end of subsection (3.3) for sparse problems. At this stage, {circumflex over (z)} [0610] Formulate the final two-dimensional problem (3.17) and complete the final recovered solution {circumflex over (z)} [0611] To explain the lower and upper bounds, let Φ [0612] (2.5). Then, Φ [0613] is the desired inequality. [0614] COMMENTS: [0615] 1. Step [0616] 2. In track maintenance, the warm starts for the initial multipliers for the first step are available. For the relaxation procedure, initial multipliers are available in step [0617] 3. There are many variations on the above algorithm. For example, one can compute a good solution on the first pass (k=1) and not perform the optimization in (2) thereafter. This yields a great solution. Thus one can continue the optimization at the first pass, and immediately compute quality feasible solutions to the problem. [0618] Lagrangian Relaxation Algorithm for the 3-Dimensional Algorithm. (ABP) In this section, we illustrate the relaxation algorithm for the three dimensional assignment problem. Having discussed the general relaxation scheme,
[0619] To ensure that a feasible solution of (5.1) always exists for a sparse problem, all variables with exactly one nonzero index (i.e., variables of the form z [0620] The Lagrangian Relaxed Assignment Problem. The three dimensional assignment problem (5.1) has three sets of constraints and one can describe the relaxation by relaxing any of the three sets of constraints, the description here is based on relaxing the last set of constraints. A (M [0621] One of the major steps in the algorithm is the maximization of Φ [0622] u [0623] piecewise affine function of the multiplier vector u [0624] Since many of these algorithms require a function value and a subgradient of Φ [0625] address this problem in the next subsection. We note, however, that there are other ways to maximize Φ [0626] subsection addresses but one such method. [0627] For a function evaluation of Φ [0628] suboptimal) solution of this relaxed problem (5.2) can be constructed from that of a two-dimensional assignment problem. Then, the nonsmooth characteristics of Φ [0629] followed by a method for computing a subgradient. [0630] Evaluation of Φ [0631] j [0632] Given an index pair (i [0633] Now, define
[0634] As an aside, two observations are in order. The first is that the search procedure needed for the computation of the relaxed cost coefficients in (5.3) is the most computationally intensive part of the entire relaxation algorithm. The second is that a feasible solution z [0635] Thus the two-dimensional assignment problem (5.4) has feasible solutions other than those with exactly one nonzero index if the original problem (5.1) does. [0636] The following Theorem 5.1 states that an optimal solution of (5.2) can be computed from that of (5.4). Furthermore, if the solution of either of these two problems is ε εthen so is the other. The converse is contained in Theorem 5.2. [0637] Theorem 5.1. Let ω [0638] dimensional assignment problem (5.4) and define w w w w [0639] Then w [0640] optimal for the two dimensional problem, then w [0641] With the exception of one equality being converted to an inequality, the following theorem is a converse of Theorem 5.1. [0642] Theorem 5.2. Let w [0643] Then w _{3 }and a Subgradient [0644] Given u [0645] 1. Starting with problem (5.1), form the relaxed problem (5.2) [0646] 2. To solve (5.2) optimally, define the two dimensional assignment problem (5.4) via the transformation (5.3) [0647] 3. Solve the two-dimensional problem (5.4) optimally. [0648] 4. Reconstruct the optimal solution, say ŵ [0649] 5. Then
[0650] 6. A subgradient is given by substituting ŵ [0651] The Recovery Procedure. The next objective is to explain a recovery procedure, i.e., given a feasible (optimal or suboptimal) solution w [0652] Let
[0653] be an enumeration of indices {i [0654] Next to define the two-dimensional assignment problem that restores feasibility, let c [0655] Then the two-dimensional assignment problem that restores feasibility is
[0656] The next objective is to remove the assumption that all cost coefficients are defined and all zero-one variables are free to be assigned. We first note that the above construction of a reduced dimension assignment problem (5.13) is valid as long as all cost coefficients c [0657] The final recovery problem. The recovery problem for the case N=3 is
[0658] Let Y be an optimal or feasible solution to this 2-dimensional assignment problem. The recovered feasible solution z [0659] Said in another way, let {(l [0660] The upper bound on the feasible solution is given by
[0661] and the lower by Φ [0662] In particular, we have Φ [0663] where u [0664] Φ [0665] assignment problem and {overscore (z)} [0666] Other Relaxations for the Multidimensional Assignment Problem.(ABP) In this section, we briefly describe other possible relaxations and their implications. These include linear programming relaxations and the corresponding duals. [0667] Recall that one starts with the definition of the zero-one variable z [0668] @ [0669] where c [0670] Again, the recent work of Poore and Drummond significantly extends the formulation of the track maintenance and initiation to new approaches. The discussions of this section apply equally to those formulations. [0671] The Linear Programming Relaxation. In the linear programming relaxation, one replaces the zero-one variables constraints z [0672] with the constraint 0≦z [0673] Then, the problem (6.1) can be formulated as a linear programming problem with the constraint (6.2) in (6.1) replaced by (6.3) with a special block structure to which the Dantzing-Wolfe decomposition is applicable. Of course, after solving this problem, one must now recover the zero-one character of the variables in (6.1) and there are many ways to do this, such as using the two dimensional assignment problems. Commercial software is also available. [0674] The Linear Programming Dual and Partial Lagrangian Relaxations. Given the linear programming relaxation, one can formulate the dual problem or the partial Lagrangian relaxation duals with respect to any number of constraints. In particular, this is precisely what is done in Section 3 on the Lagrangian relaxation algorithm presented. The much broader class of algorithms provided in the U.S. Pat. No. 5,537,119 (Aubrey B. Poore, Jr., Method and System for Tracking Multiple Regional Objects by MultiDimensional Relaxation, U.S. Pat. No. 5,537,119, filed Mar. 14, 1995, issue date of Jul. 16, 1996 ) can be modified to remove the zero-one character when one relaxes M sets of constraints to an N−M dimensional problem and recovers with an N−M+1 dimensional problem. This avoids the problems associated with the NP-hard N−M and N−M+1 dimensional problems. However, to restore the zero-one character, one can do it sequentially with an assignment problem or with one of the many zero-one rounding techniques. These formulations are easy to work out and thus the details are omitted. [0675] The complete dual problem is another way of solving the LP problem and may indeed be more efficient in certain applications. In addition, the solution of this dual problem may provide excellent initial approximations to the multipliers for Lagrangian relaxations. [0676] Multisensor Resolutions Problems and Their Solution via Linear Nonlinear Assignment Problems and Inequality Constraints. (ABP) The mathematical development for inequality constraints is understood by Aubrey B. Poore, but this work has not been written up. This feature is important in combining information from sensors with different resolutions such an IR and Radar. [0677] Formulation and Algorithms for the Distributed Sensor Tracking: Track-to-Track Correlations. (ABP) [0678] Hot Starts for Track Maintenance and Initiation: Bundle Modifications (ABP). [0679] Thus reuse of multipliers and the first proof that this reuse is actually valid was presented in this section. The reuse in track maintenance is demonstrated and discussed in the work of Poore and Drummond [xx]. The only item left is the modification of the bundle of subgradients for the use with the multiplier values as one goes through the recovery problem as in Section 3.6 or as one moves the window in track maintenance. It is this aspect of the nonsmooth optimization that adds an order of magnitude to the speed of the algorithms. This work is based on both a mathematical proof as in Section 3.6 as well as computational experience and heuristics. [0680] Adaptive Window Size Selection (ABP). [0681] These data association algorithms, based on the multidimensional assignment problem, range from sequential processing to many frames of data processed all at once!. The data association problem for multisensor multitarget tracking is formulated using a window sliding over the frames of data from the sensors. This discussion focuses on the work of Poore and Drummond and not on the formulations in Section 2. Firm data association decisions for existing track are made at, say frame k, with the most recent frame being k+M. Decisions after frame k are soft decisions. Reports not in the confirmed tracks are used to initiate tracks over frames numbered k−I to k+M. [0682] The length of these windows varies from sequential processing, which corresponds precisely to I=0 and M=1, to user defined large values of I and M. (In the case of sequential processing, we also have a temporary track file of dynamically feasible tracks, but incorrect data association.) There is a marked change in performance over this range. As the two windows become exceedingly long, there is little statistically significant information gained and indeed performance can degenerate slightly. Thus, one must manually find the correct window lengths for performance in a given scenario and the algorithms do not change for a changing environment. Thus we propose an adaptive method for adjusting the window lengths. (The method has been highly successful for selecting the correct window length for multistep methods in ordinary differential equations.) [0683] 1. Compute the solution for different window lengths that overlap and differ by one or two frames. [0684] 2. Compare the solution quality, i.e., the value of the objective function, for two adjacent window lengths. [0685] 3. If there is a predefined improvement in either direction, we then, for stability, repeat the exercise for a shorter or longer on the first try. If there is consistent information, we adjust the window size in the indicated direction. This can be given a well defined mathematical formula in terms of the assignment problems of different dimensions. [0686] Algorithm Enhancements due to Data Structures (ABP). [0687] Construction and enumeration of the Best K-Solutions. [0688] New Nonsmooth Optimization Techniques. [0689] Sensitivity Analysis. [0690] For sequential processing in which the two dimensional assignment algorithm is used, one can use the LP sensitivity analysis theory and easily obtain the corresponding answers. For the multiframe processing, the optimal solution is not available; however, there are still two approaches one can use. First, the basic algorithm can perform the same sensitivity analysis at each stage (loop) of the algorithm as is done in the two dimensional assignment problem since the evaluation of function Φ [0691] New Auction Algorithms (ABP & PS). In this section we present a new auction algorithm for the two dimensional assignment problem. [0692] An important step in solving N-dimensional assignment problems for N≧3, is finding the optimal solution of the 2-dimensional assignment problem. In particular, we wish to solve the 2-dimensional problem which includes the zero-index. T3,pically this problem can be thought of as trying to find either a minimum cost or maximum utility in assigning person to objects, tenants to apartments, or teachers to classrooms. We will follow the work of Bertsekas and call the first index set persons and the second index set objects. The statement of this problem is given below (1) when the number of persons is m and the number of objects is n.
[0693] There are a couple of assumptions which we will make about (1). First of all, we assume that c [0694] Notice that there are no constraints on the number of times person 0 and object 0 can be assigned. But notice that the first constraint requires that each non-zero person i must be assigned exactly once. Similarly, the second constraint forces each non-zero object j to be assigned exactly one time. Finally, the last constraint gives an integer solution, although we will see shortly that this constraint can be relaxed to admit any solution x [0695] Relaxation of One Constraint. [0696] [0697] Relaxing the last constraint, we obtain the following problem:
[0698] This lower bound is achieved and the second constraint in the original problem is satisfied if the following conditions are met:
[0699] All of j's are assigned only one time. [0700] The relaxation of the first constraint is analogous and would lead to similar results with i and j exchanged and the introduction of the multiplier u [0701] Relaxation of Both Constraints. [0702] This time we will relax both constraints and using duality theory obtain a relationship between the multipliers u [0703] a bunch of equations, theorems and the such here. [0704] [0705] From the above relaxation, we arrive at the following complementary slackness conditions which have been relaxed by a small value ε. [0706] Definition: An assignment S and a multiplier set (u [0707] c [0708] c [0709] Forward Auction Algorithm. [0710] (1) Select any unassigned person i [0711] (2) Determine the following quantities: [0712] j [0713] v [0714] w [0715] In the selection of j [0716] (3) Update the multipliers and the assignment: [0717] If j [0718] (a) Add (i,0) to the assignment. [0719] (b) Update u [0720] If j [0721] (a) Add (i,j [0722] (b) Remove (i′,j [0723] (c) Update u [0724] (d) Update u [0725] Reverse Auction Algorithm. [0726] (1) Select any unassigned object j, such that c [0727] (2) Determine the following quantities: [0728] i [0729] β [0730] γ [0731] In the selection of i [0732] (3) Update the multipliers and the assignment: If i [0733] (a) Add (0,j) to the assignment. [0734] (b) Update u [0735] If i [0736] (a) Add (i [0737] (b) Remove (i [0738] (c) Update u [0739] (d) Update u [0740] Combined Forward/Reverse Auction Algorithm [0741] 1. Assume that u [0742] 2. Adjust the value of u If [0743] 3. Run iterations of the Forward Auction Algorithm until all persons become assigned. [0744] 4. Run iterations of the Reverse Auction Algorithm until all of the objects become assigned. [0745] Note at the completion of the Forward auction step we have the following conditions satisfied: [0746] c [0747] c [0748] c [0749] Thus we can prove the following proposition. Proposition: If we assume that c [0750] Optimality of the Algorithm [0751] Theorem: ε-CS preserved during every forward and reverse iteration. [0752] Theorem: If a feasible solution exists, then the resulting solution is with mε of being optimal for the Combined Forward Reverse Algorithm. [0753] Implementation Specifics Parallelization. [0754] Here are but a few comments. [0755] Although the algorithm appears to be serial in nature, its primary computational requirements are almost entirely parallelizable. Thus parallelization is planned. [0756] Step 2 is the computational part of the algorithm. Evaluating Φ [0757] If a sensitivity analysis is desired or if one is interested in computing several near-optimal solutions, a parallel processor with a few powerful processors and good communication such as on the Intel Paragon would be most beneficial. [0758] The foregoing discussion of the invention has been presented for purposes of illustration and description. Further, the description is not intended to limit the invention to the form disclosed herein. Consequently, variation and modification commensurate with the above teachings, within the skill and knowledge of the relevant art, are within the scope of the present invention. The embodiment described hereinabove is further intended to explain the best mode presently known of practicing the invention and to enable others skilled in the art to utilize the invention as such, or in other embodiments, and with the various modifications required by their particular application or use of the invention. It is intended that the appended claims be construed to include alternative embodiments of the invention to the extent permitted by the prior art. Referenced by
Classifications
Legal Events
Rotate |