Skip to content

Three-dimensional blind deconvolution by CP-parameterized kernels

Sep 2026 · arXiv.org · Vol abs/2609.25394 · 0 citations · 28 references
Mathematics Computer Science

Abstract

We consider the problem of reconstructing a kernel $k$ and image $u$ in a blind deconvolution problem from convolutional data $g = k*u$. We particularly focus on the 3D case, i.e., on volumetric images. The problem is approached by imposing a semiparametric CP decomposition for the kernel and a variational TV penalty for the image. We also discuss a motion blur ambiguity effect, i.e., a nonuniqueness issue of the kernel in the blind deconvolution problem that may appear in certain videos of moving objects. The blind deconvolution algorithm uses an alternating minimization approach with TV regularization for $u$ and a CP decomposition step for the kernel. These are implemented with positivity projection, kernel normalization, and\textbackslash or causal support projection steps. Several numerical examples for 3D MRI images, hyperspectral images, and a grayscale test video show the effectiveness of the method.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.