---
title: Radon Cumulative Distribution Transform (R-CDT)
url: https://www.emergentmind.com/topics/radon-cumulative-distribution-transform-r-cdt
type: topic
---

# Radon Cumulative Distribution Transform (R-CDT)

The Radon Cumulative Distribution Transform (R-CDT) is a nonlinear, invertible image representation formed by coupling the classical Radon transform with the one-dimensional cumulative distribution transform (CDT) along each projection angle. This transform provides a low-level, closed-form feature extraction method that enables linear separability of image classes generated via mass-preserving deformations, translations, scalings, and certain broader transformation models. R-CDT is closely related to the sliced Wasserstein metric and has seen accelerated theoretical and algorithmic development extending to normalizations for affine invariance, signed-data transforms, and generalizations to non-Euclidean domains. Its main application lies in image and signal classification, especially in regimes of small or corrupted data, where it yields significant advantages in separability, label-efficiency, and computational complexity over conventional methods [1511.03206, 2004.03669, 2411.16282, 2506.08761, 2512.08099].

## 1. Mathematical Formulation and Core Principles

The R-CDT for an image $f(x, y)$ defined on $\mathbb{R}^2$ proceeds in two main steps:

1. **Radon Transform**: The image is projected along lines parameterized by angle $\theta$ and distance $t$,
   $$
   R[f](t, \theta) = \int_{\mathbb{R}^2} f(x, y)\, \delta(x\cos\theta + y\sin\theta - t)\, dx\, dy
   $$
   producing a family of 1D signals $R[f](\cdot, \theta)$ ("sinograms").

2. **Cumulative Distribution Transform (CDT) Along Each Angle**: For a chosen positive reference projection $I_0(\cdot, \theta)$,
   let $F(\cdot)$ and $F_0(\cdot)$ denote their CDFs. The monotone map $f(t, \theta)$ satisfying
   $$
   \int_{-\infty}^{f(t, \theta)} R[f](\tau, \theta)\, d\tau = \int_{-\infty}^{t} R[I_0](\tau, \theta)\, d\tau
   $$
   is computed for each $\theta$. The R-CDT representation is then
   $$
   \tilde{I}(t, \theta) = (f(t, \theta) - t)\sqrt{I_0(t, \theta)}
   $$
   The inverse is explicit: invert the 1D CDT for each projection, then apply analytic or discrete filtered backprojection for the Radon inverse [1511.03206, 2304.14883].

Invertibility is guaranteed provided all 1D projections are strictly positive, ensuring monotonicity in $f$, and the Radon transform is invertible under standard decay/support conditions. The R-CDT is inherently nonlinear, as $f$ arises from a nonlinear CDF-matching condition per $\theta$.

## 2. Geometric and Theoretical Properties

### 2.1 Linearization of Image Transforms

R-CDT linearizes classes of transport and geometric operations:

- **Translations**: If $J(x, y) = f(x - x_0, y - y_0)$, then
  $$
  \tilde{J}(t, \theta) = \tilde{I}(t, \theta) + (x_0\cos\theta + y_0\sin\theta)\sqrt{I_0(t, \theta)}
  $$
- **Isotropic Scalings**: $J(x, y) = \alpha^2 f(\alpha x, \alpha y)$ implies
  $$
  \tilde{J}(t, \theta) = \tfrac{1}{\alpha}\tilde{I}(t, \theta) + \tfrac{1-\alpha}{\alpha}\sqrt{I_0(t, \theta)}
  $$
- **Rotations**: For rotations by angle $\varphi$ and circularly symmetric $I_0$, $\tilde{J}(t, \theta) = \tilde{I}(t, \theta - \varphi)$ [1511.03206, 2004.03669].

### 2.2 Connection to Sliced Wasserstein Distance

The R-CDT space is isometric to the sliced Wasserstein-2 metric:
$$
SW_2^2(f, g) = \int_0^{\pi} \int_{-\infty}^{\infty} \bigl(\tilde{I}_f(t, \theta) - \tilde{I}_g(t, \theta)\bigr)^2 I_0(t, \theta)\, dt\, d\theta
$$
where $I_0$ acts as a weighting determined by the reference [2004.03669, 2506.08761].

### 2.3 Linear Separability and Convexification

A key theorem asserts that when image classes are constructed via mass-preserving deformations (satisfying closure, convexity, and non-intersection conditions), their R-CDT representations are linearly separable in $L^2(\theta, t)$, independent of the reference image [1511.03206]. Translation and scaling variabilities become additive (thus linearly separable) in R-CDT coordinates.

## 3. Normalized and Generalized R-CDT Variants

### 3.1 Max-Normalized and Mean-Normalized R-CDT

Plain R-CDT is not invariant to arbitrary affine transformations. To address this, a two-step normalization is implemented:

1. **Zero-mean and unit-variance normalization**:
   $$
   N[f](t, \theta) = \frac{\tilde{I}(t, \theta) - m(\theta)}{s(\theta)}
   $$
   with $m(\theta)$ and $s(\theta)$ the mean and standard deviation over $t$ for each angle.

2. **Angular Aggregation**: By taking the pointwise maximum (max-normalization, mNRCDT) or angular mean (aNRCDT), affine invariance is achieved:
   $$
   \mathrm{mNRCDT}[f](t) = \sup_{\theta\in S^1} N[f](t, \theta)
   $$
   $$
   \mathrm{aNRCDT}[f](t) = \int_{S^1} N[f](t, \theta)\, d\theta
   $$
These produce feature sets with provable invariance to affine transforms and robustness to certain non-affine deformations, with stability controlled by Wasserstein metrics [2411.16282, 2506.08761, 2512.08099].

### 3.2 Generalized Aggregation for Group Invariance

Beyond max or mean pooling, any aggregator $h : L^\infty(S^1) \to \mathbb{R}$ that is permutation-invariant and boundedness-preserving yields an $h$-normalized R-CDT with similar invariance and linear separability properties. This approach generalizes the R-CDT to multi-dimensional (e.g., $\mathbb{R}^d$) and non-Euclidean spaces (e.g., $SO(3)$ with generalized Radon transforms) [2512.08099]. The effect is that all class members under group transformations collapse to single feature representations, ensuring perfect linear separability if the respective template features are distinct.

### 3.3 Signed R-CDT

The standard R-CDT presumes nonnegative, mass-normalized (i.e., probability measure) data. The signed R-CDT (RSCDT) generalizes to arbitrary images $s(x, y)$ via Jordan decomposition $s = s^+ - s^-$, applying the CDT independently to $s^+$ and $s^-$ and tracking their respective $L^1$ norms. The feature representation is then a tuple over $(t, \theta)$ of positive/negative CDT-transforms and norms, and in the aggregate yields an isometric embedding for the so-called signed-sliced Wasserstein metric [2307.15339].

## 4. Computational Algorithms and Complexity

A typical algorithmic pipeline for R-CDT-based analysis involves:

1. Normalizing input images to unit mass.
2. Computing discrete sinograms (Radon projections) over $M$ angles using nearest-neighbor or B-spline interpolation.
3. For each $\theta$:
   - Estimating empirical CDFs for both image and reference projections;
   - Solving for the unique map $f(\cdot, \theta)$ via monotone interpolation or sorting;
   - Constructing R-CDT slices as above.
4. (Optional) Performing two-step normalization for affine invariance.
5. For inversion, reconstructing projections using inverse 1D CDT, followed by standard filtered backprojection.

The computational complexity per image is typically $O(MN^2)$ for $N \times N$ images and $M$ projection angles, matching that of the Ridgelet transform. Discretization artifacts arise at sharp discontinuities and can be mitigated by smoothing, zero-padding, or post-processing [1511.03206, 2304.14883].

## 5. Applications in Machine Learning, Classification, and Model Reduction

### 5.1 Image Classification

R-CDT features, flattened and optionally PCA-pruned, serve as input for linear or kernel-based classifiers (e.g., SVMs). Performance gains over pixel or conventional feature representations are substantial, particularly in regimes with limited data, strong geometric variability, or affine distortions. For small-sample or small-data settings, max-normalized or mean-normalized R-CDT variants achieve near-perfect or perfect separability for classes generated by affine transformations [2004.03669, 2411.16282, 2506.08761, 2512.08099].

Empirical results span multiple domains:

- **Facial expression and illumination-invariant face recognition**: Nearest-subspace in local R-CDT domains achieves competitive or state-of-the-art accuracy under substantial lighting or pose changes [2202.10642].
- **Medical and biological imaging**: Significantly improved classification of pathological versus benign cell morphologies, outperforming standard deep nets on small annotated datasets [2004.03669, 1511.03206].
- **Watermark recognition and filigranology**: R-CDT-based recognition maintains performance under nontrivial affine measurement distortions [2411.16282, 2506.08761].
- **Handwritten character classification**: With extremely limited training data, normalized R-CDT features enable accurate nearest-template or nearest-neighbor classification of characters and digits under broad affine and local deformations [2411.16282, 2512.08099].

### 5.2 Reduced-Order Modeling for Advection-Dominated Systems

In high-dimensional dynamical systems governed by advection and transport, the physical-domain solution manifold is characteristically non-linear and poorly suited for linear model reduction (e.g., POD). R-CDT linearizes the effect of transport, enabling rapid decay of singular values in R-CDT space. POD applied in R-CDT space yields low-rank subspaces accurately capturing traveling features with drastically fewer modes, and supports accurate interpolation tasks that fail in the physical variable domain [2304.14883].

### 5.3 Subspace Modeling and Robustness

Nearest-subspace and subspace modeling in R-CDT coordinates exploit the isometric embedding properties of the transform. Classes generated by smooth or mass-preserving transformations of templates produce low-dimensional or even one-dimensional subspaces in R-CDT space, yielding robust classification and favorable out-of-distribution generalization properties, with strong empirical performance for few-shot learning [2004.03669, 2512.08099].

## 6. Limitations, Extensions, and Current Challenges

While R-CDT offers a suite of theoretical and computational guarantees, several limitations and frontiers persist:

- **Discretization**: Nonlinear artifacts and errors are introduced around sharp fronts and edges, which can be partially mitigated by smoothing, padding, or median filtering but are not completely eliminated in current implementations [2304.14883].
- **Reference Dependence**: Numerical stability and feature scaling can be sensitive to the choice of reference measure or image, despite theoretical separability being reference-invariant [1511.03206].
- **Applicability Domain**: R-CDT is best suited to problems where critical image deformations are transport-like and classes are generated by deformations of prototypes; natural imagery with highly non-template-structured variability yields diminished gains relative to deep convolutional approaches [2004.03669].
- **Extension to Non-Euclidean, Signed, and High-Dimensional Data**: Generalized and normalized R-CDT methods extend the original theory to signed-data, multi-dimensional settings, and non-Euclidean manifolds, with ongoing work regarding the computational tractability and representation power in these contexts [2307.15339, 2512.08099].
- **Scalability and Integration**: Current algorithms operate efficiently for moderate grid and angle sizes but further acceleration, discrete versions, and scalable implementations suitable for large-scale vision and physical simulation are active research areas [1511.03206, 2512.08099].

## 7. Summary Table: Core R-CDT Variants and Properties

| Variant           | Domain      | Invariance                             | Key Reference                                   |
|-------------------|-------------|----------------------------------------|-------------------------------------------------|
| Plain R-CDT       | $\mathbb{R}^2$ (maps to $L^2$ sinogram) | Translation, scaling, some rotation          | [1511.03206], [2004.03669]                      |
| mNRCDT / aNRCDT   | $\mathbb{R}^2$ (aggregated over angles) | Full affine (mNRCDT), partial affine (aNRCDT) | [2506.08761], [2411.16282], [2512.08099]        |
| Signed R-CDT      | Signed images   | Deformations, sign-preserving          | [2307.15339]                                    |
| Generalized R-CDT | $\mathbb{R}^d$, $SO(3)$, etc.           | Affine/group invariance under defined $h$     | [2512.08099]                                    |
| Local R-CDT       | Patchwise gradients on images           | Local affine (illumination)                  | [2202.10642]                                    |

Key: mNRCDT (max), aNRCDT (mean aggregation); h-normalized allows custom aggregation; $L^2$ denotes the normed function space used for classification measures.

---

R-CDT and its normalized and generalized variants offer a mathematically grounded, invertible, and computationally tractable framework for feature extraction and classification, robustly addressing geometric and structural image variability beyond the capacity of linear transforms and standard finite-dimensional embeddings [1511.03206, 2506.08761, 2512.08099].

Source: https://www.emergentmind.com/topics/radon-cumulative-distribution-transform-r-cdt