Rev | Line | |
---|
[37] | 1 | function [err,afferr,stable] = transcompare(M1,M2,INC,r,ERR,pts,n,iter) |
---|
| 2 | % run my algorithm (with an without iterative refinement) on two different |
---|
| 3 | % matrices. M1 has no translation. M2 has translation added, then approximately |
---|
| 4 | % removed using the noisy, partial matrix. So M1 is ground truth for both of them. |
---|
| 5 | [e1,a1,s1] = rankr_aff_err(M1,INC,r,ERR,pts,n,iter); |
---|
| 6 | [e2,a2,s2] = rankrsfm_aff_err(M2,INC,ERR,pts); |
---|
| 7 | err = [e1, e2]; |
---|
| 8 | afferr = [a1,a2]; |
---|
| 9 | stable = [s1,s2]; |
---|
Note: See
TracBrowser
for help on using the repository browser.