---
title: Anchored Landmark Parameterizations
url: https://www.emergentmind.com/topics/anchored-landmark-parameterizations
type: topic
---

# Anchored Landmark Parameterizations

Searching arXiv for relevant papers on anchored landmark parameterizations and adjacent usages.
Anchored landmark parameterizations are a family of representations in which geometric, dynamical, or probabilistic variables are expressed relative to discrete anchors, landmarks, or anchor states rather than directly in a single global coordinate frame. Across visual relocalization, visual–inertial navigation, facial landmark localization, object-level SLAM, stochastic landmark geometry, sensor network localization, and few-step generative flow maps, the recurring construction is to decompose prediction into an anchor-selection or anchor-conditioning stage and a local representation stage defined with respect to that anchor. In the visual relocalization formulation of "Improved Visual Relocalization by Discovering Anchor Points" [1811.04370], for example, horizontal camera position is parameterized as offsets from route anchors while vertical position and orientation remain globally parameterized. In the VINS formulation of "Observability and Consistency Analysis for Visual-Inertial Navigation with Anchored Feature Parameterizations" [2606.19307], landmarks are represented relative to an anchor camera/IMU pose. In "AnchorFace: An Anchor-based Facial Landmark Detector Across Large Poses" [2007.03221], 2D facial landmarks are represented as anchor-template coordinates plus regressed offsets. Although these works arise in different subfields, they share a common principle: replace a difficult global estimation problem by a structured local parameterization conditioned on one or more anchors.

## 1. Conceptual scope and recurring structure

An anchored landmark parameterization replaces direct global regression or direct global state storage by a representation of the form “anchor plus local coordinates,” “anchor frame plus local feature parameters,” or “anchor-conditioned stochastic bridge.” In the most explicit camera-pose case, a standard PoseNet-style method regresses the global pose directly as
\[
f_\theta(I) \approx (x, y, z, P) \in \mathbb{R}^6,
\]
whereas the anchor-based alternative in [1811.04370] regresses anchor confidences, relative horizontal offsets, and global \(z\) and orientation.

The same structural idea appears in several distinct forms. In VINS, a landmark is not stored as a global Cartesian coordinate but relative to an anchoring camera frame \(\mathcal{F}_{c_f}\), with the corresponding anchor state carried by the IMU pose at feature initialization [2606.19307]. In AnchorFace, a landmark set is not regressed directly in image coordinates but as
\[
\text{landmarks} \approx \text{anchor template} + \text{offsets},
\]
with a learned confidence over anchor templates and spatial anchor points [2007.03221]. In sensor localization, unknown points are parameterized in the MDS coordinate system induced by physical anchors and then mapped back by a Procrustes transform [2509.11126]. In flow-map RL, a deterministic long-range map is stochasticized through an anchor time \(\Tau\) and an anchor state \(x_{\text{anc}}\), followed by conditional resampling from \(p_{r\mid \Tau}\) [2607.00535].

This suggests a general taxonomy. Some anchored parameterizations use **discrete spatial anchors** along a route or image lattice [1811.04370, 2007.03221]. Others use **anchoring poses or frames** that define local coordinates for landmarks [2606.19307]. Others use **intrinsic manifold anchors** that remove non-uniqueness in object representations, as with \(\mathrm{SPD}(3)\times\mathbb{R}^3\) for object landmarks [2204.10552]. Still others use **ambient landmark spaces** and then restrict to anchored submanifolds obtained by fixing some landmark coordinates [2606.02570]. Despite these differences, the common objective is to improve identifiability, local linearity, numerical conditioning, or statistical consistency by choosing a representation aligned with the structure of the problem.

## 2. Anchor-plus-offset representations in pose and keypoint estimation

In visual relocalization, [1811.04370] defines anchor points \(A_1,\dots,A_N\) uniformly across the route map by selecting every \(k\)-th training frame as an anchor. For an image with ground-truth pose \((x^{(g)}, y^{(g)}, z^{(g)}, P^{(g)})\), the relative horizontal offsets with respect to anchor \(i\) are
\[
X_i = x^{(g)} - x_i^{(a)}, \qquad Y_i = y^{(g)} - y_i^{(a)}.
\]
The network predicts per-anchor confidences \(\hat C_i\), per-anchor offsets \((\hat X_i,\hat Y_i)\), and global \((\hat Z,\hat P)\). At inference time, the relevant anchor is typically
\[
i^\* = \arg\max_i \hat C_i,
\]
and the global horizontal position is reconstructed as
\[
\hat x^{(g)} = x_{i^\*}^{(a)} + \hat X_{i^\*}, \qquad
\hat y^{(g)} = y_{i^\*}^{(a)} + \hat Y_{i^\*}.
\]
The representation is only partially anchored, since \(z\) and orientation remain globally regressed [1811.04370].

In facial landmark localization, AnchorFace uses a related but denser construction. A finite set of anchor templates \(T(a,t)\) is defined by a spatial anchor point \(a\) and a pose prototype \(t\). For each anchor template, the network predicts landmark offsets \(O_j(a,t)\) and a confidence \(C(a,t)\), so that each anchor induces a candidate prediction
\[
T_j(a,t) + O_j(a,t).
\]
Final landmarks are obtained by confidence-weighted aggregation after thresholding with \(C_{th}=0.6\):
\[
\widetilde{S}_j = \frac{\sum_{a\in A,\, t\in T} \widetilde{C}(a,t)\cdot \big( O_j(a,t) + T_j(a,t) \big)}{\sum_{a\in A,\, t\in T} \widetilde{C}(a,t)}.
\]
Here the parameterization is not tied to a single selected anchor but to a mixture over many anchor hypotheses [2007.03221].

The two formulations differ in how they use anchors at inference. The relocalization system appears to use only top-1 anchor selection [1811.04370], whereas AnchorFace explicitly aggregates over many anchors [2007.03221]. This suggests two operational regimes of anchored parameterization: a **hard-anchor regime**, where an anchor indexes a local coordinate chart, and a **soft-anchor regime**, where anchors provide a set of local experts combined by confidences.

## 3. Landmark states relative to anchor frames in VINS and SLAM

In VINS, anchored landmark parameterization refers to representing a 3D feature relative to a specific anchor pose rather than in a global frame. The paper [2606.19307] considers a global frame \(\mathcal{F}_a\), an IMU frame \(\mathcal{F}_{b_f}\) at anchoring time \(t_f\), and a camera frame \(\mathcal{F}_{c_f}\) rigidly attached to the IMU. The anchored landmark coordinates are defined in the camera frame by
\[
\mathbf{r}_{c_f}^{p_j c_f} = \mathbf{h}_a(\boldsymbol{\lambda}^j),
\]
and the global landmark position is
\[
\mathbf{r}_a^{p_j w} = \mathbf{h}_r\left(\boldsymbol{\lambda}^j,\mathbf{C}_{ab_f},\mathbf{r}_a^{z_f w}\right) = \mathbf{C}_{ab_f}\Big(\mathbf{C}_{bc}\,\mathbf{h}_a(\boldsymbol{\lambda}^j) + \mathbf{r}_b^{cz}\Big) + \mathbf{r}_a^{z_f w}. \tag{1}
\]
The anchored inverse-depth parameterization used in the paper is
\[
\mathbf{h}_a(\boldsymbol{\lambda}^j) =
\frac{1}{\rho^j}
\begin{bmatrix}
\alpha^j \\
\beta^j \\
1
\end{bmatrix},
\qquad
\boldsymbol{\lambda}^j =
\begin{bmatrix}
\alpha^j \\
\beta^j \\
\rho^j
\end{bmatrix}. \tag{2}
\]

The central analytical result is that, for anchored landmark parameterizations of the form above, the unobservable subspace does not depend on the landmark states. In the notation of [2606.19307], the landmark blocks of the nullspace satisfy
\[
\mathbf{N}_1^\lambda = \mathbf{0}_{3\times 3}, \quad \mathbf{N}_2^\lambda = \mathbf{0}_{3\times 1}. \tag{18}
\]
By contrast, global feature parameterization yields landmark-dependent nullspace blocks
\[
\mathbf{N}_1^\lambda = \mathbf{I}_{3\times 3}, \quad \mathbf{N}_2^\lambda = -\mathbf{r}_a^{p_1 w\,\times}\,\mathbf{g}_a. \tag{17}
\]
This independence from landmark linearization points is the basis for the improved consistency properties reported in [2606.19307].

Object-level SLAM introduces a different but related anchoring problem. Conventional object parameterizations on \(\mathrm{SO}(3)\times\mathbb{R}^3_{\text{trans}}\times\mathbb{R}^3_{\text{scale}}\) are not globally consistent because the same ellipsoid can be represented by different combinations of rotation and axis lengths. The representation proposed in [2204.10552] replaces separate pose and scale variables by a single symmetric positive-definite matrix \(\mathbf{P}\in\mathrm{SPD}(3)\) together with translation \(\mathbf{t}\in\mathbb{R}^3\), so the object landmark state becomes
\[
\mathcal{O} = [\mathbf{P},\mathbf{t}] \in \mathrm{SPD}(3)\times \mathbb{R}^3_{\text{trans}}.
\]
The dual quadric is written as
\[
\mathbf{Q}^* =
\begin{bmatrix} \mathbf{I}_{3} & -\mathbf{t}\\ \mathbf{0}^T & 0 \end{bmatrix}
\begin{bmatrix} \mathbf{P} & 0\\ 0 & -1 \end{bmatrix}
\begin{bmatrix} \mathbf{I}_{3} & -\mathbf{t}\\ \mathbf{0}^T & 0 \end{bmatrix}^T
=
\begin{bmatrix} \mathbf{P} - \mathbf{t}\mathbf{t}^T & \mathbf{t}\\ \mathbf{t}^T & -1 \end{bmatrix}. \tag{4}
\]
Here the “anchor” is not a measurement frame but a globally consistent intrinsic representation of the object’s shape and orientation. This removes the Rot–Scale ambiguity that arises when the same abstract object can be represented by a 90° frame rotation and a swap of length and width [2204.10552].

## 4. Loss design, confidence weighting, and anchor discovery

A characteristic feature of anchored parameterizations is that anchor selection is often latent rather than supervised. In [1811.04370], the model does not require labels for which anchor is relevant. Instead, it uses a confidence-weighted offset loss
\[
\mathcal{L}_{XY} = \sum_{i=1}^{N} \left[ (X_i - \hat X_i)^2 + (Y_i - \hat Y_i)^2 \right] \hat C_i. \tag{1}
\]
If anchor \(i\) is irrelevant, the network can drive \(\hat C_i\) toward 0; if it is relevant, the model is encouraged to assign it high confidence and accurate offsets. An optional nearest-anchor cross-entropy term
\[
\mathcal{L}_{\text{CE}} = H(C,\hat C) \tag{3}
\]
can be added, but the paper reports that without this cross-entropy term, performance is often better, especially in Cambridge Landmarks, where the variant without CE performs better in 5 of 6 scenes [1811.04370]. The total loss is
\[
\mathcal{L}_{\text{total}} =
\alpha_1\, H(C,\hat C)\;+\; \alpha_2 \sum_{i=1}^{N} \left[(X_i - \hat X_i)^2 + (Y_i - \hat Y_i)^2\right]\hat C_i\;+\; \alpha_3 \left[ (Z - \hat Z)^2 + \Big\| P - \tfrac{\hat P}{\|\hat P\|} \Big\|^2 \right]. \tag{4}
\]
The “discovered anchor” variant sets \(\alpha_1=0\) [1811.04370].

AnchorFace uses a different supervision strategy. Every anchor receives a regression target and a soft confidence target derived from template proximity to the ground-truth shape. If \(\mathbf{v}_1\) and \(\mathbf{v}_2\) are flattened landmark vectors for the anchor template and the ground truth, respectively, then
\[
\overline{C}(a,t) = \tanh\left( \left(\frac{\|\mathbf{v}_1 - \mathbf{v}_2\|_2}{\beta \cdot 2L}\right)^{-1} \right),
\]
with \(\beta = 0.05\) [2007.03221]. Regression is then weighted by this confidence target,
\[
L_{reg} = \sum_{a\in A, t\in T} C(a,t) \sum_{j} \big| O_j(a,t) - \overline{O}_j(a,t) \big|,
\]
and the confidence branch is trained by a binary cross-entropy-like loss, with total loss
\[
L_{total} = L_{reg} + \lambda \cdot L_{con},
\]
using \(\lambda=0.5\) [2007.03221].

These two designs illustrate distinct meanings of “anchor confidence.” In [1811.04370], confidence acts as a latent selector that emerges from minimizing weighted regression error. In [2007.03221], confidence approximates template–ground-truth proximity and is then used for aggregation. This suggests that anchored parameterizations can either **discover anchors endogenously from reconstruction quality** or **learn anchor weights from explicit geometry-derived supervisory signals**.

## 5. Mathematical and geometric formulations beyond vision regression

Anchored landmark parameterizations also arise as coordinate systems on geometric spaces. In the landmark-space analysis of [2606.02570], the basic configuration manifold is
\[
Land = \{x=(x_1,\dots,x_n): x_i\in\mathbb{R}^d,\ x_i\neq x_j\ \text{for } i\neq j\},
\]
an open subset of \(\mathbb{R}^{nd}\). An anchored configuration space is obtained by fixing some landmark coordinates, for example
\[
Land^{\text{anchor}} = \{x\in Land : x_1 = a\},
\]
which is a submanifold of codimension \(d\). The ambient Riemannian cometric is induced by a kernel
\[
g^{ij}(x) = K(x_i,x_j),
\]
and under translation and rotation invariance,
\[
K(x_i,x_j) = k(\|x_i - x_j\|)\,I_d. \tag{2.1}
\]
Anchoring corresponds to restricting this kernel-induced structure to a submanifold where some points are frozen [2606.02570]. In this setting, anchoring is not primarily an estimation device but a geometric constraint on the parameter space itself.

The same paper establishes stochastic completeness results for such landmark spaces. For Sobolev/Matérn kernels with
\[
\widehat{k}(\xi) = (1 + \sigma^2\|\xi\|^2)^{-s}, \tag{3.1}
\]
the threshold
\[
s\ge 1 + d/2
\]
guarantees stochastic completeness for all \(n\ge 2\) [2606.02570]. The paper argues that anchored spaces inherit the relevant completeness, separation, and volume-growth properties from the ambient landmark space when the induced metric is restricted compatibly.

In sensor network localization, [2509.11126] formulates an anchored parameterization in an MDS coordinate system built from physical anchors \(a_i\in\mathbb{R}^r\). After classical MDS on the anchor distance matrix \(D\), the anchor coordinates in MDS space are
\[
A := [\alpha_1,\dots,\alpha_m] = \Lambda^{1/2}U_r^\top.
\]
For a new point with squared distances \(\delta\) to anchors, LMDS computes
\[
\hat{\alpha}_{\text{lmds}}(D,\delta) = -\frac{1}{2}\,\Lambda^{-1}A(\delta-\delta_0).
\]
A Procrustes map then returns coordinates in the physical anchor frame:
\[
\mathcal{M}(\alpha) := P\alpha + a_0, \tag{5}
\]
where \(a_0\) is the anchor centroid and \(P\) is determined from anchor geometry alone [2509.11126]. Here the anchor set fixes translation and rotation ambiguities, and the unknown point is parameterized by its coordinates in the anchor-induced MDS system.

## 6. Empirical behavior across domains

The empirical consequences of anchored parameterizations depend on the application but display recurring patterns.

In visual relocalization, [1811.04370] reports improved median errors over PoseNet with geometric reprojection loss using the same feature extractor. On the Cambridge Street scene, PoseNet with geometric reprojection gives \(20.7\) m and \(25.7^\circ\), the anchor-based GoogLeNet model without CE gives \(11.8\) m and \(24.3^\circ\), and the best DenseNet anchor-based version without CE gives \(7.86\) m and \(24.2^\circ\). The translation improvement on Street is therefore more than \(8\) m [1811.04370]. The same paper reports that on 7 Scenes the anchor-based method achieves \(<0.2\) m median translation on all scenes and outperforms PoseNet variants.

The effect is not reducible to backbone choice alone. On Cambridge, a DenseNet direct regressor gives \(1.32\) m and accuracy \(82.64\%\) on Shop Facade, whereas the anchor-based DenseNet gives \(0.52\) m and accuracy \(93.76\%\); on King’s College, direct regression gives \(1.45\) m and \(81.80\%\), while the anchored version gives \(0.57\) m and \(93.52\%\) [1811.04370].

In facial landmark localization, AnchorFace outperforms a direct-regression baseline particularly at larger yaw. On AFLW, the baseline yields NME \(1.67\) on Full and \(2.13\) on Heavy, while AnchorFace yields \(1.56\) on Full and \(1.96\) on Heavy [2007.03221]. Template count matters: KMeans-24 outperforms KMeans-3 and KMeans-48 on AFLW, with \(1.56\) NME on Full versus \(1.60\) and \(1.58\), respectively [2007.03221]. Weighted aggregation also outperforms Argmax and Mean; on Heavy, Weighted gives \(1.96\), Argmax \(2.00\), and Mean \(2.22\) [2007.03221].

In VINS, [2606.19307] reports that all estimators employing anchored feature parameterizations exhibit improved consistency properties compared to algorithms that estimate features in a global reference frame, especially when feature initialization may be poor. On TUM-VI room sequences, the monocular average ATE for Std-G3D is \(4.692^\circ / 0.114\,\text{m}\), whereas Std-AID gives \(1.544^\circ / 0.067\,\text{m}\); FEJ-AID gives \(1.591^\circ / 0.067\,\text{m}\); RI-AID gives \(1.530^\circ / 0.066\,\text{m}\) [2606.19307]. In stereo, Std-G3D gives \(4.886^\circ / 0.118\,\text{m}\), while Std-AID gives \(1.522^\circ / 0.076\,\text{m}\) [2606.19307].

In object-level SLAM, [2204.10552] reports that the proposed \(\mathrm{SPD}(3)\) representation improves mapping accuracy by \(22\%\) on average using the same front-end data. On real datasets, Multi-SLAM-SPD achieves average IoU \(0.333\) versus \(0.272\) for Multi-SLAM-RTS and \(0.139\) for Quadric-SLAM, and average orientation error \(9.1^\circ\) versus \(10.9^\circ\) and \(32.6^\circ\), respectively [2204.10552]. In simulation, the \(\mathrm{SPD}(3)\)-based method converges \(23\%\) faster on average than Rot–Trans–Scale [2204.10552].

These results suggest a common empirical pattern: anchoring tends to help most when the original global parameterization is highly nonlinear, ambiguous, or sensitive to poor initialization.

## 7. Limitations, controversies, and open directions

Anchored landmark parameterizations do not remove all difficulties, and several limitations recur across the literature.

In visual relocalization, the anchoring is only partial. The paper [1811.04370] states that regressing relative offsets for \(Z\) and orientation made learning harder and performed worse, so only \((x,y)\) are anchored. Performance depends on anchor spacing and loss weights \((\alpha_1,\alpha_2,\alpha_3)\), and the paper notes that too many anchors or too few anchors hurt performance. The method also appears to use only top-1 anchor selection at inference, leaving probabilistic multi-anchor combination unexplored [1811.04370].

In AnchorFace, template design introduces its own discretization trade-offs. Too few templates under-cover pose variation, whereas too many can add redundancy and degrade performance, as in the comparison between KMeans-24 and KMeans-48 [2007.03221]. The method handles self-occlusion implicitly rather than by explicit visibility modeling.

In VINS, anchored feature parameterizations remove landmark dependence from the unobservable subspace but do not remove navigation-state dependence. The paper [2606.19307] therefore still proposes FEJ and RI-EKF variants to handle remaining inconsistency due to navigation-state linearization. Anchoring alone improves consistency, but it is not a complete solution.

In object-level SLAM, the \(\mathrm{SPD}(3)\) approach models objects as ellipsoids or circumscribed cubes rather than full shapes, and the experiments assume correct front-end data association [2204.10552]. The representation removes artificial singularities but not intrinsic ambiguities of symmetric objects.

In stochastic landmark geometry, anchored spaces inherit the kernel-dependent thresholds of the full landmark manifold. The paper [2606.02570] emphasizes that adding anchors does not change the critical regularity; if \(s < 1 + d/2\), collisions and stochastic incompleteness can occur even if some landmarks are fixed.

Several papers explicitly point toward extensions. The relocalization work suggests learned anchor selection, full \(SE(3)\) anchor-based parameterization, soft combination over multiple anchors, SLAM integration, hierarchical anchors, and uncertainty estimation [1811.04370]. The sensor localization analysis suggests tuning a family of objectives balancing length and angle preservation, with LS emerging as a regularized LMDS solution [2509.11126]. The flow-map RL paper suggests that anchor times and anchor states can function as a control mesh over stochastic trajectories without changing the original deterministic model parameterization [2607.00535].

A plausible implication is that anchored landmark parameterizations are best understood not as a single technique but as a design pattern. The anchor may be a spatial landmark, a camera pose, a prototype template, an object-intrinsic manifold coordinate, an MDS basis, or a future waypoint in time–state space. What unifies these constructions is the decision to encode structure relative to anchors that make the remaining prediction or optimization local, better conditioned, or more faithful to the geometry of the underlying problem.

Source: https://www.emergentmind.com/topics/anchored-landmark-parameterizations