Implementation of the Hungarian Algorithm to solve Linear Assignment problems. More...

#include <HungarianAlgorithm.h>

Static Public Member Functions
static std::vector< int >	apply (const utils::Array2D< real > &m, bool isCostMatrix=true)
	calculate best assignment given cost matrix m More...

static void	visualizeAssignment (const utils::Array2D< real > &cost, const std::vector< int > &assignment)
	visualized the assignment with given cost matrix and assignment vector More...

Private Types
typedef utils::Array2D< real >	mat
	Internal used cost matrix type. More...

Detailed Description

template<class real>
class icl::cv::HungarianAlgorithm< real >

Implementation of the Hungarian Algorithm to solve Linear Assignment problems.

See also: PositionTracker

Assignment Problems (LAP)

A LAP is defined as follows: You have $N$ workers $w_i$ and $N$ tasks $t_j$ . Assigning a certain worker $w_i$ to a certain task $t_j$ produces costs $d_{ij}$ which are defined by a square cost matrix $D=\{d_{ij}\}$ . Each worker can only be assigned to perform a single task, and each task has to be processed. The problem is to find the optimal assignment to minimize the arising costs.