On the Solvability of Viewing Graphs

08/08/2018
by   Matthew Trager, et al.
0

A set of fundamental matrices relating pairs of cameras in some configuration can be represented as edges of a "viewing graph". Whether or not these fundamental matrices are generically sufficient to recover the global camera configuration depends on the structure of this graph. We study characterizations of "solvable" viewing graphs and present several new results that can be applied to determine which pairs of views may be used to recover all camera parameters. We also discuss strategies for verifying the solvability of a graph computationally.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2018

GPSfM: Global Projective SFM Using Algebraic Constraints on Multi-View Fundamental Matrices

This paper addresses the problem of recovering projective camera matrice...
research
11/30/2019

Averaging Essential and Fundamental Matrices in Collinear Camera Settings

Global methods to Structure from Motion have gained popularity in recent...
research
10/31/2018

Matching Graphs with Community Structure: A Concentration of Measure Approach

In this paper, matching pairs of random graphs under the community struc...
research
04/04/2019

Algebraic Characterization of Essential Matrices and Their Averaging in Multiview Settings

Essential matrix averaging, i.e., the task of recovering camera location...
research
02/10/2017

A New Rank Constraint on Multi-view Fundamental Matrices, and its Application to Camera Location Recovery

Accurate estimation of camera matrices is an important step in structure...
research
11/28/2022

Toward Global Sensing Quality Maximization: A Configuration Optimization Scheme for Camera Networks

The performance of a camera network monitoring a set of targets depends ...
research
11/28/2022

Properties of SN P system and its Configuration Graph

Several studies have been reported in the literature about SN P system a...

Please sign up or login with your details

Forgot password? Click here to reset