paper-with-me

Papers

Scaling Up 3D Kernels with Bayesian Frequency Re-parameterization for Medical Image Segmentation

2023-03-10 · Ho Hin Lee, Quan Liu, Shunxing Bao, Qi Yang, Xin Yu, Leon Y. Cai, Thomas Li, Yuankai Huo, Xenofon Koutsoukos, Bennett A. Landman

With the inspiration of vision transformers, the concept of depth-wise convolution revisits to provide a large Effective Receptive Field (ERF) using Large Kernel (LK) sizes for medical image segmentation. However, the segmentation performance might be saturated and even degraded as the kernel sizes scaled up (e.g., $21\times 21\times 21$) in a Convolutional Neural Network (CNN). We hypothesize that convolution with LK sizes is limited to maintain an optimal convergence for locality learning. While Structural Re-parameterization (SR) enhances the local convergence with small kernels in parallel, optimal small kernel branches may hinder the computational efficiency for training. In this work, we propose RepUX-Net, a pure CNN architecture with a simple large kernel block design, which competes favorably with current network state-of-the-art (SOTA) (e.g., 3D UX-Net, SwinUNETR) using 6 challenging public datasets. We derive an equivalency between kernel re-parameterization and the branch-wise variation in kernel convergence. Inspired by the spatial frequency in the human visual system, we extend to vary the kernel convergence into element-wise setting and model the spatial frequency as a Bayesian prior to re-parameterize convolutional weights during training. Specifically, a reciprocal function is leveraged to estimate a frequency-weighted value, which rescales the corresponding kernel element for stochastic gradient descent. From the experimental results, RepUX-Net consistently outperforms 3D SOTA benchmarks with internal validation (FLARE: 0.929 to 0.944), external validation (MSD: 0.901 to 0.932, KiTS: 0.815 to 0.847, LiTS: 0.933 to 0.949, TCIA: 0.736 to 0.779) and transfer learning (AMOS: 0.880 to 0.911) scenarios in Dice Score.

📄 PDF Abstract BibTeX arXiv:2303.05785

Code (2)

masilab/repux-net 공식 구현 pytorch
masilab/deform-uxnet pytorch

Tasks

Computational EfficiencyImage SegmentationMedical Image SegmentationSemantic SegmentationTransfer Learning

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

Frequency-Aware Re-Parameterization for Over-Fitting Based Image Compression

2023-10-12 · Yun Ye, Yanjie Pan, Qually Jiang, Ming Lu 외

Over-fitting-based image compression requires weights compactness for compression and fast convergence for practical use, posing challenges for deep convolutional neural networks (CNNs) based methods. This paper presents…

Image CompressionImage Restoration

FlexConv: Continuous Kernel Convolutions with Differentiable Kernel Sizes

2021-10-15 · ICLR 2022 4 · David W. Romero, Robert-Jan Bruintjes, Jakub M. Tomczak, Erik J. Bekkers 외

When designing Convolutional Neural Networks (CNNs), one must select the size\break of the convolutional kernels before training. Recent works show CNNs benefit from different kernel sizes at different layers, but explor…

DescriptiveImage ClassificationSequential Image ClassificationTime Series Analysis

High-Dimensional Surrogate Modeling for Closed-Loop Learning of Neural-Network-Parameterized Model Predictive Control

2025-12-12 · Sebastian Hirt, Valentinus Suwanto, Hendrik Alsmeier, Maik Pfefferkorn 외 arxiv

Learning controller parameters from closed-loop data has been shown to improve closed-loop performance. Bayesian optimization, a widely used black-box and sample-efficient learning method, constructs a probabilistic surr…

Gaussian Processes

Mixed Variable Bayesian Optimization with Frequency Modulated Kernels

2021-02-25 · Changyong Oh, Efstratios Gavves, Max Welling

The sample efficiency of Bayesian optimization(BO) is often boosted by Gaussian Process(GP) surrogate models. However, on mixed variable spaces, surrogate models other than GPs are prevalent, mainly due to the lack of ke…

Bayesian OptimizationHyperparameter Optimization

Scaling Continuous Kernels with Sparse Fourier Domain Learning

2024-09-15 · Clayton Harper, Luke Wood, Peter Gerstoft, Eric C. Larson

We address three key challenges in learning continuous kernel representations: computational efficiency, parameter efficiency, and spectral bias. Continuous kernels have shown significant potential, but their practical a…

Computational EfficiencySparse Learning