Reflectional Matching: Concepts & Techniques

• Reflectional matching is the process of identifying corresponding points or regions by applying reflection transformations, fundamental in symmetry detection and invariant representation.
• It encompasses formulations based on Euclidean geometry, registration, or manifold optimization to jointly estimate reflectance transformations and data correspondences.
• Learning-based and spectral methods extend the framework to 2D images and 3D shapes, achieving high accuracy and robustness in challenging, occluded, or complex scenarios.

In the cited literature, reflectional matching is treated as the problem of establishing correspondence under a reflection operation: points are paired with reflected counterparts in a point set, regions on one side of an image axis are compared with regions on the other side, a surface is matched to itself under an intrinsic self-isometry, or a stochastic bridge is matched under reflected dynamics. The common object is not a single algorithm but a family of formulations in which the reflected relation is the primary structural constraint, and the output may be a symmetry axis, a reflection plane, a self-correspondence, a matching score, or a reflected transport field (Nagar et al., 2017, Qiao et al., 2019, Shi et al., 2020, Häggbom et al., 3 Jul 2026).

1. Core formulations of reflectional matching

A fundamental Euclidean formulation appears in approximate reflection symmetry detection for point sets. Given a finite set $$\mathcal{S}=\{\mathbf{x}_i\}_{i=1}^n \subset \mathbb{R}^d$$, the task is jointly to estimate a bijection pairing each point with its reflected counterpart and the reflection transformation that best explains those pairings. The paper parameterizes reflection by a translation vector $\mathbf{t}$, $d-1$ rotation matrices $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$, and the sign-flip matrix

$$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$

so that a reflected counterpart is

$$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$

Correspondence is encoded by a permutation matrix $\mathbf{P}$, and the objective minimizes Frobenius mismatch between the transformed set and $\mathbf{X}\mathbf{P}$ (Nagar et al., 2017).

A second Euclidean formulation reduces mirror symmetry detection to registration. In the MSR framework, data are first reflected with respect to an arbitrary plane, then the reflected data are rigidly registered back to the original, and finally the true symmetry hyperplane is recovered from the composed transformation. If $R_0x+t$ is the registration map and $S_v$ is the reflection matrix for the initial plane, the matrix

$\mathbf{t}$0

has an eigenvector $\mathbf{t}$1 of eigenvalue $\mathbf{t}$2, which supplies the recovered symmetry-plane normal, while

$\mathbf{t}$3

gives a point on the plane (Cicconet et al., 2016).

On manifolds, the reflectional matching problem is formulated intrinsically rather than extrinsically. For a triangle mesh $\mathbf{t}$4, the goal is to find a self-homeomorphism

$\mathbf{t}$5

that preserves geodesic distances,

$\mathbf{t}$6

Here the matched counterpart of a point is its intrinsically reflected point, determined by the surface metric rather than by a Euclidean embedding (Qiao et al., 2019).

Single-view RGB-D symmetry prediction uses an explicitly pointwise matching formulation. A reflectional symmetry $\mathbf{t}$7 is parameterized by a point on the plane and a normal,

$\mathbf{t}$8

and for each observed 3D point $\mathbf{t}$9 the network predicts both the reflection plane and the symmetric counterpart $d-1$0. In that setting, reflectional matching means estimating, for each visible point, the reflected counterpart that supports the predicted symmetry plane (Shi et al., 2020).

These formulations show that reflectional matching can be posed as transform estimation, correspondence recovery, self-isometry inference, or transform-conditioned counterpart prediction. This suggests that the term is best understood operationally: matching is “reflectional” when reflection is the relation that defines admissible correspondence.

2. Euclidean geometry, registration, and manifold optimization

The registration-based view treats reflectional matching as a special case of alignment. MSR performs three steps: reflection with respect to an arbitrary plane, registration of original and reflected datasets, and recovery of the symmetry hyperplane from the reflection-plus-registration transform. The authors emphasize that the exactness of the resulting solution depends entirely on the registration accuracy. For 2D data they introduce a registration backend based on random sample consensus of an ensemble of normalized cross-correlation matches, and on one-shot symmetry line detection in the NYU database this NXC-based registration achieved about $d-1$1 accuracy, whereas the other tested methods were around $d-1$2. In 3D, using ICP as the registration backend, MSR correctly detected symmetry in $d-1$3 out of $d-1$4 shapes, i.e. $d-1$5 accuracy (Cicconet et al., 2016).

The point-set optimization view instead solves matching and symmetry jointly. With fixed $d-1$6, the reflection parameters are optimized on a smooth Riemannian product manifold consisting of $d-1$7 rotation manifolds and Euclidean translation space. The paper derives explicit Euclidean gradients, tangent-space projections, and Hessians, and uses a Riemannian trust-region method implemented in Manopt. With fixed transform, correspondence is recomputed as a linear assignment problem, obtained by relaxing an integer linear program and rounding the solution at $d-1$8. The method is descriptor independent because it uses only coordinates, not local features (Nagar et al., 2017).

The empirical claims in this formulation are framed as state-of-the-art reflection symmetry detection on the ICCV 2017 “Detecting Symmetry in the Wild” benchmark. The reported maximum F-scores are $d-1$9 for Ecins et al., $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$0 for Cicconet et al., $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$1 for Speciale et al., and $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$2 for the proposed method. The same paper also reports robustness under synthetic perturbations and applicability to 2D, 3D, and higher-dimensional point sets (Nagar et al., 2017).

Both approaches rely on strong geometric consistency, but they differ in the role of correspondence. MSR delegates correspondence implicitly to a registration algorithm, whereas the manifold-optimization method represents correspondence explicitly by a permutation matrix. A plausible implication is that these two lines of work occupy complementary ends of the reflectional-matching spectrum: one reduces the problem to rigid alignment, and the other internalizes matching as a constrained variable.

3. Intrinsic and spectral reflectional matching on shapes

Intrinsic reflectional matching replaces explicit search over reflected point pairs by a functional representation of self-isometry. A self-isometry $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$3 induces a functional map $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$4 on $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$5, and with Laplace–Beltrami eigenfunctions $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$6 as basis the functional map is represented by a matrix $\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$7 whose entries are

$\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$8

The decisive observation is that for non-repeating eigenvalues,

$\mathbf{R}_1,\dots,\mathbf{R}_{d-1}$9

with sign

$$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$0

If all eigenvalues are non-repeating, the functional map matrix is diagonal with diagonal entries given by these signs (Qiao et al., 2019).

This converts intrinsic reflectional matching into sign prediction in the spectral domain. The network SignNet takes the first few eigenfunctions as intrinsic context together with a target eigenfunction and predicts a two-way sign label with cross-entropy loss. The architecture uses 5 shared MLP layers with $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$1 channels, then max pooling, then fully connected layers of $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$2. Because input consists of eigenfunction values at vertices rather than raw coordinates or mesh connectivity, the method avoids explicit connectivity processing and avoids random sampling (Qiao et al., 2019).

The reported performance claims are precise. On SCAPE, FA requires $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$3s and the proposed method $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$4s, which the paper describes as over $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$5 faster; the best prior correspondence rate is $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$6, versus $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$7 for the proposed method. On TOSCA, FA reports $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$8 average correspondence rate, versus $$\mathbf{E}= \begin{bmatrix} \mathbf{I}_{d-1} & \mathbf{0}_{d-1} \ \mathbf{0}_{d-1}^\top & -1 \end{bmatrix},$$9 for the proposed method. The paper also reports $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$0 mesh rate on SCAPE for both FA and the proposed method, and $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$1 mesh rate on TOSCA for the proposed method. Challenging cases include different topology and incomplete shapes with holes (Qiao et al., 2019).

In this setting, reflectional matching becomes spectral rather than combinatorial. The sign pattern of Laplace–Beltrami eigenfunctions determines the diagonal functional map, and pointwise correspondence is recovered only after this functional representation is assembled and post-processed. This suggests a shift from matching reflected points directly to matching the action of reflection on a basis of functions.

4. Image-plane reflectional matching and symmetry-axis detection

In 2D images, reflectional matching is often expressed through symmetry-axis detection rather than direct dense correspondence. One formulation defines a valid symmetry axis as one for which structures on one side of the axis match their reflected counterparts on the other side in terms of geometry, texture, and color. The method begins with Log-Gabor edge detection, computes a multi-scale amplitude map

$$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$2

extracts feature points on a regular grid, augments each feature with a textural histogram $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$3 and an $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$4 histogram $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$5, and then votes over feature pairs $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$6. The pair weight

$$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$7

combines geometric, textural, and color consistency, and the final evidence is accumulated in a 2D voting histogram $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$8. The detected axes are peaks after Gaussian smoothing and non-maximal suppression (Elawady et al., 2017).

That line of work emphasizes global mirror similarity rather than fragmented local axes. The experiments span four single-case datasets and three multiple-case datasets from PSU, AVA, NY, and ICCV2017. Two variants are reported: Lg and LgC. According to the paper, LgC improves over prior methods on PSU, AVA, NY, PSUm, and NYm; Lg is usually second-best and can be best on gray-scale or low-saturation images; and LgC and Lg outperform Cicconet et al. and Elawady et al. on most datasets under the ICCV2017 evaluation (Elawady et al., 2017).

A different image formulation argues that standard CNNs struggle because reflection symmetry requires paired local regions to match under reflection and because ordinary convolutions are not inherently equivariant or invariant to reflection and rotation. The proposed polar matching convolution converts local neighborhoods into polar representations, computes intra-region correlation tensors, and applies an axis-aware reflective matching kernel that aggregates only the angular pairings consistent with reflection about each candidate axis. The full PMCNet combines a ResNet-101 encoder with ASPP, two PMC branches, and a decoder. The LDRS dataset contains $$\mathbf{x}_{i^\prime} = \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)\mathbf{E} \left(\prod_{u=1}^{d-1}\mathbf{R}_u\right)^\top(\mathbf{x}_i-\mathbf{t})+\mathbf{t}.$$9 train, $\mathbf{P}$0 validation, and $\mathbf{P}$1 test images, and PMCNet achieves $\mathbf{P}$2 max $\mathbf{P}$3 on SDRW (Seo et al., 2021).

A third image-based line uses reflection axes as intermediate objects for higher-level symmetry reasoning. Building on WaveletSym, the method recursively splits images using the top three symmetry lines, filters predictions using symThresholdAC = 0.20 and normThresholdAC = 0.70, removes redundant lines with similar slope and centre, and infers rotational symmetry candidates from perpendicular, intersecting reflection lines whose scores differ by at most $\mathbf{P}$4, formalized as CircleSymThreshold = 0.75. A Random Forest classifier with max_depth=10 and criterion="entropy" then classifies reflection-axis pairs, reaching accuracy $\mathbf{P}$5 and AUC $\mathbf{P}$6 on the separate test set (Ponse et al., 2022).

Across these works, image-plane reflectional matching is not limited to line fitting. It can be a weighted global vote over reflected feature pairs, a structured local-matching operator in polar coordinates, or an intermediate representation from which other symmetries are inferred.

5. Learning-based 3D reflectional matching and reflectional invariance

Single-view RGB-D symmetry prediction extends reflectional matching to partial 3D observations. The network uses an RGB branch, a PointNet depth branch, fused pointwise features, a spatially weighted pooled global feature, and a 3-layer MLP symmetry predictor. For reflectional symmetry, each point predicts symmetry type, reflection parameters through a projected point $\mathbf{P}$7, and counterpart estimation through both classification over all points and direct regression of $\mathbf{P}$8. The reflection-specific loss is

$\mathbf{P}$9

and the paper states that the counterpart loss encourages spatial proximity of high-probability matches to the true counterpart. Multiple symmetries are handled by order-independent training via optimal assignment with the Hungarian algorithm, and inference uses DBSCAN clustering, confidence weighting, and a visibility-based verification step. A predicted reflection symmetry is considered correct if

$\mathbf{X}\mathbf{P}$0

The benchmark is based on ShapeNet, YCB, and ScanNet, and the largest ablation drop for reflectional symmetry is caused by removing counterpart prediction (Shi et al., 2020).

Point-cloud analysis addresses a different problem: not detecting a reflection plane but making predictions invariant under reflection. Cloud-RAIN combines quadratic neurons with PCA canonical representation. Reflectional invariance is written as

$\mathbf{X}\mathbf{P}$1

where $\mathbf{X}\mathbf{P}$2 and $\mathbf{X}\mathbf{P}$3. The quadratic neuron

$\mathbf{X}\mathbf{P}$4

uses a power term invariant to sign flips, while PCA transforms arbitrary-plane reflection into a sign-flipping ambiguity. On S3DIS, examples reported in the paper include PointNet from $\mathbf{X}\mathbf{P}$5 to $\mathbf{X}\mathbf{P}$6, PointNet++ from $\mathbf{X}\mathbf{P}$7 to $\mathbf{X}\mathbf{P}$8, PointMLP from $\mathbf{X}\mathbf{P}$9 to $R_0x+t$0, and PointMixer from $R_0x+t$1 to $R_0x+t$2. Under tested reflected inputs, Cloud-RAIN reports $R_0x+t$3 drop in mAcc and mIoU, including arbitrary-plane reflection when PCA and quadratic aggregation are combined (Cui et al., 2023).

A third 3D line abandons dataset training entirely. A self-supervised model optimizes on a single input object represented as a point cloud $R_0x+t$4, initially with $R_0x+t$5 points and $R_0x+t$6 points sampled per iteration. Multi-view renders are generated using Fibonacci sampling, each view is rotated by $R_0x+t$7, DINOv2 Small extracts $R_0x+t$8-D patch features, those are reduced to $R_0x+t$9 dimensions via PCA, and a PointNet-based symmetry generator predicts one or more plane normals. Reflection uses the Householder transform

$S_v$0

and matching uses a feature-augmented Chamfer distance over geometry and point features. The total loss is

$S_v$1

The reported ShapeNet results are SDE $S_v$2 and F-score $S_v$3, compared with Diffusion at $S_v$4 and $S_v$5, and E3Sym at $S_v$6 and $S_v$7 (Aguirre et al., 4 Mar 2025).

Taken together, these works broaden reflectional matching from explicit symmetry detection to counterpart supervision, invariant representation design, and test-time self-supervised optimization.

6. Broader mathematical and cross-domain uses of reflected matching

Some papers use the language of reflection and matching outside classical symmetry detection. Reflected Schrödinger Bridge Matching introduces a partially simulation-free framework for Schrödinger bridges with reflecting dynamics on bounded domains. The reference process is a reflected SDE

$S_v$8

and the learned drift regresses to a reflected bridge score involving $S_v$9. The paper reports negligible additional wall-clock time relative to non-reflected $\mathbf{t}$00-DSBM, together with in-domain guarantees. On MNIST $\mathbf{t}$01 EMNIST, $\mathbf{t}$02-DSBM reports MSD $\mathbf{t}$03 and FID $\mathbf{t}$04, whereas $\mathbf{t}$05-RSBM reports MSD $\mathbf{t}$06 and FID $\mathbf{t}$07. The same work emphasizes the out-of-bounds problem in non-reflected models: on MNIST/EMNIST, $\mathbf{t}$08 of generated samples had at least one invalid pixel (Häggbom et al., 3 Jul 2026).

Convex geometry uses a containment-based notion of reflectional matching. Minkowski chirality $\mathbf{t}$09 of a convex body $\mathbf{t}$10 is the smallest dilation factor needed to contain a reflected copy of $\mathbf{t}$11 across some $\mathbf{t}$12-dimensional affine subspace: $\mathbf{t}$13 Equivalently, it is the smallest $\mathbf{t}$14 such that for some translate $\mathbf{t}$15,

$\mathbf{t}$16

The paper proves

$\mathbf{t}$17

and in the planar case gives explicit optimal-axis characterizations for triangles and parallelograms, with $\mathbf{t}$18 as a tight upper bound in both families (Caragea et al., 17 Apr 2025).

Group theory uses “reflectional” in an algebraic sense. In symplectic groups, a matrix is $\mathbf{t}$19-reflectional if it can be written as a product of $\mathbf{t}$20 involutions. The paper proves that $\mathbf{t}$21 is $\mathbf{t}$22-reflectional for $\mathbf{t}$23, and $\mathbf{t}$24-reflectional when $\mathbf{t}$25 is even and $\mathbf{t}$26. Here “reflection” means involution, not geometric mirror symmetry in data (Nielsen, 3 Jun 2026).

Other cited works make the distinction explicit. The magnetohydrodynamics paper states that it is not about “reflectional matching” as a mathematical term in the combinatorial or pattern-matching sense; instead it studies spontaneous breaking of local reflectional symmetry in small-scale dynamos. The spectral-rigidity paper uses $\mathbf{t}$27-symmetry of strictly convex planar domains as a structural hypothesis for Robin spectral rigidity, rather than as an object-matching problem (Bershadskii, 2022, Hezari, 2016).

These broader usages delimit the scope of the term. In computer vision, geometry processing, and generative modeling, reflectional matching refers to correspondence or transport under reflection. In algebra, convex geometry, MHD, and spectral theory, reflectional structure may be present without a pointwise matching task.

7. Evaluation criteria, robustness, and recurrent limitations

Evaluation protocols vary with formulation. Point-set and shape methods typically assess reflected correspondence or plane recovery. The intrinsic spectral method reports correspondence rate and mesh rate on SCAPE and TOSCA (Qiao et al., 2019). RGB-D symmetry prediction evaluates a dense symmetry error

$\mathbf{t}$28

with correctness defined by $\mathbf{t}$29 (Shi et al., 2020). Dataset-free 3D symmetry detection uses Symmetry Distance Error and F-score over plane-normal thresholds $\mathbf{t}$30 (Aguirre et al., 4 Mar 2025). Image-plane methods commonly use precision-recall curves and $\mathbf{t}$31 scores, including CVPR2013-style true-positive counting, ICCV2017 evaluation, and SDRW max $\mathbf{t}$32 (Elawady et al., 2017, Seo et al., 2021).

Robustness claims also differ by domain. The intrinsic spectral method reports robustness to different topology and incomplete shapes with holes (Qiao et al., 2019). SymmetryNet emphasizes heavy occlusion, unseen object instances, novel object categories, and multi-symmetry composition, while also noting failure cases such as sphere-like symmetries, depth-direction ambiguity under severe view limitation, sensitivity to segmentation quality, and lack of support for hierarchical or nested symmetries (Shi et al., 2020). Cloud-RAIN is explicitly positioned against reflection data augmentation, with the claim that data augmentation helps but does not solve arbitrary-plane reflection invariance (Cui et al., 2023). The dataset-free single-object method assumes global reflectional symmetry, centroid-centered objects, and rigid reflections, and lists partial or occluded surfaces as future work (Aguirre et al., 4 Mar 2025).

Several misconceptions are directly addressed in the literature. Reflectional matching is not always the same as detecting an explicit mirror plane in Euclidean space: it may be an intrinsic self-homeomorphism on a manifold (Qiao et al., 2019), a set of pointwise correspondences supporting a plane hypothesis (Shi et al., 2020), or a reflected bridge target in a bounded state space (Häggbom et al., 3 Jul 2026). Conversely, not every use of “reflectional” in a title denotes matching in the correspondence sense, as the MHD and group-theoretic papers make clear (Bershadskii, 2022, Nielsen, 3 Jun 2026).

A consistent theme across the cited work is that reflectional matching becomes easier when the representation encodes the symmetry relation directly. Functional maps diagonalize intrinsic reflection into signs, polar matching convolution encodes valid angular pairings for each axis, counterpart supervision regularizes plane regression from RGB-D, quadratic aggregation removes sign ambiguity after PCA canonicalization, and reflected Schrödinger bridges absorb boundary constraints into the reference dynamics. This suggests that the principal design variable in reflectional matching is not merely the choice of optimizer, but the degree to which reflection is built into the representation, loss, or dynamics themselves.