This repository is the official implementation of the paper:
Decoupled Geometric Parameterization and its Application in Deep Homography Estimation.
Authors: Yao Huang, Siyuan Cao, Yaqing Ding, Hao Yin, Shibin Xie, Shuting Wang, Zhijun Fang, Jiachun Wang, Shen Cai*, Junchi Yan, Shuhan Shen*.
Links: [ArXiv paper]
The Similarity-Kernel-Similarity (SKS) decomposition is an efficient and interpretable method for homography computation, which we originally proposed approximately seven years ago. In the deep learning era, SKS can be employed as a post-processing solver to estimate homography from four-point positional offsets predicted by neural networks. However, this work aims to address a deeper, long-standing problem: how to represent a homography using eight geometric parameters.
Geometric parameterization of homography aligns conceptually and structurally with existing parameterizations for similarity and affine transformations (see the figure below). Furthermore, it complements the broader family of solver-free estimations, such as translation and rotation in relative pose estimation or 3D point cloud prediction in stereo reconstruction.
While SKS decomposes a homography into geometrically meaningful sub-transformations, its adaptation to deep homography estimation (DHE) is non-trivial. Three central challenges arise: (1) Which eight geometric parameters are suitable for neural network prediction? (2) How can parameters be optimally estimated across stratified sub-transformations? (3) How to endow geometric parameters with a direct interpretation in terms of image feature?
To tackle these challenges, we propose a decoupled geometric parameterization based on the SKS decomposition, tailored for DHE. Our contributions advance SKS in the following key areas:
-
Geometric Parameterization Design: While SKS allows various decompositions involving more than eight parameters, we identify a specific, compact subset of eight parameters suitable for DHE, fixing the rest parameters as known.
-
Parameter Decoupling: Although SKS’s stratified decomposition initially implied a dependency of the kernel transformation
$\mathbf{H}_K$ on the similarity transformation$\mathbf{H}_S$ , our analysis reveals that two independent four-parameter groups can be learned in parallel. -
Angular Offsets Feature: We introduce angular offsets as a novel point-level visual feature and empirically validate their robustness and relevance in homography estimation.
The pipeline comparison between SOTA DHE methods, the original SKS, and our proposed method is illustrated in the following figure:
SKS decomposes a 2D homography into three sub-transformations:
where
In this paper, the homography
where the similarity transformation
and the unknown kernel transformation
The above equations introduce an 8-DOF geometric parameterization for homography, four in
The proposed eight geometric parameters can be decoupled into two independent sets of four parameters, each corresponding to the 2-DOF features of two distinct point vertices. Specifically:
- The four parameters in
$\mathbf{H}_{S}$ (the similarity transformation) are linearly related to the positional offsets of two vertices$M$ and$N$ . The half-length of the image patch square's side is denoted by$r$ , and the relationships are expressed as follows:
- The four parameters in
$\mathbf{H}_{K}$ (the kernel transformation) are linearly related to the angular offsets of the same two vertices. These are expressed via differences in cotangent values from a canonical$45^\circ$ angle:
The above formulation demonstrates that positional and angular features can be learned independently from two images, as shown below, enabling parallel prediction and facilitating more interpretable homography estimation.
Our method is designed to be architecture-agnostic and integrates seamlessly into existing most DHE methods. No changes are made to the network architecture. For the network's outputs, the proposed eight geometric parameters replace the conventional eight positional offsets. For iterative DHE models, this substitution shifts the homography computation step from solving a linear system (based on four-point offsets) to a direct matrix multiplication using the predicted geometric parameters.
Similar to previous methods, we adopt a straightforward supervised learning objective, applying an
The proposed geometric parameterization naturally extends to a unified framework for estimating various 2D transformations. In particular:
- For affine transformations, the structure of the four angular parameters
${\theta, \alpha, \beta, \gamma}$ allows straightforward identification of affine distortions. Specifically, a parallelogram pattern is indicated when$\theta = \gamma$ and$\alpha = \beta$ . - Under a 4-DOF similarity transformation, the same four angles remain invariant at
$45^\circ$ , providing a clear signature for similarity transformations.
This ability to identify degenerate cases (e.g., affine or similarity) from within the 8-DOF homography parameter enhances interpretability and supports broader applications.
We evaluate the method across multiple DHE networks on three commonly used datasets. Our findings include:
- Slight improvement in positional offset metrics, reflecting modest gains in point alignment accuracy;
- Significant reduction in angular offset errors, highlighting the robustness and precision of our proposed representation in capturing orientation-related distortions.


