Differential pose optimization in descriptor space -- Combining Geometric and Photometric Methods for Motion Estimation

• URL: http://arxiv.org/abs/2602.14297v1
• Date: Sun, 15 Feb 2026 20:13:29 GMT
• Title: Differential pose optimization in descriptor space -- Combining Geometric and Photometric Methods for Motion Estimation
• Authors: Andreas L. Teigen, Annette Stahl, Rudolf Mester,
• Abstract summary: Two-frame relative pose optimization is a fundamental problem in computer vision.<n>Two different kinds of error values are used: photometric error and re-projection error.<n>We investigate a third method that combines the strengths of both paradigms into a unified approach.
• Score: 1.2977565963783035
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: One of the fundamental problems in computer vision is the two-frame relative pose optimization problem. Primarily, two different kinds of error values are used: photometric error and re-projection error. The selection of error value is usually directly dependent on the selection of feature paradigm, photometric features, or geometric features. It is a trade-off between accuracy, robustness, and the possibility of loop closing. We investigate a third method that combines the strengths of both paradigms into a unified approach. Using densely sampled geometric feature descriptors, we replace the photometric error with a descriptor residual from a dense set of descriptors, thereby enabling the employment of sub-pixel accuracy in differential photometric methods, along with the expressiveness of the geometric feature descriptor. Experiments show that although the proposed strategy is an interesting approach that results in accurate tracking, it ultimately does not outperform pose optimization strategies based on re-projection error despite utilizing more information. We proceed to analyze the underlying reason for this discrepancy and present the hypothesis that the descriptor similarity metric is too slowly varying and does not necessarily correspond strictly to keypoint placement accuracy.

Related papers

• Camera Pose Revisited [0.0]
  This paper addresses the Perspective-$n$n$n$ problem with special emphasis on the initial estimation of the pose of a calibration object.<n>As a solution, we propose the texttt Cay-ProCay78 algorithm, which combines the classical quadratic formulation of the reconstruction error vectors.
  arXiv  Detail & Related papers  (2026-01-18T20:10:34Z)
• Beyond Coordinates: Meta-Equivariance in Statistical Inference [0.0]
  Optimal statistical decisions should transcend the language used to describe them.<n>How do we guarantee that the choice of coordinates does not subtly dictate the solution?<n>We first analyse the optimal combination of twoally normal estimators under a strictly convex trace-AMSE risk.
  arXiv  Detail & Related papers  (2025-04-14T19:40:39Z)
• Locally Orderless Images for Optimization in Differentiable Rendering [80.09571356394574]
  We introduce a method that uses locally orderless images, where each pixel maps to a histogram of intensities that preserves local variations in appearance.<n>We validate our method on various inverse problems using both synthetic and real data.
  arXiv  Detail & Related papers  (2025-03-27T19:17:58Z)
• SPARE: Symmetrized Point-to-Plane Distance for Robust Non-Rigid 3D Registration [77.13381026159111]
  We propose SPARE, a novel formulation that utilizes a symmetrized point-to-plane distance for robust non-rigid registration.<n>The proposed method greatly improves the accuracy of non-rigid registration problems and maintains relatively high solution efficiency.
  arXiv  Detail & Related papers  (2024-05-30T15:55:04Z)
• Single-image camera calibration with model-free distortion correction [0.0]
  This paper proposes a method for estimating the complete set of calibration parameters from a single image of a planar speckle pattern covering the entire sensor. The correspondence between image points and physical points on the calibration target is obtained using Digital Image Correlation. At the end of the procedure, a dense and uniform model-free distortion map is obtained over the entire image.
  arXiv  Detail & Related papers  (2024-03-02T16:51:35Z)
• Perspective-1-Ellipsoid: Formulation, Analysis and Solutions of the Camera Pose Estimation Problem from One Ellipse-Ellipsoid Correspondence [1.7188280334580193]
  We introduce an ellipsoid-specific theoretical framework and demonstrate its beneficial properties in the context of pose estimation. We show that the proposed formalism enables to reduce the pose estimation problem to a position or orientation-only estimation problem.
  arXiv  Detail & Related papers  (2022-08-26T09:15:20Z)
• Degradation-agnostic Correspondence from Resolution-asymmetric Stereo [96.03964515969652]
  We study the problem of stereo matching from a pair of images with different resolutions, e.g., those acquired with a tele-wide camera system. We propose to impose the consistency between two views in a feature space instead of the image space, named feature-metric consistency. We find that, although a stereo matching network trained with the photometric loss is not optimal, its feature extractor can produce degradation-agnostic and matching-specific features.
  arXiv  Detail & Related papers  (2022-04-04T12:24:34Z)
• Differentiable Rendering with Perturbed Optimizers [85.66675707599782]
  Reasoning about 3D scenes from their 2D image projections is one of the core problems in computer vision. Our work highlights the link between some well-known differentiable formulations and randomly smoothed renderings. We apply our method to 3D scene reconstruction and demonstrate its advantages on the tasks of 6D pose estimation and 3D mesh reconstruction.
  arXiv  Detail & Related papers  (2021-10-18T08:56:23Z)
• Image Matching with Scale Adjustment [57.18604132027697]
  We show how to represent and extract interest points at variable scales. We devise a method allowing the comparison of two images at two different resolutions.
  arXiv  Detail & Related papers  (2020-12-10T11:03:25Z)
• Robust, Accurate Stochastic Optimization for Variational Inference [68.83746081733464]
  We show that common optimization methods lead to poor variational approximations if the problem is moderately large. Motivated by these findings, we develop a more robust and accurate optimization framework by viewing the underlying algorithm as producing a Markov chain.
  arXiv  Detail & Related papers  (2020-09-01T19:12:11Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.