Question about "common corners" in Section 7

[jon-barker]

Hi,

Thanks for the well written and interesting paper.

In the Section 7 you mention that "common corners could be efficiently solved ... by detecting the number of vertices located in the same position and sampling the visual descriptor multiple times ..."

My question is: how would ground-truth permutation matrix construction happen in this case? It seems that for each common corner with n sampled points there'd be n! valid ground-truth permutation matrices.

Thanks!