hi Jean,
Very nice algorithm. However, I have a question I hope you can help me with. Because there is no munkres.m file,I download munkres.m from this link munkres-assignment-algorithm .
when I run TestSimpleTracker.m, there is some error message as follows:
Index in position 1 exceeds array bounds (must not exceed 8).
error in hungarianlinker (line 116)
target_distances(i) = sqrt ( D ( i , target_indices(i)) );
then I step into hungarianlinker.m, from this code: [ target_indices total_cost ] = munkres(D);, I get the result "target_indices" which is a matrix. But I didn't understand the code below.

why do you use target_indices(i) rather than target_indices(i,j)?
Is there something wrong with the munkres.m? can you please offer munkres.m for me?
Look forward to your reply!
Regards,
You Bo
hi Jean,
Very nice algorithm. However, I have a question I hope you can help me with. Because there is no munkres.m file,I download munkres.m from this link munkres-assignment-algorithm .
when I run TestSimpleTracker.m, there is some error message as follows:
then I step into hungarianlinker.m, from this code: [ target_indices total_cost ] = munkres(D);, I get the result "target_indices" which is a matrix. But I didn't understand the code below.
why do you use target_indices(i) rather than target_indices(i,j)?
Is there something wrong with the munkres.m? can you please offer munkres.m for me?
Look forward to your reply!
Regards,
You Bo