Towards a Unified Approach to Homography Estimation Using Image Features
and Pixel Intensities
- URL: http://arxiv.org/abs/2202.09716v1
- Date: Sun, 20 Feb 2022 02:47:05 GMT
- Title: Towards a Unified Approach to Homography Estimation Using Image Features
and Pixel Intensities
- Authors: Lucas Nogueira, Ely C. de Paiva, Geraldo Silvera
- Abstract summary: The homography matrix is a key component in various vision-based robotic tasks.
Traditionally, homography estimation algorithms are classified into feature- or intensity-based.
This paper proposes a new hybrid method that unifies both classes into a single nonlinear optimization procedure.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The homography matrix is a key component in various vision-based robotic
tasks. Traditionally, homography estimation algorithms are classified into
feature- or intensity-based. The main advantages of the latter are their
versatility, accuracy, and robustness to arbitrary illumination changes. On the
other hand, they have a smaller domain of convergence than the feature-based
solutions. Their combination is hence promising, but existing techniques only
apply them sequentially. This paper proposes a new hybrid method that unifies
both classes into a single nonlinear optimization procedure, applies the same
minimization method, and uses the same homography parametrization and warping
function. Experimental validation using a classical testing framework shows
that the proposed unified approach has improved convergence properties compared
to each individual class. These are also demonstrated in a visual tracking
application. As a final contribution, our ready-to-use implementation of the
algorithm is made publicly available to the research community.
Related papers
- Advancements in Feature Extraction Recognition of Medical Imaging Systems Through Deep Learning Technique [0.36651088217486427]
An objective function based on weight is proposed to achieve the purpose of fast image recognition.
A technique for threshold optimization utilizing a simplex algorithm is presented.
It is found that different types of objects are independent of each other and compact in image processing.
arXiv Detail & Related papers (2024-05-23T04:46:51Z) - Adaptive Image Registration: A Hybrid Approach Integrating Deep Learning
and Optimization Functions for Enhanced Precision [13.242184146186974]
We propose a single framework for image registration based on deep neural networks and optimization.
We show improvements of up to 1.6% in test data, while maintaining the same inference time, and a substantial 1.0% points performance gain in deformation field smoothness.
arXiv Detail & Related papers (2023-11-27T02:48:06Z) - Linearization Algorithms for Fully Composite Optimization [61.20539085730636]
This paper studies first-order algorithms for solving fully composite optimization problems convex compact sets.
We leverage the structure of the objective by handling differentiable and non-differentiable separately, linearizing only the smooth parts.
arXiv Detail & Related papers (2023-02-24T18:41:48Z) - Stabilizing Q-learning with Linear Architectures for Provably Efficient
Learning [53.17258888552998]
This work proposes an exploration variant of the basic $Q$-learning protocol with linear function approximation.
We show that the performance of the algorithm degrades very gracefully under a novel and more permissive notion of approximation error.
arXiv Detail & Related papers (2022-06-01T23:26:51Z) - Revisiting Consistency Regularization for Semi-Supervised Learning [80.28461584135967]
We propose an improved consistency regularization framework by a simple yet effective technique, FeatDistLoss.
Experimental results show that our model defines a new state of the art for various datasets and settings.
arXiv Detail & Related papers (2021-12-10T20:46:13Z) - Revisiting The Evaluation of Class Activation Mapping for
Explainability: A Novel Metric and Experimental Analysis [54.94682858474711]
Class Activation Mapping (CAM) approaches provide an effective visualization by taking weighted averages of the activation maps.
We propose a novel set of metrics to quantify explanation maps, which show better effectiveness and simplify comparisons between approaches.
arXiv Detail & Related papers (2021-04-20T21:34:24Z) - Meta-Regularization: An Approach to Adaptive Choice of the Learning Rate
in Gradient Descent [20.47598828422897]
We propose textit-Meta-Regularization, a novel approach for the adaptive choice of the learning rate in first-order descent methods.
Our approach modifies the objective function by adding a regularization term, and casts the joint process parameters.
arXiv Detail & Related papers (2021-04-12T13:13:34Z) - Explicit homography estimation improves contrastive self-supervised
learning [0.30458514384586394]
We propose a module that serves as an additional objective in the self-supervised contrastive learning paradigm.
We show how the inclusion of this module to regress the parameters of an affine transformation or homography improves both performance and learning speed.
arXiv Detail & Related papers (2021-01-12T19:33:37Z) - Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
Local features provide region-to-region rather than point-to-point correspondences.
We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline.
Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
arXiv Detail & Related papers (2020-07-20T12:07:48Z) - Image Matching across Wide Baselines: From Paper to Practice [80.9424750998559]
We introduce a comprehensive benchmark for local features and robust estimation algorithms.
Our pipeline's modular structure allows easy integration, configuration, and combination of different methods.
We show that with proper settings, classical solutions may still outperform the perceived state of the art.
arXiv Detail & Related papers (2020-03-03T15:20:57Z)
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.