arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.15151math.NAcs.NA
收藏

一种高效的累积边缘检测图像重建方法

An Efficient Cumulative Edge-Detection Method for Image Reconstruction

Tufts University(塔夫茨大学);Virginia Tech(弗吉尼亚理工大学)

Toluwani Okunola, Mirjeta Pasha, Misha E. Kilmer

AI总结:

本文提出CR-$\ell_q$-RMM-GKS方法,结合累积边缘检测与高效计算,提升图像重建中边缘保留效果,实验表明其在信号去模糊和断层成像中表现优异。

摘要:

在从噪声测量中重建图像(如医学扫描或科学成像)时,我们面临一个逆问题:从间接、被污染的观测中恢复未知图像。这些问题通常是病态的,意味着少量噪声可能导致不准确的重建。正则化技术通过引入对解的先验假设(如平滑性或稀疏性)来解决这一问题。然而,标准方法往往会使边缘模糊——组织或结构的边界——丢失关键细节。一种强大的边缘保留策略是迭代加权,它通过解决一系列加权子问题并自适应更新权重来实现。非累积方案从当前迭代本身推导权重,并可以高效地使用Recycled Majorization-Minimization Generalized Krylov Subspace方法(RMM-GKS)。Gazzola等人的累积方法在迭代中逐步积累边缘信息,实现更优异的边缘保留,但计算成本高。本文引入CR-$\ell_q$-RMM-GKS,将累积边缘检测与计算效率结合。我们整合了Gazzola的累积加权与RMM-GKS,该方法处理一般的$\ell_q$惩罚(0 < q ≤ 2),自动选择正则化参数,并在迭代之间重用Krylov子空间,将嵌套结构减少到两层。信号去模糊和断层成像的数值实验表明,CR-$\ell_q$-RMM-GKS比标准非累积方法产生显著更清晰的边缘重建。特别是,CR-$\ell_1$-RMM-GKS优于标准$\ell_1$方法和CR-$\ell_2$-RMM-GKS,表明累积加权和$\ell_1$惩罚高度互补。

英文摘要:

When reconstructing images from noisy measurements, such as in medical scans or scientific imaging, we face an inverse problem: recovering an unknown image from indirect, corrupted observations. These problems are typically ill-posed, meaning small amounts of noise can lead to inaccurate reconstructions. Regularization techniques address this by incorporating prior assumptions about the solution, such as smoothness or sparsity. However, standard methods often blur sharp edges--the boundaries between tissues or structures--losing critical detail. A powerful strategy for edge preservation is iterative reweighting, which solves a sequence of weighted subproblems with adaptively updated weights. Non-cumulative schemes derive weights from the current iterate alone and can be solved efficiently using the Recycled Majorization-Minimization Generalized Krylov Subspace method (RMM-GKS). The cumulative approach of Gazzola et al. progressively accumulates edge information across iterations, achieving superior edge preservation but at high computational cost. This work introduces CR-$\ell_q$-RMM-GKS, which combines cumulative edge detection with computational efficiency. We integrate Gazzola's cumulative weighting with RMM-GKS, which handles general $\ell_q$ penalties ($0 < q \le 2$), automatically selects regularization parameters, and recycles Krylov subspaces between iterations, reducing the nested structure to two levels. Numerical experiments in signal deblurring and tomography demonstrate that CR-$\ell_q$-RMM-GKS produces significantly sharper edge reconstructions than standard non-cumulative methods. In particular, CR-$\ell_1$-RMM-GKS outperforms both standard $\ell_1$ methods and CR-$\ell_2$-RMM-GKS, indicating that cumulative weighting and $\ell_1$ penalties are highly complementary.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑