Clearing Multiview Structure Graph from Inconsistencies

Abstract

Dealing with repetitive patterns in images proves to be difficult in Multiview structure from motion. Previous work in the field suggests that this problem can be solved by clearing inconsistent rotations in the visual graph that represents pairwise relations between images. So we present a simple and rather effective algorithm, to clear the graph based on cycles. While trying to generate all cycles within the graph is computationally impossible in most cases, we choose to verify only the cycles that we need, and without relying on the spanning tree method because it puts a big emphasis on certain edges.