Real-world image pairs often exhibit both severe degradations and large viewpoint changes, making image restoration and geometric matching mutually interfering tasks when treated independently. In this work, we propose MatRes, a zero-shot test-time adaptation framework that jointly improves restoration quality and correspondence estimation using only a single low-quality and high-quality image pair. By enforcing conditional similarity at corresponding locations, MatRes updates only lightweight modules while keeping all pretrained components frozen, requiring no offline training or additional supervision. Extensive experiments across diverse combinations show that MatRes yields significant gains in both restoration and geometric alignment compared to using either restoration or matching models alone. MatRes offers a practical and widely applicable solution for real-world scenarios where users commonly capture multiple images of a scene with varying viewpoints and quality, effectively addressing the often-overlooked mutual interference between matching and restoration.
Figures & tables
Figure 2: Method Overview. Given an input pair (ILQ,IHQ) , the pretrained generative prior model Mθ and the pretrained restoration network Rϕ remain frozen during adaptation (gradient flows through both models but their parameters are not updated). The zero-initialized adapter Hψ is the only trainable module, refined iteratively using losses computed on the IEQ and IHQ image pairs. At each adaptation step, Mθ extracts generative priors and estimates the transformation TLQ→HQ , the ILQ image are warped and injected into Rϕ , and the adapter Hψ learns to align and modulate features for improved restoration.
Figure 3: Qualitative Restoration Results. Restoration performance is compared with and without the matching network Mθ across three tasks. For super-resolution (SR), we evaluate EDSR [ 33 ] , ESRGAN [ 45 ] , SwinIR [ 32 ] , and HAT [ 46 ] ; for denoising, we evaluate DnCNN [ 47 ] , N2V [ 35 ] , N2N [ 34 ] , and Restormer [ 31 ] ; and for deblurring, we evaluate DeblurGAN [ 36 ] , SRN [ 37 ] , Restormer [ 31 ] , and NAFNet [ 48 ] . The green box indicates the zoomed-in region.
Figure 4: Qualitative Matching Results. Geometric transform estimation results for five matching networks (LoftUp [ 26 ] , ART [ 27 ] , DIFT [ 28 ] , RoMa [ 29 ] , Mast3R [ 30 ] ) across SR, denoising, and deblurring tasks, is evaluated with and without the restoration network Rϕ . The green box denotes the ground-truth transform, while the red box represents the estimated transform.
Task
Matcher ( M )
Restorator ( R )
Matching score
Restoration score
mAUC (w/o R )
mAUC (w/ R )
PSNR (w/o M )
PSNR (w/ M )
SSIM (w/o M )
SSIM (w/ M )
SR
RoMa [ 29 ]
EDSR [ 33 ]
27.00
36.60 ( +9.61 )
26.93
31.72 ( +4.80 )
0.531
0.747 ( +0.216 )
ESRGAN [ 45 ]
24.46
33.39 ( +8.93 )
26.40
31.53 ( +5.12 )
0.505
0.823 ( +0.317 )
SwinIR [ 32 ]
30.66
34.36 ( +3.70 )
24.73
28.28 ( +3.55 )
0.497
0.688 ( +0.191 )
HAT [ 46 ]
27.46
31.79 ( +4.33 )
26.45
29.87 ( +3.42 )
0.534
0.716 ( +0.183 )
ART [ 27 ]
EDSR [ 33 ]
27.65
35.93 ( +8.28 )
24.80
29.34 ( +4.54 )
0.527
0.670 ( +0.143 )
Table 1: Experimental Results for Super-Resolution, Denoising, and Deblurring Tasks
Task
Dataset
Restoration Score (PSNR / SSIM)
Methods:
MatRes (ours)
AutoLUT [ 59 ]
CATANet [ 60 ]
IM-LUT [ 61 ]
SR
RealSR [ 49 ]
34.87 / 0.902
33.59 / 0.864
32.70 / 0.839
30.66 / 0.777
DIV2K [ 50 ]
32.78 / 0.758
31.86 / 0.733
34.72 / 0.801
32.04 / 0.700
Set5 [ 51 ]
33.31 / 0.742
33.98 / 0.779
31.51 / 0.700
30.39 / 0.700
Set14 [ 52 ]
35.01 / 0.941
34.02 / 0.917
33.54 / 0.899
35.86 / 0.962
Urban100 [ 53 ]
35.82 / 0.776
34.23 / 0.758
31.69 / 0.700
31.80 / 0.732
Table 2: Restoration score comparison across different tasks.
Task
Dataset
Matching Score (mAUC)
MatRes (ours)
MINIMA [ 68 ]
DenseAffine [ 69 ]
MatchAnything [ 70 ]
SR
RealSR [ 49 ]
34.85
24.99
26.06
29.60
DIV2K [ 50 ]
32.07
21.41
26.38
26.62
Set5 [ 51 ]
31.38
23.18
23.92
25.05
Set14 [ 52 ]
34.31
27.98
27.38
26.66
Urban100 [ 53 ]
35.88
27.77
27.14
31.51
Table 3: Matching score comparison across different tasks.
Pre-trained image restoration models often fail on out-of-distribution (OOD) real-world degradations. Adapting to these domains is challenging as real-world data lacks paired ground truth, and unsupervised methods often require unstable architectural changes. We propose Generative Manifold Distillation (GMD), which reframes domain adaptation as geometric manifold alignment. GMD operates in a strictly unpaired setting, requiring only low-quality (LQ) target observations. By leveraging the flow-matching dynamics of a frozen text-to-image foundation model, GMD projects off-manifold restorations onto the natural image manifold to generate high-quality pseudo-targets. To ensure stability, a quality-gated manifold filter rejects off-manifold samples, while source-anchored trajectory regularization prevents error accumulation. Ultimately, GMD distills a powerful generative prior into an efficient restoration network. Experiments demonstrate that GMD seamlessly adapts to new distributions using only LQ inputs, drastically improving perceptual quality with zero architectural modifications or added inference latency.
Zero-shot image restoration provides a flexible way to handle diverse degradations without task-specific training. However, existing methods typically rely on stacked layers or pre-trained features to enhance degradation expression, while overlooking physically consistent priors. The insufficient degradation prompts impose the heavy training burden and high sampling costs during zero-shot diffusion. Moreover, the fixed inference trajectory often collapses to suboptimal solutions under complex corruptions. We observe that heterogeneous degradations can be reparameterized into a minimal set of physically coherent parameters for compact representation. Based on this insight, we first propose a unified physical zero-shot image restoration (UP-ZeroIR) framework that explicitly models heterogeneous degradations into a homogeneous all-in-one distribution. The distribution can be optimized directly in the latent space, enabling principled solution exploration and effective prompt adaptation. Besides, we introduce a dynamic quality-refinement strategy that adaptively adjusts the diffusion trajectory for robust globally optimal convergence. Extensive experiments demonstrate that our method achieves state-of-the-art performance across both single and mixed degradations. Our code is available at https://github.com/yangjinglyy/UP-ZeroIR
Dense correspondence matching has historically been bounded by simplifying spatio-temporal priors, such as smooth motion and rigid geometry. While effective for classical tasks, these assumptions break down in image editing and reference-guided generation (IEG), where transformations can preserve visual identity while breaking physical continuity. To establish identity-preserving correspondence across such transformations, we introduce FreeMatching, a generalizable framework combining generative and semantic foundation representations with heterogeneous supervision from classical datasets, tracked videos, and synthetic scenes. Teacher-guided iterative refinement further improves correspondence in IEG without dense correspondence annotations. Experimentally, a single FreeMatching model substantially improves correspondence quality on challenging IEG image pairs while retaining competitive performance on classical benchmarks. Furthermore, we demonstrate its utility as a quantitative metric for evaluating identity preservation, with scores that correlate with human judgment. The code is available at https://github.com/luping-liu/FreeMatching.
Luping Liu, Bingyi Kang, Yifan Wang +1
The University of Hong Kong · ByteDance Seed · Zhejiang University