HTML Table Example

Adaptive Selection of Sampling-Reconstruction in Fourier Compressed Sensing

Seongmin Hong1, Jaehyeok Bae1, Jongho Lee1,2,*, Se Young Chun1,2,3,*

1Dept. of Electrical and Computer Engineering,
2INMC, 3IPAI
Seoul National University, Republic of Korea

Accepted to ECCV 2024

[arXiv] [github] [bibTeX]






Goal

Let’s find the best sampling mask for each input adaptive in Fourier compressed sensing!


Prior work vs Ours

There are two types of prior works.

Joint optimization of sampling-reconstruction (H1) is non-adaptive to each input.

Adaptive sampling (H2) is hard to train.




But here is the thing:

Our Adaptive selection of Sampling-Reconstruction (H1.5) is fantastic!






In detail, ours have these advantages over prior works.

Adaptive to input k Backprop to a continuous space Parato optimal θ
Joint optimization
(H1)		 ✗ ✗ ✔
Adaptive sampling
(H2)		 ✔ ✗ ✗
Adaptive Selection
(H1.5)		 ✔ ✔ ✔






Method

Our method does:

  1. Acquire Low-frequency region first
  2. Using SR space generation model, quantify the HF Bayesian uncertainty
  3. Based on the HF Bayesian uncertainty, select the pair of sampling-reconstruction






Theory

Why is our model better than prior works? We can prove it:






Results

Ours showed the best SSIM and PSNR in face RGB reconstruction,

and in compressed sensing MRI (8x)!






Abstract

Compressed sensing (CS) has emerged to overcome the inefficiency of Nyquist sampling. However, traditional optimization-based reconstruction is slow and can not yield an exact image in practice. Deep learning-based reconstruction has been a promising alternative to optimization-based reconstruction, outperforming it in accuracy and computation speed. Finding an efficient sampling method with deep learning-based reconstruction, especially for Fourier CS remains a challenge. Existing joint optimization of sampling-reconstruction works (H1) optimize the sampling mask but have low potential as it is not adaptive to each data point. Adaptive sampling (H2) has also disadvantages of difficult optimization and Pareto sub-optimality. Here, we propose a novel adaptive selection of sampling-reconstruction (H1.5) framework that selects the best sampling mask and reconstruction network for each input data. We provide theorems that our method has a higher potential than H1 and effectively solves the Pareto sub-optimality problem in sampling-reconstruction by using separate reconstruction networks for different sampling masks. To select the best sampling mask, we propose to quantify the high-frequency Bayesian uncertainty of the input, using a super-resolution space generation model. Our method outperforms joint optimization of sampling-reconstruction (H1) and adaptive sampling (H2) by achieving significant improvements on several Fourier CS problems.



BibTeX

 
@InProceedings{Hong_2024_ECCV,
    author    = {Hong, Seongmin and Bae, Jaehyeok and Lee, Jongho and Chun, Se Young},
    title     = {Adaptive Selection of Sampling-Reconstruction in Fourier Compressed Sensing},
    booktitle = {European Conference on Computer Vision},
    month     = {October},
    year      = {2024},
}