📄 bipartitematchingdemo.m~
字号:
% Consider matching sources to detections
% s1 d2
% s2 d3
% d1
%a = optimalMatching([52;0.01])
% sources(:,i) = [x y] coords
sources = [0.1 0.7; 0.6 0.4]';
detections = [0.2 0.2; 0.2 0.8; 0.7 0.1]';
dst = sqdist(sources, detections);
% a = [2 3] which means s1-d2, s2-d3
a = optimalMatchingHungarian(dst)
a2 = optimalMatchingIntProg(dst)
assert(isequal(a(:),a2(:)))
figure(1); clf
optimalMatchingDemoPlot(sources, detections, a)
%%%% Flip roles of sources and detections
dst = dst';
% a = [0 1 2] which means d1-0, d2-s1, d3-s2
a = optimalMatchingHungarian(dst)
a2 = optimalMatchingIntProg(dst)
assert(isequal(a(:),a2(:)))
figure(2); clf
optimalMatchingDemoPlot(detections, sources, a)
%%%%%%%%%% Move s1 nearer to d1
% d2
% s2 d3
% s1 d1
sources = [0.1 0.3; 0.6 0.4]';
detections = [0.2 0.2; 0.2 0.8; 0.7 0.1]';
dst = sqdist(sources, detections);
% a = [2 3] which means s1-d2, s2-d3
a = optimalMatchingHungarian(dst)
[a2, ass] = optimalMatchingIntProg(dst)
assert(isequal(a(:),a2(:)))
figure(3); clf
optimalMatchingDemoPlot(sources, detections, a)
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -