Graph-Smooth Null-Space Representation (GSNR)

• GSNR is a framework for ill-posed inverse problems that explicitly models and regularizes the null-space component, ensuring measurement consistency in imaging tasks.
• It employs a range-null-space decomposition and introduces a null-restricted Laplacian to enforce graph-based smoothness solely on the unobserved portion of the signal.
• By learning a predictor for null-space coefficients and integrating into various solvers, GSNR achieves improved convergence and higher reconstruction quality in imaging applications.

Searching arXiv for the cited GSNR and related null-space graph papers to ground the article. Graph-Smooth Null-Space Representation (GSNR) is a framework for ill-posed linear inverse problems that models and regularizes only the component of the unknown signal lying in the null space of the sensing operator, rather than imposing a prior uniformly over the full signal. In its 2026 formulation, GSNR is developed for imaging tasks such as deblurring, compressed sensing, demosaicing, and super-resolution, where many reconstructions are measurement-consistent because the forward operator has a non-trivial null space (Gualdrón-Hurtado et al., 23 Feb 2026). The framework combines a range–null-space decomposition with graph-based smoothness, introducing a null-restricted Laplacian and a low-dimensional basis formed by the smoothest null-space graph modes. Earlier work on graph signal recovery over networks did not use the term GSNR, but established a closely related perspective in which recovery guarantees depend on a graph-adapted nullspace condition, linking sparse sampling, clustered graph signals, and total-variation minimization (Jung et al., 2017).

1. Formal problem setting and null-space decomposition

GSNR is formulated for the standard linear inverse problem

$$\mathbf{y}=\mathbf{H}\mathbf{x}^\ast+\boldsymbol{\omega},\qquad \boldsymbol{\omega}\sim\mathcal{N}(\mathbf{0},\sigma^2\mathbf{I}),$$

where $\mathbf{y}\in\mathbb{R}^m$ is the measurement, $\mathbf{x}^\ast\in\mathbb{R}^n$ is the unknown image, and $\mathbf{H}\in\mathbb{R}^{m\times n}$ is the sensing operator with $m\le n$ (Gualdrón-Hurtado et al., 23 Feb 2026). The central observation is that ill-posedness is governed by the null space

$$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$

since distinct signals can share the same measurements whenever they differ by a null-space component.

The framework uses the range-null-space decomposition

$$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$

with

$$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$

so that $\mathbf{x}_n$ is invisible to the measurements (Gualdrón-Hurtado et al., 23 Feb 2026). The conceptual claim of GSNR is that conventional priors such as sparsity, smoothness, and score-based priors act on the entire image rather than specifically on $\mathbf{x}_n$. The stated consequence is that such priors can regularize directions that are actually measured, leave null-space ambiguity unconstrained, and bias the solution toward a learned manifold rather than a null-space-consistent reconstruction (Gualdrón-Hurtado et al., 23 Feb 2026).

This separation between visible and invisible components is the defining feature of GSNR. A plausible implication is that GSNR should be interpreted less as a generic image prior than as a null-space-specific structural model embedded within a broader inverse-problem solver.

2. Graph formulation and the null-restricted Laplacian

GSNR uses a graph $\mathbf{y}\in\mathbb{R}^m$0 with weighted adjacency matrix $\mathbf{y}\in\mathbb{R}^m$1 to encode image geometry (Gualdrón-Hurtado et al., 23 Feb 2026). The unnormalized graph Laplacian is

$\mathbf{y}\in\mathbb{R}^m$2

with Dirichlet energy

$\mathbf{y}\in\mathbb{R}^m$3

This quantity penalizes variation across strongly connected pixels. The paper considers graph topologies such as 4-nearest-neighbor (4NN) and 8-nearest-neighbor (8NN) grids, and also discusses normalized Laplacians in the appendix (Gualdrón-Hurtado et al., 23 Feb 2026).

The central GSNR operator is the null-restricted Laplacian

$\mathbf{y}\in\mathbb{R}^m$4

This operator is the decisive structural modification relative to conventional graph regularization: smoothness is enforced only after projection into the null space, and the result is projected back into the null space (Gualdrón-Hurtado et al., 23 Feb 2026). The paper characterizes $\mathbf{y}\in\mathbb{R}^m$5 as an operator that “highlights where the graph variation falls into the null space” and avoids regularizing the observed range component.

This construction distinguishes GSNR from whole-signal graph priors. In a whole-image Laplacian penalty, visible and invisible directions are treated jointly. In GSNR, the regularizer is null-aware by design. This suggests that the framework is tailored to the geometry of measurement ambiguity, not merely to image smoothness in isolation.

3. Low-dimensional null-space representation and coefficient prediction

GSNR derives a low-dimensional basis by eigendecomposing the null-restricted Laplacian,

$\mathbf{y}\in\mathbb{R}^m$6

and selecting the first $\mathbf{y}\in\mathbb{R}^m$7 smoothest modes (Gualdrón-Hurtado et al., 23 Feb 2026). The projection matrix is

$\mathbf{y}\in\mathbb{R}^m$8

so that

$\mathbf{y}\in\mathbb{R}^m$9

Thus $\mathbf{x}^\ast\in\mathbb{R}^n$0 contains the coefficients of the null-space component in the smoothest graph modes.

The framework further introduces a predictor $\mathbf{x}^\ast\in\mathbb{R}^n$1 trained to estimate these coefficients from the measurements: $\mathbf{x}^\ast\in\mathbb{R}^n$2 This means that GSNR is not only a handcrafted spectral truncation of the null space; it also learns a measurement-to-null-coefficient map from data (Gualdrón-Hurtado et al., 23 Feb 2026). In the reported experiments, the learned predictor $\mathbf{x}^\ast\in\mathbb{R}^n$3 is implemented with a U-Net, while the smoothest eigenvectors are computed offline using ARPACK/eigsh (Gualdrón-Hurtado et al., 23 Feb 2026).

A useful way to interpret this construction is as a graph-adapted latent coordinate system for the invisible component of the inverse problem. The paper itself does not describe it in representation-learning terms, but this suggests a bridge between classical graph regularization and latent null-space parameterization.

4. Reconstruction objective, convergence role, and solver integration

The GSNR reconstruction objective is

$\mathbf{x}^\ast\in\mathbb{R}^n$4

where $\mathbf{x}^\ast\in\mathbb{R}^n$5 is the data fidelity term, $\mathbf{x}^\ast\in\mathbb{R}^n$6 is a generic prior or denoiser prior, the third term enforces learned null-space matching, and the fourth is the graph regularizer acting only in the null space (Gualdrón-Hurtado et al., 23 Feb 2026).

For PnP-PGD, the paper gives the update

$\mathbf{x}^\ast\in\mathbb{R}^n$7

and also the GSNR-augmented PnP-PGD step

$\mathbf{x}^\ast\in\mathbb{R}^n$8

followed by denoising,

$\mathbf{x}^\ast\in\mathbb{R}^n$9

The effective system matrix is

$\mathbf{H}\in\mathbb{R}^{m\times n}$0

and the paper states that the null-only regularizer improves conditioning and yields a contraction bound

$\mathbf{H}\in\mathbb{R}^{m\times n}$1

The stated mechanism is that $\mathbf{H}\in\mathbb{R}^{m\times n}$2 acts where $\mathbf{H}\in\mathbb{R}^{m\times n}$3 is weak, lifts null directions, and reduces ill-conditioning, mostly improving transient convergence and sometimes the final fixed point (Gualdrón-Hurtado et al., 23 Feb 2026).

GSNR is designed to be plug-compatible with multiple inverse-problem solvers. The paper reports integration into PnP, DIP, and diffusion-based solvers including DPS, DiffPIR, and latent diffusion / MPGD variants (Gualdrón-Hurtado et al., 23 Feb 2026). In diffusion-based methods, GSNR adds

$\mathbf{H}\in\mathbb{R}^{m\times n}$4

to the guidance or proximal objective, with the stated purpose of steering the diffusion model along graph-smooth null-space directions rather than allowing arbitrary hallucination (Gualdrón-Hurtado et al., 23 Feb 2026).

5. Coverage, predictability, and optimality of smooth null modes

A major theoretical contribution of GSNR is the analysis of how well a small number of null-space graph modes capture and predict the invisible component (Gualdrón-Hurtado et al., 23 Feb 2026). The paper defines coverage as

$\mathbf{H}\in\mathbb{R}^{m\times n}$5

where $\mathbf{H}\in\mathbb{R}^{m\times n}$6 are the eigenvalues of the null-space covariance expressed in the $\mathbf{H}\in\mathbb{R}^{m\times n}$7-eigenbasis. Under a GMRF prior with precision

$\mathbf{H}\in\mathbb{R}^{m\times n}$8

the null-space covariance has spectral form

$\mathbf{H}\in\mathbb{R}^{m\times n}$9

Theorem 1 states

$m\le n$0

meaning that graph Laplacians cover null-space variance better than the geometry-free identity choice $m\le n$1; for $m\le n$2, the paper gives

$m\le n$3

The paper also states a minimax optimality result over the null-space ellipsoid

$m\le n$4

namely

$m\le n$5

achieved by the smoothest $m\le n$6 modes (Gualdrón-Hurtado et al., 23 Feb 2026). This identifies the first $m\le n$7 eigenvectors of $m\le n$8 as the best $m\le n$9-dimensional approximation basis for null-space signals under graph energy.

Predictability is treated separately. For a null coefficient $$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$0, the paper bounds the optimal linear predictor’s $$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$1 by

$$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$2

where

$$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$3

The interpretation given in the paper is that smaller $$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$4 corresponds to smoother modes, smoother null modes are more predictable, and for $$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$5 the coupling vanishes so predictability collapses: $$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$6 The paper additionally defines empirical predictability of the learned predictor as

$$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$7

Taken together, these results formalize three linked claims: smooth null-space graph modes capture more null variance, provide a minimax-optimal low-dimensional approximation, and are more predictable from measurements than geometry-free alternatives (Gualdrón-Hurtado et al., 23 Feb 2026).

6. Empirical performance, applications, and implementation constraints

The 2026 GSNR paper evaluates deblurring, compressed sensing, demosaicing, and super-resolution (Gualdrón-Hurtado et al., 23 Feb 2026). The reported inverse-problem settings include $$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$8 for deblurring with 2D Gaussian blur and $$Null(\mathbf{H})=\{\mathbf{x}\in\mathbb{R}^n:\mathbf{H}\mathbf{x}=0\},$$9, Hadamard-based sensing using the first 10% rows for compressed sensing, CelebA resized to $$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$0 with Bayer pattern for demosaicing, and $$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$1 with SR factor 4 for super-resolution.

The paper reports consistent gains across these tasks. For deblurring, baseline PnP-PGD yields around 31.58 / 30.78 / 35.26 / 33.64 dB depending on dataset and denoiser, NPN yields 33.22–37.86 dB, and GSNR with $$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$2 reaches up to 33.60–38.18 dB; on DIV2K cross-dataset evaluation, baseline gives 31.23 / 30.39, NPN gives 33.05 / 32.90, and GSNR gives 33.69 / 33.65 (Gualdrón-Hurtado et al., 23 Feb 2026). For demosaicing, the table reports baseline 39.35 / 27.91, NPN 39.77 / 30.12, GSNR-$$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$3NN 39.79–39.89 / 30.13–30.14, and GSNR-$$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$4NN 39.77–39.88 / 30.27. For super-resolution, the table reports PnP 27.37 dB, NPN 29.21 dB, GSNR-$$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$5NN 29.42 dB, and GSNR-$$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$6NN 29.38 dB. The paper also states improvements of up to 4.3 dB over baseline formulations and up to 1 dB over end-to-end learned models in some settings, with smaller but consistent gains for diffusion-based solvers such as 30.19 → 30.31 and 30.19 → 30.48, and up to 0.78 dB for latent-space diffusion MPGD (Gualdrón-Hurtado et al., 23 Feb 2026).

For compressed sensing, the reported emphasis is not a single PSNR table but the observation that graph-based GSNR gives better coverage and higher predictability than the identity/null-only baseline, improving reconstruction with smaller $$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$7 (Gualdrón-Hurtado et al., 23 Feb 2026).

The paper also identifies explicit assumptions and limitations. It requires knowledge of the sensing matrix $$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$8, is currently formulated for linear inverse problems, and can suffer performance drops under forward-model mismatch, although GSNR still helps (Gualdrón-Hurtado et al., 23 Feb 2026). The eigendecomposition of $$\mathbf{x}=\mathbf{x}_r+\mathbf{x}_n,\qquad \mathbf{x}_r=\mathbf{P}_r\mathbf{x},\quad \mathbf{x}_n=\mathbf{P}_n\mathbf{x},$$9 can be computationally expensive at large scale, the graph $$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$0 is hand-crafted in the reported work, and learning $$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$1 is suggested as future work. Implementation is structured to avoid dense matrix formation: $$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$2 The paper reports that offline EVD cost grows with image size, but online inference overhead remains modest (Gualdrón-Hurtado et al., 23 Feb 2026).

7. Relation to network nullspace theory and broader graph-signal models

The earlier paper “The Network Nullspace Property for Compressed Sensing of Big Data over Networks” studies a different problem class—recovery of graph signals from sparse node samples via total-variation minimization—but provides an important conceptual precursor for GSNR-style thinking (Jung et al., 2017). In that setting, a weighted graph

$$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$3

supports a graph signal $$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$4, and recovery is posed as

$$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$5

with graph total variation

$$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$6

The key signal model is the clustered or piecewise constant graph signal

$$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$7

where $$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$8 is a partition of the nodes into clusters (Jung et al., 2017).

The main object in that paper is the network nullspace property relative to $$\mathbf{P}_n=\mathbf{I}-\mathbf{H}^{\dagger}\mathbf{H},\quad \mathbf{P}_r=\mathbf{H}^{\dagger}\mathbf{H},$$9, denoted NNSP-$\mathbf{x}_n$0. For a sampling set $\mathbf{x}_n$1, the sampling nullspace is

$\mathbf{x}_n$2

and NNSP-$\mathbf{x}_n$3 requires that for every sign pattern on the cluster boundary edges there exists a flow satisfying vanishing node demands outside the sample set, boundary-edge flow magnitude $\mathbf{x}_n$4 with $\mathbf{x}_n$5, and capacity constraints on non-boundary edges (Jung et al., 2017). The exact-recovery theorem states that if the signal is clustered on $\mathbf{x}_n$6 and $\mathbf{x}_n$7 satisfies NNSP-$\mathbf{x}_n$8, then the TV-minimization problem has a unique solution equal to the true signal. For approximately clustered signals, if NNSP-$\mathbf{x}_n$9 holds with $\mathbf{x}_n$0, the paper gives the stability bound

$\mathbf{x}_n$1

The relationship between this 2017 theory and GSNR is one of conceptual continuity rather than identity. The 2017 work does not use the term GSNR explicitly and is not spectral; it emphasizes combinatorial network connectivity, flows, and sampling geometry rather than Laplacian null-mode parameterization (Jung et al., 2017). Yet both frameworks exploit graph-adapted structure in a nullspace setting. The 2017 theory links recovery to how sampling interacts with graph topology and cluster boundaries; the 2026 GSNR framework links reconstruction quality to how graph smoothness structures the invisible component of an ill-posed linear operator (Gualdrón-Hurtado et al., 23 Feb 2026, Jung et al., 2017).

A common misconception is that GSNR is simply another global graph-smoothing prior. The defining distinction is that GSNR regularizes only $\mathbf{x}_n$2, whereas classical graph priors and the earlier network-TV theory operate on the full signal under different recovery principles (Gualdrón-Hurtado et al., 23 Feb 2026, Jung et al., 2017). Another possible misconception is to treat GSNR as primarily spectral in the generic graph-Fourier sense. The paper’s claims are more specific: the retained modes are those of the null-restricted Laplacian $\mathbf{x}_n$3, not of $\mathbf{x}_n$4 alone (Gualdrón-Hurtado et al., 23 Feb 2026).

In this sense, GSNR occupies a distinct position at the intersection of inverse problems, graph signal processing, and null-space-aware regularization. It reframes reconstruction around the proposition that the measured component should be preserved by data fidelity, while the ambiguous component should be modeled separately through graph-smooth null-space structure (Gualdrón-Hurtado et al., 23 Feb 2026).