This content will become publicly available on August 1, 2027

Title: MG-SpaIR: Multi-Grade Sparse-Guided Implicit Representation for Training-Data-Free Image Restoration
MG-SpaIR is a training-data-free framework for restoring a clean image from a single observation corrupted by a mixture of blur, downsampling, noise, and missing pixels. Building on implicit neural representations (INRs), we introduce a multi-grade residual hierarchy that progressively refines the reconstruction from low to high spatial frequencies across grades, improving representational fidelity and mitigating spectral limitations. To stabilize reconstruction optimization and suppress INR-induced artifacts, we further propose an explicit sparse proximal regularization (e.g.,$$\ell _0$$ ℓ0 type) applied directly in the high-resolution image domain, which discourages spurious high-frequency patterns while preserving sharp structures. The resulting optimization is solved efficiently via a multi-grade proximal alternating scheme, and we establish convergence guarantees for the associated updates under standard regularity conditions. Experiments on mixed-degradation benchmarks demonstrate that MG-SpaIR consistently outperforms strong training-data-free baselines such as Deep Image Prior, providing a stable, interpretable, and data-efficient alternative to conventional learning-based restoration methods.  more » « less
Award ID(s):
2208385 2208386
PAR ID:
10703153
Author(s) / Creator(s):
; ; ; ; ;
Publisher / Repository:
Springer Nature
Date Published:
Journal Name:
Journal of Mathematical Imaging and Vision
Volume:
68
Issue:
4
ISSN:
0924-9907
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract A graphGisH-freeif it has no induced subgraph isomorphic toH. We prove that a$$P_5$$ P5 -free graph with clique number$$\omega \ge 3$$ ω≥3 has chromatic number at most$$\omega ^{\log _2(\omega )}$$ ω log2(ω) . The best previous result was an exponential upper bound$$(5/27)3^{\omega }$$ (5/27)3ω , due to Esperet, Lemoine, Maffray, and Morel. A polynomial bound would imply that the celebrated Erdős-Hajnal conjecture holds for$$P_5$$ P5 , which is the smallest open case. Thus, there is great interest in whether there is a polynomial bound for$$P_5$$ P5 -free graphs, and our result is an attempt to approach that. 
    more » « less
  2. Variational approaches are among the most powerful techniques toapproximately solve quantum many-body problems. These encompass bothvariational states based on tensor or neural networks, and parameterizedquantum circuits in variational quantum eigensolvers. However,self-consistent evaluation of the quality of variational wavefunctionsis a notoriously hard task. Using a recently developed Hamiltonianreconstruction method, we propose a multi-faceted approach to evaluatingthe quality of neural-network based wavefunctions. Specifically, weconsider convolutional neural network (CNN) and restricted Boltzmannmachine (RBM) states trained on a square latticespin-1/2 1/2 J_1\!-\!J_2 J1−J2 Heisenberg model. We find that the reconstructed Hamiltonians aretypically less frustrated, and have easy-axis anisotropy near the highfrustration point. In addition, the reconstructed Hamiltonians suppressquantum fluctuations in the largeJ_2 J2 limit. Our results highlight the critical importance of thewavefunction’s symmetry. Moreover, the multi-faceted insight from theHamiltonian reconstruction reveals that a variational wave function canfail to capture the true ground state through suppression of quantumfluctuations. 
    more » « less
  3. Abstract When given a generalized matrix separation problem, which aims to recover a low rank matrix$$L_0$$ L0 and a sparse matrix$$S_0$$ S0 from$$M_0=L_0+HS_0$$ M0=L0+HS0 , the work [1] proposes a novel convex optimization problem whose objective function is the sum of the$$\ell _1$$ ℓ1 -norm and nuclear norm. In this paper we detail the iterative algorithms and its associated computations for solving this convex optimization problem. We present various efficient implementation strategies, with attention to practical cases whereHis circulant, separable, or block structured. Notably, we propose a preprocessing technique that drastically improved the performance of our algorithms in terms of efficiency, accuracy, and robustness. While this paper serves as an illustrative algorithm implementation manual, we also provide theoretical guarantee for our preprocessing strategy. Numerical results demonstrate the effectiveness of the proposed approach. 
    more » « less
  4. Abstract This paper investigates the computation of proximity operators for scale and signed permutation invariant functions. A scale invariant function remains unchanged under uniform scaling, while a signed permutation invariant function retains its structure despite permutations and sign changes applied to its input variables. Noteworthy examples include the$$\ell _0$$ ℓ0 function, the ratio of$$\ell _1/\ell _2$$ ℓ1/ℓ2 , and its square, with their proximity operators being particularly crucial in sparse signal recovery. We delve into the properties of scale and signed permutation invariant functions, delineating the computation of their proximity operators into three sequential steps: the$${\varvec{w}}$$ w -step,r-step, andd-step. These steps collectively form a procedure termed as WRD, with the$${\varvec{w}}$$ w -step being of utmost importance and requiring careful treatment. Leveraging this procedure, we present a method for explicitly and efficiently computing the proximity operator of$$(\ell _1/\ell _2)^2$$ (ℓ1/ℓ2) 2 and introduce an algorithm for the proximity operator of$$\ell _1/\ell _2$$ ℓ1/ℓ2 . Numerical experiments on sparse signal recovery corroborate the analysis and show that first-order methods equipped with these proximity operators outperform$$\ell _1$$ ℓ1 -based baselines in reconstruction accuracy. 
    more » « less
  5. Abstract For a smooth projective varietyXover an algebraic number fieldka conjecture of Bloch and Beilinson predicts that the kernel of the Albanese map ofXis a torsion group. In this article we consider a product$$X=C_1\times \cdots \times C_d$$ X=C1×⋯×Cd of smooth projective curves and show that if the conjecture is true for any subproduct of two curves, then it is true forX. For a product$$X=C_1\times C_2$$ X=C1×C2 of two curves over$$\mathbb {Q} $$ Q with positive genus we construct many nontrivial examples that satisfy the weaker property that the image of the natural map$$J_1(\mathbb {Q})\otimes J_2(\mathbb {Q})\xrightarrow {\varepsilon }{{\,\textrm{CH}\,}}_0(C_1\times C_2)$$ J1(Q)⊗J2(Q)→ε CH 0 (C1×C2) is finite, where$$J_i$$ Ji is the Jacobian variety of$$C_i$$ Ci . Our constructions include many new examples of non-isogenous pairs of elliptic curves$$E_1, E_2$$ E1,E2 with positive rank, including the first known examples of rank greater than 1. Combining these constructions with our previous result, we obtain infinitely many nontrivial products$$X=C_1\times \cdots \times C_d$$ X=C1×⋯×Cd for which the analogous map$$\varepsilon $$ ε has finite image. 
    more » « less