DCReg: Decoupled LiDAR Registration

• DCReg is a framework that decouples rotational and translational subspaces to detect degeneracy in LiDAR registration.
• It employs Schur complements and eigen-decomposition for a physically interpretable characterization of weak motion directions.
• Targeted preconditioning with Preconditioned Conjugate Gradient results in improved localization accuracy and significant speedups.

Searching arXiv for the exact term and closely related variants to ground the article in the named work and possible disambiguations. DCReg is a framework for detecting, interpreting, and mitigating degeneracy in LiDAR point cloud registration. In the named work, the acronym refers to Decoupled Characterization for Efficient Degenerate LiDAR Registration, and the central claim is that conventional degeneracy handling is unreliable because it does not properly separate scale disparity between rotation and translation from rotation-translation coupling in the registration Hessian. DCReg therefore decouples the problem into rotational and translational subspaces with Schur complements, characterizes weakly constrained directions in physically meaningful terms, and uses that diagnosis to construct a targeted preconditioner for efficient optimization with Preconditioned Conjugate Gradient (PCG) (Hu et al., 8 Sep 2025).

1. Problem regime and motivating failure modes

DCReg is formulated for rigid LiDAR point cloud registration in environments where the geometry does not constrain all six motion degrees of freedom equally. The paper uses degeneracy and ill-conditioning nearly interchangeably: geometrically, some motions are weakly constrained by scene structure; numerically, the Hessian or information matrix becomes rank-deficient or nearly singular. The framework is motivated by operating conditions such as corridors, tunnels, caves, stairways, narrow passages, open parking lots, planar scenes, and other repetitive or sparse settings in which unstable registration can produce missed degeneracy detections, incorrect mitigation, corrupted well-constrained directions, slow or failed convergence, and trajectory drift in sequential systems (Hu et al., 8 Sep 2025).

The registration objective is the standard point-to-plane ICP energy

$$E(\mathbf{R}, \mathbf{t}) = \sum_{i=1}^{N} \left[\mathbf{n}_i^\top(\mathbf{R}\mathbf{p}_i + \mathbf{t} - \mathbf{q}_i)\right]^2,$$

with rigid pose

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$

source cloud $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$, target cloud $\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$, and target normals $\{\mathbf{n}_i\}$. Linearization yields the normal equations

$\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$

where the minimal pose increment is

$$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$

The paper emphasizes the perturbation bound

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$

with $\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$, so the condition number functions as an error amplifier.

Two structural explanations are singled out for why conventional Hessian-spectrum diagnostics can fail. First, the rotational and translational blocks can differ strongly in scale, because rotational curvature depends on point distance from the origin through a lever-arm effect:

$$\|\mathbf{H}_{RR}\| \propto \sum_{i=1}^{N} \|\mathbf{p}_i\|^2\sin^2(\angle(\mathbf{p}_i, \mathbf{n}_i)).$$

Second, the off-diagonal blocks induce compensation effects between rotation and translation. In a narrow corridor, for example, a rotation may be partially offset by a translation, so inspecting either the full six-dimensional spectrum or isolated diagonal blocks can obscure the true weak direction.

2. Registration model and Hessian partition

After first-order rotation linearization,

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$0

the residual and Jacobian for correspondence $\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$1 are

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$2

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$3

where $\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$4. Stacking all correspondences gives

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$5

DCReg relies on the explicit block structure

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$6

with

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$7

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$8

$\mathbf{T}=\{\mathbf{R},\mathbf{t}\}\in SE(3),$9

In this partition, $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$0 represents rotational curvature, $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$1 translational curvature, and $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$2 the coupling term.

The paper’s criticism of prior diagnostics follows directly from this structure. A full spectral decomposition

$\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$3

produces principal directions in a mixed six-dimensional parameter space, which makes physical interpretation difficult. Conversely, examining $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$4 or $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$5 in isolation neglects the compensation encoded by $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$6 and can therefore overestimate observability.

3. Schur-complement decoupling as the core mechanism

DCReg’s central technical idea is that the correct object for rotational degeneracy analysis is not $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$7 by itself, and the correct object for translational degeneracy analysis is not $\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$8 by itself. Instead, one should eliminate the complementary variables via Schur complements to obtain effective subspace curvatures (Hu et al., 8 Sep 2025).

For a block matrix

$\mathcal{P}=\{\mathbf{p}_i\}_{i=1}^N$9

$\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$0 is the Schur complement of $\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$1. Applying this to the registration Hessian gives

$\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$2

with

$\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$3

Thus $\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$4 is the effective rotational Hessian after eliminating translation, and $\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$5 is the effective translational Hessian after eliminating rotation.

The derivation is given by partial minimization of the quadratic model

$\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$6

which yields the reduced rotational objective

$\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$7

with reduced gradient

$\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$8

The translational reduced problem is analogous.

The paper also gives a projection interpretation. If

$\mathcal{Q}=\{\mathbf{q}_i\}_{i=1}^M$9

and $\{\mathbf{n}_i\}$0 projects onto the translational Jacobian range, then

$\{\mathbf{n}_i\}$1

This says that rotational information should be measured only after removing the part explainable by translation. In weighted form,

$\{\mathbf{n}_i\}$2

Two consequences formalize the method’s rationale. The first is that decoupling removes the scale confound: the paper states that $\{\mathbf{n}_i\}$3 is unchanged if translation is uniformly rescaled. The second is that decoupling removes the coupling confound: the spectral ordering

$\{\mathbf{n}_i\}$4

shows that coupling can only reduce effective curvature. Diagonal blocks can therefore overestimate observability.

4. Detection and physically interpretable characterization

Once the decoupled subspaces are formed, DCReg computes

$\{\mathbf{n}_i\}$5

with

$\{\mathbf{n}_i\}$6

sorted in ascending order (Hu et al., 8 Sep 2025).

Rather than thresholding raw eigenvalues, the method defines normalized eigenvalues as direction-specific condition numbers:

$\{\mathbf{n}_i\}$7

A direction is declared ill-conditioned if

$\{\mathbf{n}_i\}$8

The paper states that $\{\mathbf{n}_i\}$9 is typically between $\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$0 and $\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$1, and uses $\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$2 in experiments. The point of this normalization is that the comparison is made within each decoupled three-dimensional subspace, not across mixed rotational and translational scales.

DCReg then maps weak eigendirections to physical motion axes. For an eigenvector $\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$3, the alignment coefficients are

$\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$4

for $\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$5. The dominant axis is selected by

$\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$6

Component contribution percentages are

$\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$7

and alignment strengths are

$\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$8

This permits statements such as “the weak translational direction is primarily $\mathbf{H}\mathbf{\xi}^*=-\mathbf{g},$9” or “the weak rotational mode is primarily yaw,” with quantitative mixtures when $$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$0 is not close to $$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$1.

Because eigenvectors are unstable under sign flips, ordering swaps, and basis rotations inside near-degenerate eigenspaces, the paper adds a Gram-Schmidt stabilization:

$$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$2

and analogously for translation. This is motivated by the Davis-Kahan sensitivity bound

$$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$3

The interpretive outcome is more precise than a generic “small eigenvalue detected”: in open planar scenes or parking lots the weak modes are often $$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$4 translation and yaw, whereas in corridors, stairs, caves, and narrow passages the weak directions depend on scene geometry and visible structure.

5. Targeted mitigation through preconditioning

DCReg’s mitigation strategy is built around the observation that conventional regularizers are too blunt. Tikhonov regularization adds $$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$5 and damps everything uniformly, TSVD discards weak directions entirely, and solution remapping projects updates away from degenerate directions. DCReg instead modifies only the weak eigendirections identified in the decoupled subspaces (Hu et al., 8 Sep 2025).

The method solves the original linear system

$$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$6

with Preconditioned Conjugate Gradient. The block-diagonal preconditioner is

$$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$7

with

$$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$8

In implementation the inverse preconditioner is stored as

$$\mathbf{\xi}=[\mathbf{\phi}^\top,\delta\mathbf{t}^\top]^\top\in\mathbb{R}^6.$$9

The selective stabilization mechanism is eigenvalue clamping:

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$0

applied separately in the rotational and translational subspaces. Here $$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$1 is the target condition number, described as the main tuning parameter; the experiments use $$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$2. The paper further emphasizes cluster-wise constant clamping, so near-degenerate eigenvalue clusters are modified uniformly.

Two theoretical interpretations are given. In the reduced rotational problem

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$3

the solution

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$4

preserves observable components in the limit of vanishing regularization. A second interpretation casts the clamping as MAP estimation. If

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$5

and

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$6

then minimizing

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$7

is equivalent to MAP estimation with Gaussian prior

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$8

and

$$\frac{\|\Delta\mathbf{\xi}^*\|}{\|\mathbf{\xi}^*\|} \leq \kappa(\mathbf{H}) \cdot \frac{\|\Delta(-\mathbf{g})\|}{\|-\mathbf{g}\|},$$9

The preconditioner therefore adds only the minimum directional prior needed to cap conditioning.

The PCG iteration used in the paper is

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$0

followed by

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$1

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$2

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$3

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$4

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$5

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$6

6. End-to-end pipeline and empirical record

The complete DCReg pipeline is organized as a detect-characterize-mitigate procedure (Hu et al., 8 Sep 2025). Starting from source-target correspondences, normals, and a current pose estimate, the method builds the Jacobian and Hessian, computes the Schur complements

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$7

detects ill-conditioned directions via normalized eigenvalue ratios, characterizes weak directions by axis alignment and basis stabilization, constructs the targeted preconditioner, solves with PCG, and updates the pose by

$\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$8

The paper notes that the detection module can also be integrated with other mitigation methods, but that the best performance comes from the full pipeline.

Experiments cover a simulated symmetric cylinder self-registration task and real-world datasets including FusionPortable for corridor, building, and hallway sequences, GEODE for stairs, SubT-MRS for cave sequences, and a self-collected MS parking-lot dataset acquired with Pandar XT-32. Metrics include ATE, AC, CD, DR, runtime, iterations, ICP residuals, and fitness. Baselines include detection methods ME, FCN, and CN / relative condition number, and mitigation methods SR, TReg, TSVD, X-ICP, and Open3D.

The reported aggregate result is that DCReg achieves at least 20%–50% improvement in localization accuracy and 5×–100× speedups over state-of-the-art methods. In simulation, it reaches the best rotation error, Chamfer distance, ICP residual, and fitness, and the optimization-landscape study reports that only DCReg and TReg reach the same global minimum, but DCReg requires about 16 iterations versus ~160 for TReg. In real-world evaluation, examples given in the paper include 7.44 cm ATE in a corridor sequence versus 26.24 cm for ME-TReg, 3.96 cm on stairs versus 6.44–7.16 cm for ME-based methods, 4.57 cm on Cave02, and 29.56 cm ATE with 2.11 ms average runtime in the parking lot experiment.

The ablation results isolate three components: decoupling, characterization, and targeted preconditioning. Removing both detection and mitigation, removing PCG while keeping detection, or substituting traditional mitigators all degrade performance. The paper also states that DCReg detection improves traditional mitigators, but full DCReg remains best.

7. Positioning, limitations, and disambiguation

DCReg is positioned against three families of prior approaches. Full-Hessian eigenvalue or condition-number methods are criticized for mixing rotation and translation and for inheriting the scale disparity between those parameter groups. Diagonal-block methods are criticized more sharply because they ignore $\kappa(\mathbf{H})=\lambda_{\max}/\lambda_{\min}$9 and can miss coupling-induced degeneracy entirely. Tikhonov regularization, TSVD, and solution remapping are treated as mitigation strategies that either corrupt well-constrained directions or remove useful information. What DCReg contributes is the integrated combination of Schur-complement decoupling, quantitative mapping from eigenspace to physical motion directions, and a targeted, physically interpretable preconditioner (Hu et al., 8 Sep 2025).

The framework is also explicit about its limits. It cannot recover information that does not exist in perfectly planar scenes, infinite ideal corridors, or absolutely degenerate geometry. It still depends on being inside the convergence basin of registration; if the initial pose is too poor, local minima remain dominant. Its assumptions include valid correspondences and normals, a reasonable linearization point, and invertible or pseudoinvertible sub-blocks for Schur elimination. The tuning parameters exposed to practice are the degeneracy threshold $$\|\mathbf{H}_{RR}\| \propto \sum_{i=1}^{N} \|\mathbf{p}_i\|^2\sin^2(\angle(\mathbf{p}_i, \mathbf{n}_i)).$$0, the target condition number $$\|\mathbf{H}_{RR}\| \propto \sum_{i=1}^{N} \|\mathbf{p}_i\|^2\sin^2(\angle(\mathbf{p}_i, \mathbf{n}_i)).$$1, and the PCG tolerance and iteration cap; the paper recommends $$\|\mathbf{H}_{RR}\| \propto \sum_{i=1}^{N} \|\mathbf{p}_i\|^2\sin^2(\angle(\mathbf{p}_i, \mathbf{n}_i)).$$2 and reports robust behavior for $$\|\mathbf{H}_{RR}\| \propto \sum_{i=1}^{N} \|\mathbf{p}_i\|^2\sin^2(\angle(\mathbf{p}_i, \mathbf{n}_i)).$$3.

The name also admits disambiguation. A distinct 2026 registration paper uses the hyphenated title “DC-Reg: Globally Optimal Point Cloud Registration via Tight Bounding with Difference of Convex Programming”, where “DC” refers to Difference of Convex programming rather than decoupled characterization (Lian et al., 26 Mar 2026). In a different field entirely, DCREG denotes Dimensionally Continued Regularization, a fermion-trace framework for handling intrinsically integer-dimensional tensors such as $$\|\mathbf{H}_{RR}\| \propto \sum_{i=1}^{N} \|\mathbf{p}_i\|^2\sin^2(\angle(\mathbf{p}_i, \mathbf{n}_i)).$$4 (Zerf, 2019). Within LiDAR registration, however, DCReg most directly denotes the Schur-complement-based framework for efficient degenerate registration introduced in 2025 (Hu et al., 8 Sep 2025).