Beyond Single Solution: Multi-Hypothesis Collaborative Deep Unfolding Network for Image Compressive Sensing

• URL: http://arxiv.org/abs/2606.03666v1
• Date: Tue, 02 Jun 2026 13:50:56 GMT
• Title: Beyond Single Solution: Multi-Hypothesis Collaborative Deep Unfolding Network for Image Compressive Sensing
• Abstract summary: Multi-Hypothesis Collaborative Deep Unfolding CS Network (MHC-DUN) is proposed.<n>It explicitly models and leverages multiple hypotheses by jointly optimizing across diverse solution spaces.<n> Experimental results reveal that the proposed CS method outperforms existing CS networks.
• Score: 44.028998922506
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recent deep unfolding networks (DUNs) have advanced Compressive Sensing (CS) by effectively integrating iterative optimization with deep learning architectures. However, most CS approaches predominantly confine their inference to a single solution space, neglecting the inherent ill-posedness of CS problems that intrinsically permits multiple plausible candidate hypotheses. In this paper, a novel Multi-Hypothesis Collaborative Deep Unfolding CS Network (MHC-DUN) is proposed, which explicitly models and leverages multiple hypotheses by jointly optimizing across diverse solution spaces. Specifically, following the Proximal Gradient Descent algorithm, MHC-DUN jointly performs gradient descent and proximal mapping within this multi-hypothesis paradigm. i) For gradient descent, a well-designed AlphaNet is introduced to dynamically predict spatially varying step sizes for all hypotheses, enabling collaborative gradient updates across multiple solutions. ii) For proximal operator, a sophisticated multi-hypothesis collaborative proximal mapping module is designed, which leverages both intra-hypothesis and inter-hypothesis correlation priors to jointly refine multiple solutions. To enable end-to-end training, a novel composite loss function is designed, which balances measurement fidelity, hypothesis diversity, and reconstruction accuracy, encouraging exploration of complementary solutions while maintaining reconstruction fidelity. Experimental results reveal that the proposed CS method outperforms existing CS networks.

Related papers

• Dual-Path Hyperprior Informed Deep Unfolding Network for Image Compressive Sensing [20.76300063992605]
  We propose a novel Dual-Path Hyperprior Informed Deep Unfolding Network (DPH-DUN)<n>It partitions measurements into double subsets to enable hyperprior-guided reconstruction via a dual-path architecture.<n>Extensive experiments demonstrate that the proposed DPH-DUN outperforms existing Compressive Sensing methods.
  arXiv  Detail & Related papers  (2026-05-10T14:28:37Z)
• FoundationSLAM: Unleashing the Power of Depth Foundation Models for End-to-End Dense Visual SLAM [50.9765003472032]
  FoundationSLAM is a learning-based monocular dense SLAM system for accurate and robust tracking and mapping.<n>Our core idea is to bridge flow estimation with reasoning by leveraging the guidance from foundation depth models.
  arXiv  Detail & Related papers  (2025-12-31T17:57:45Z)
• SPREAD: Sampling-based Pareto front Refinement via Efficient Adaptive Diffusion [0.8594140167290097]
  SPREAD is a generative framework based on Denoising Diffusion Probabilistic Models (DDPMs)<n>It learns a conditional diffusion process over points sampled from the decision space.<n>It refines candidates via a sampling scheme that uses an adaptive multiple gradient descent-inspired update for fast convergence.
  arXiv  Detail & Related papers  (2025-09-25T12:09:37Z)
• diffSPH: Differentiable Smoothed Particle Hydrodynamics for Adjoint Optimization and Machine Learning [21.05257407408671]
  diffSPH is a differentiable Smoothed Particle Hydrodynamics (SPH) framework developed entirely in PyTorch with GPU acceleration.<n> diffSPH is designed centrally around differentiation to facilitate optimization and machine learning (ML) applications in Computational Fluid Dynamics(CFD)<n>We demonstrate the framework's unique capabilities through several applications, including addressing particle shifting via a novel, target-oriented approach.
  arXiv  Detail & Related papers  (2025-07-29T10:54:27Z)
• Unleashing Network Potentials for Semantic Scene Completion [50.95486458217653]
  This paper proposes a novel SSC framework - Adrial Modality Modulation Network (AMMNet) AMMNet introduces two core modules: a cross-modal modulation enabling the interdependence of gradient flows between modalities, and a customized adversarial training scheme leveraging dynamic gradient competition. Extensive experimental results demonstrate that AMMNet outperforms state-of-the-art SSC methods by a large margin.
  arXiv  Detail & Related papers  (2024-03-12T11:48:49Z)
• MCU-Net: A Multi-prior Collaborative Deep Unfolding Network with Gates-controlled Spatial Attention for Accelerated MR Image Reconstruction [9.441882492801174]
  Deep unfolding networks (DUNs) have demonstrated significant potential in accelerating magnetic resonance imaging (MRI) However, they often encounter high computational costs and slow convergence rates. We propose a multi-prior collaborative DUN, termed MCU-Net, to address these limitations.
  arXiv  Detail & Related papers  (2024-02-04T07:29:00Z)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• Multi-Objective Policy Gradients with Topological Constraints [108.10241442630289]
  We present a new algorithm for a policy gradient in TMDPs by a simple extension of the proximal policy optimization (PPO) algorithm. We demonstrate this on a real-world multiple-objective navigation problem with an arbitrary ordering of objectives both in simulation and on a real robot.
  arXiv  Detail & Related papers  (2022-09-15T07:22:58Z)
• Fast Hierarchical Deep Unfolding Network for Image Compressed Sensing [31.71861820004099]
  A novel fast hierarchical deep unfolding network (DUN) is proposed for image compressed sensing. The proposed FHDUN outperforms existing state-of-the-art CS methods, while maintaining fewer iterations.
  arXiv  Detail & Related papers  (2022-08-03T03:27:32Z)
• Cogradient Descent for Bilinear Optimization [124.45816011848096]
  We introduce a Cogradient Descent algorithm (CoGD) to address the bilinear problem. We solve one variable by considering its coupling relationship with the other, leading to a synchronous gradient descent. Our algorithm is applied to solve problems with one variable under the sparsity constraint.
  arXiv  Detail & Related papers  (2020-06-16T13:41:54Z)
• Dynamic Multi-objective Optimization of the Travelling Thief Problem [4.859986264602551]
  Investigation of detailed and complex optimisation problem formulations that reflect realistic scenarios is a burgeoning field of research. A growing body of work exists for the Travelling Thief Problem, including multi-objective formulations and comparisons of exact and approximate methods to solve it. Definition of dynamics within three areas of the TTP problem are addressed; in the city locations, availability map and item values. A combined approach that mixes solution generation methods to provide a composite population in response to dynamic changes provides improved performance in some instances for the different dynamic TTP formulations.
  arXiv  Detail & Related papers  (2020-02-07T06:33:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.