$H$-RANSAC, an algorithmic variant for Homography image transform from
featureless point sets: application to video-based football analytics
- URL: http://arxiv.org/abs/2310.04912v1
- Date: Sat, 7 Oct 2023 20:56:39 GMT
- Title: $H$-RANSAC, an algorithmic variant for Homography image transform from
featureless point sets: application to video-based football analytics
- Authors: George Nousias, Konstantinos Delibasis, Ilias Maglogiannis
- Abstract summary: We propose a generalized RANSAC algorithm to retrieve homography from sets of transformations without local feature vectors and point pairing.
The proposed methodology is tested on a large dataset of images acquired by cameras during real football matches, where radically different views at each 12 timestamp are to be matched.
- Score: 1.1970409518725493
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: Estimating homography matrix between two images has various applications like
image stitching or image mosaicing and spatial information retrieval from
multiple camera views, but has been proved to be a complicated problem,
especially in cases of radically different camera poses and zoom factors. Many
relevant approaches have been proposed, utilizing direct feature based, or deep
learning methodologies. In this paper, we propose a generalized RANSAC
algorithm, H-RANSAC, to retrieve homography image transformations from sets of
points without descriptive local feature vectors and point pairing. We allow
the points to be optionally labelled in two classes. We propose a robust
criterion that rejects implausible point selection before each iteration of
RANSAC, based on the type of the quadrilaterals formed by random point pair
selection (convex or concave and (non)-self-intersecting). A similar post-hoc
criterion rejects implausible homography transformations is included at the end
of each iteration. The expected maximum iterations of $H$-RANSAC are derived
for different probabilities of success, according to the number of points per
image and per class, and the percentage of outliers. The proposed methodology
is tested on a large dataset of images acquired by 12 cameras during real
football matches, where radically different views at each timestamp are to be
matched. Comparisons with state-of-the-art implementations of RANSAC combined
with classic and deep learning image salient point detection indicates the
superiority of the proposed $H$-RANSAC, in terms of average reprojection error
and number of successfully processed pairs of frames, rendering it the method
of choice in cases of image homography alignment with few tens of points, while
local features are not available, or not descriptive enough. The implementation
of $H$-RANSAC is available in https://github.com/gnousias/H-RANSAC
Related papers
- Pentagon-Match (PMatch): Identification of View-Invariant Planar Feature
for Local Feature Matching-Based Homography Estimation [2.240487187855135]
In computer vision, finding correct point correspondence among images plays an important role in many applications, such as image stitching, image retrieval, visual localization, etc.
Most of the research works focus on the matching of local feature before a sampling method is employed, such as RANSAC, to verify initial matching results.
Pentagon-Match (PMatch) is proposed in this work to verify the correctness of initially matched keypoints using pentagons randomly sampled from them.
arXiv Detail & Related papers (2023-05-27T12:41:23Z) - High-fidelity Pseudo-labels for Boosting Weakly-Supervised Segmentation [17.804090651425955]
Image-level weakly-supervised segmentation (WSSS) reduces the usually vast data annotation cost by surrogate segmentation masks during training.
Our work is based on two techniques for improving CAMs; importance sampling, which is a substitute for GAP, and the feature similarity loss.
We reformulate both techniques based on binomial posteriors of multiple independent binary problems.
This has two benefits; their performance is improved and they become more general, resulting in an add-on method that can boost virtually any WSSS method.
arXiv Detail & Related papers (2023-04-05T17:43:57Z) - A Geometrically Constrained Point Matching based on View-invariant
Cross-ratios, and Homography [2.050924050557755]
A geometrically constrained algorithm is proposed to verify the correctness of initially matched SIFT keypoints based on view-invariant cross-ratios (CRs)
By randomly forming pentagons from these keypoints and matching their shape and location among images with CRs, robust planar region estimation can be achieved efficiently.
Experimental results show that satisfactory results can be obtained for various scenes with single as well as multiple planar regions.
arXiv Detail & Related papers (2022-11-06T01:55:35Z) - Space-Partitioning RANSAC [30.255457622022487]
A new algorithm is proposed to accelerate RANSAC model quality calculations.
The method is based on partitioning the joint correspondence space, e.g., 2D-2D point correspondences, into a pair of regular grids.
It reduces the RANSAC run-time by 41% with provably no deterioration in the accuracy.
arXiv Detail & Related papers (2021-11-24T10:10:04Z) - DeepI2P: Image-to-Point Cloud Registration via Deep Classification [71.3121124994105]
DeepI2P is a novel approach for cross-modality registration between an image and a point cloud.
Our method estimates the relative rigid transformation between the coordinate frames of the camera and Lidar.
We circumvent the difficulty by converting the registration problem into a classification and inverse camera projection optimization problem.
arXiv Detail & Related papers (2021-04-08T04:27:32Z) - Efficient Initial Pose-graph Generation for Global SfM [56.38930515826556]
We propose ways to speed up the initial pose-graph generation for global Structure-from-Motion algorithms.
The algorithms are tested on 402130 image pairs from the 1DSfM dataset.
arXiv Detail & Related papers (2020-11-24T09:32:03Z) - Permuted AdaIN: Reducing the Bias Towards Global Statistics in Image
Classification [97.81205777897043]
Recent work has shown that convolutional neural network classifiers overly rely on texture at the expense of shape cues.
We make a similar but different distinction between shape and local image cues, on the one hand, and global image statistics, on the other.
Our method, called Permuted Adaptive Instance Normalization (pAdaIN), reduces the representation of global statistics in the hidden layers of image classifiers.
arXiv Detail & Related papers (2020-10-09T16:38:38Z) - Inter-Image Communication for Weakly Supervised Localization [77.2171924626778]
Weakly supervised localization aims at finding target object regions using only image-level supervision.
We propose to leverage pixel-level similarities across different objects for learning more accurate object locations.
Our method achieves the Top-1 localization error rate of 45.17% on the ILSVRC validation set.
arXiv Detail & Related papers (2020-08-12T04:14:11Z) - 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) - RANSAC-Flow: generic two-stage image alignment [53.11926395028508]
We show that a simple unsupervised approach performs surprisingly well across a range of tasks.
Despite its simplicity, our method shows competitive results on a range of tasks and datasets.
arXiv Detail & Related papers (2020-04-03T12:37:58Z)
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.