paper-with-me

홈 › Papers

Solving Viewing Graph Optimization for Simultaneous Position and Rotation Registration

2021-08-29 · Seyed-Mahdi Nasiri, Reshad Hosseini, Hadi Moradi

A viewing graph is a set of unknown camera poses, as the vertices, and the observed relative motions, as the edges. Solving the viewing graph is an essential step in a Structure-from-Motion procedure, where a set of relative motions is obtained from a collection of 2D images. Almost all methods in the literature solve for the rotations separately, through rotation averaging process, and use them for solving the positions. Obtaining positions is the challenging part because the translation observations only tell the direction of the motions. It becomes more challenging when the set of edges comprises pairwise translation observations between either near and far cameras. In this paper an iterative method is proposed that overcomes these issues. Also a method is proposed which obtains the rotations and positions simultaneously. Experimental results show the-state-of-the-art performance of the proposed methods.

📄 PDF Abstract BibTeX arXiv:2108.12876

Code (0)

등록된 구현이 없습니다.

Tasks

PositionTranslation

Similar Papers 제목 키워드 기반

Optimizing the Viewing Graph for Structure-From-Motion

2015-12-01 · ICCV 2015 12 · Chris Sweeney, Torsten Sattler, Tobias Hollerer, Matthew Turk 외

The viewing graph represents a set of views that are related by pairwise relative geometries. In the context of Structure-from-Motion (SfM), the viewing graph is the input to the incremental or global estimation pipeline…

Viewing Graph Solvability via Cycle Consistency

2021-01-01 · ICCV 2021 10 · Federica Arrigoni, Andrea Fusiello, Elisa Ricci, Tomas Pajdla

In structure-from-motion the viewing graph is a graph where vertices correspond to cameras and edges represent fundamental matrices. We provide a new formulation and an algorithm for establishing whether a viewing gr…

Simultaneous shot inversion for nonuniform geometries using fast data interpolation

2018-04-23 · Michelle Liu, Rajiv Kumar, Eldad Haber, Aleksandr Aravkin

Stochastic optimization is key to efficient inversion in PDE-constrained optimization. Using 'simultaneous shots', or random superposition of source terms, works very well in simple acquisition geometries where all sourc…

Stochastic Optimization

Orthogonal Matrix Retrieval in Cryo-Electron Microscopy

2014-12-01 · Tejal Bhamre, Teng Zhang, Amit Singer

In single particle reconstruction (SPR) from cryo-electron microscopy (cryo-EM), the 3D structure of a molecule needs to be determined from its 2D projection images taken at unknown viewing directions. Zvi Kam showed alr…

Retrieval

A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks

2024-06-19 · Yaochu Jin, Xueming Yan, Shiqing Liu, Xiangyu Wang

Graph neural networks (GNNs) have emerged as a powerful tool for solving combinatorial optimization problems (COPs), exhibiting state-of-the-art performance in both graph-structured and non-graph-structured domains. Howe…

Combinatorial Optimization