Adaptive Selection of Sampling-Reconstruction in Fourier Compressed Sensing

Seongmin Hong, Jaehyeok Bae, Jongho Lee, Se Young Chun
{"title":"Adaptive Selection of Sampling-Reconstruction in Fourier Compressed Sensing","authors":"Seongmin Hong, Jaehyeok Bae, Jongho Lee, Se Young Chun","doi":"arxiv-2409.11738","DOIUrl":null,"url":null,"abstract":"Compressed sensing (CS) has emerged to overcome the inefficiency of Nyquist\nsampling. However, traditional optimization-based reconstruction is slow and\ncan not yield an exact image in practice. Deep learning-based reconstruction\nhas been a promising alternative to optimization-based reconstruction,\noutperforming it in accuracy and computation speed. Finding an efficient\nsampling method with deep learning-based reconstruction, especially for Fourier\nCS remains a challenge. Existing joint optimization of sampling-reconstruction\nworks (H1) optimize the sampling mask but have low potential as it is not\nadaptive to each data point. Adaptive sampling (H2) has also disadvantages of\ndifficult optimization and Pareto sub-optimality. Here, we propose a novel\nadaptive selection of sampling-reconstruction (H1.5) framework that selects the\nbest sampling mask and reconstruction network for each input data. We provide\ntheorems that our method has a higher potential than H1 and effectively solves\nthe Pareto sub-optimality problem in sampling-reconstruction by using separate\nreconstruction networks for different sampling masks. To select the best\nsampling mask, we propose to quantify the high-frequency Bayesian uncertainty\nof the input, using a super-resolution space generation model. Our method\noutperforms joint optimization of sampling-reconstruction (H1) and adaptive\nsampling (H2) by achieving significant improvements on several Fourier CS\nproblems.","PeriodicalId":501289,"journal":{"name":"arXiv - EE - Image and Video Processing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - EE - Image and Video Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11738","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
傅立叶压缩传感中采样-重构的自适应选择
压缩传感(CS)的出现克服了奈奎斯特采样的低效率问题。然而,传统的基于优化的重建速度较慢,在实际应用中无法生成精确的图像。基于深度学习的重构是基于优化的重构的一个很有前途的替代方案,在精确度和计算速度上都优于优化重构。寻找一种高效的采样方法与基于深度学习的重建相结合,特别是对于傅立叶CS,仍然是一个挑战。现有的采样-重建联合优化方法(H1)可以优化采样掩码,但由于不能适应每个数据点,因此潜力不大。自适应采样(H2)也存在优化困难和帕累托次优的缺点。在这里,我们提出了一个新颖的自适应选择采样-重建(H1.5)框架,它能为每个输入数据选择最佳的采样掩码和重建网络。我们提供的定理表明,我们的方法比 H1 具有更高的潜力,并且通过为不同的采样掩码使用不同的重建网络,有效地解决了采样-重建中的帕累托次优化问题。为了选择最佳采样掩码,我们建议使用超分辨率空间生成模型量化输入的高频贝叶斯不确定性。我们的方法通过在多个傅立叶 CS 问题上取得显著改进,实现了采样重建(H1)和自适应采样(H2)的联合优化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
multiPI-TransBTS: A Multi-Path Learning Framework for Brain Tumor Image Segmentation Based on Multi-Physical Information Autopet III challenge: Incorporating anatomical knowledge into nnUNet for lesion segmentation in PET/CT Denoising diffusion models for high-resolution microscopy image restoration Tumor aware recurrent inter-patient deformable image registration of computed tomography scans with lung cancer Cross-Organ and Cross-Scanner Adenocarcinoma Segmentation using Rein to Fine-tune Vision Foundation Models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1