Kissing to Find a Match: Efficient Low-Rank Permutation Representation