Matches between images are represented by partial permutations, which constitute the so-called Symmetric Inverse Semigroup. Synchronization of these matches is tantamount to joining them in multi-view correspondences while enforcing loop-closure constraints. This paper proposes a novel solution for partial permutation synchronization based on a spectral decomposition. Experiments on both synthetic and real data shows that our technique returns accurate results in the presence of erroneous and missing matches, whereas a previous solution [12] gives accurate results only for total permutations.
Synchronization in the Symmetric Inverse Semigroup
Arrigoni, Federica;
2017-01-01
Abstract
Matches between images are represented by partial permutations, which constitute the so-called Symmetric Inverse Semigroup. Synchronization of these matches is tantamount to joining them in multi-view correspondences while enforcing loop-closure constraints. This paper proposes a novel solution for partial permutation synchronization based on a spectral decomposition. Experiments on both synthetic and real data shows that our technique returns accurate results in the presence of erroneous and missing matches, whereas a previous solution [12] gives accurate results only for total permutations.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
ICIAP17.pdf
Accesso riservato
Dimensione
1.68 MB
Formato
Adobe PDF
|
1.68 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.