At this part of process famous problem arises - assignment problem (blobs to tracks). First we build a bipartite graph: we have a source S, a sink T, in the first part we place N vertices (corresponding to blobs), in the second – M vertices (corresponding to tracks). Each blob has an edge to each track and vice versa. The weight of the edge is a distance between centroids of blob and track. Schematically it looks like shown in the Figure 5.
Saved! Screenshot description was successfully saved.
