Method for determining a ranked set of associations
US5734592A · kind A · utility
19Cited by
6References
12Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Jul 13, 1995 |
| Grant date | Mar 31, 1998 |
| Priority date | — |
| Expiry date | Jul 13, 2015 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/04
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A computer-implemented process for determining a ranked set of solutions to a bipartite graph matching problem, such is involved in multi-target tracking, maximum flow matching, or data association in matching elements of a first set to elements of a second set to minimize the cost of the association. A feature of the process is a partitioning into subproblems such that the most probable solutions are in the smaller subproblems and the computation begins by solving the smallest subproblem in the search for the best solution.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.