Denoising Multi-Color QR Codes and Stiefel-Valued Data by Relaxed Regularizations

• URL: http://arxiv.org/abs/2506.22826v1
• Date: Sat, 28 Jun 2025 09:33:29 GMT
• Title: Denoising Multi-Color QR Codes and Stiefel-Valued Data by Relaxed Regularizations
• Authors: Robert Beinert, Jonas Bresch,
• Abstract summary: TV- and Tikhonov-type denoising models are proposed for new data types like multi-binary and Stiefel-valued data.<n>The aim of the present paper is to extent this approach to new kinds of data like multi-binary and Stiefel-valued data.<n>For both new data types, we propose TV- and Tikhonov-based denoising modelstogether with easy-to-solve convexification.
• Score: 1.534667887016089
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The handling of manifold-valued data, for instance, plays a central role in color restoration tasks relying on circle- or sphere-valued color models, in the study of rotational or directional information related to the special orthogonal group, and in Gaussian image processing, where the pixel statistics are interpreted as values on the hyperbolic sheet. Especially, to denoise these kind of data, there have been proposed several generalizations of total variation (TV) and Tikhonov-type denoising models incorporating the underlying manifolds. Recently, a novel, numerically efficient denoising approach has been introduced, where the data are embedded in an Euclidean ambient space, the non-convex manifolds are encoded by a series of positive semi-definite, fixed-rank matrices, and the rank constraint is relaxed to obtain a convexification that can be solved using standard algorithms from convex analysis. The aim of the present paper is to extent this approach to new kinds of data like multi-binary and Stiefel-valued data. Multi-binary data can, for instance, be used to model multi-color QR codes whereas Stiefel-valued data occur in image and video-based recognition. For both new data types, we propose TV- and Tikhonov-based denoising modelstogether with easy-to-solve convexification. All derived methods are evaluated on proof-of-concept, synthetic experiments.

Related papers

• Posterior Sampling with Denoising Oracles via Tilted Transport [37.14320147233444]
  We introduce the textittilted transport technique, which leverages the quadratic structure of the log-likelihood in linear inverse problems. We quantify the conditions under which this boosted posterior is strongly log-concave, highlighting the dependencies on the condition number of the measurement matrix. The resulting posterior sampling scheme is shown to reach the computational threshold predicted for sampling Ising models.
  arXiv  Detail & Related papers  (2024-06-30T16:11:42Z)
• Multilinear Kernel Regression and Imputation via Manifold Learning [5.482532589225551]
  MultiL-KRIM builds on the intuitive concept of spaces to tangent and incorporates collaboration among point-cloud neighbors (regressors) directly into the data-modeling term of the loss function. Two important application domains showcase the functionality of MultiL-KRIM: time-varying-graph-signal (TVGS) recovery, and reconstruction of highly accelerated dynamic-magnetic-resonance-imaging (dMRI) data.
  arXiv  Detail & Related papers  (2024-02-06T02:50:42Z)
• Reflected Diffusion Models [93.26107023470979]
  We present Reflected Diffusion Models, which reverse a reflected differential equation evolving on the support of the data. Our approach learns the score function through a generalized score matching loss and extends key components of standard diffusion models.
  arXiv  Detail & Related papers  (2023-04-10T17:54:38Z)
• Score-based Diffusion Models in Function Space [137.70916238028306]
  Diffusion models have recently emerged as a powerful framework for generative modeling.<n>This work introduces a mathematically rigorous framework called Denoising Diffusion Operators (DDOs) for training diffusion models in function space.<n>We show that the corresponding discretized algorithm generates accurate samples at a fixed cost independent of the data resolution.
  arXiv  Detail & Related papers  (2023-02-14T23:50:53Z)
• Black-box Coreset Variational Inference [13.892427580424444]
  We present a black-box variational inference framework for coresets to enable principled application of variational coresets to intractable models. We apply our techniques to supervised learning problems, and compare them with existing approaches in the literature for data summarization and inference.
  arXiv  Detail & Related papers  (2022-11-04T11:12:09Z)
• Multi-channel Nuclear Norm Minus Frobenius Norm Minimization for Color Image Denoising [9.20787253404652]
  One traditional strategy is to convert the RGB image to a less correlated color space and denoise each channel of the new space separately. This paper proposes a new multi-channel optimization model for color image denoising under the nuclear norm minus Frobenius norm minimization framework. Experimental results on both synthetic and real noise datasets demonstrate the proposed model outperforms state-of-the-art models.
  arXiv  Detail & Related papers  (2022-09-16T04:10:29Z)
• The Manifold Hypothesis for Gradient-Based Explanations [55.01671263121624]
  gradient-based explanation algorithms provide perceptually-aligned explanations. We show that the more a feature attribution is aligned with the tangent space of the data, the more perceptually-aligned it tends to be. We suggest that explanation algorithms should actively strive to align their explanations with the data manifold.
  arXiv  Detail & Related papers  (2022-06-15T08:49:24Z)
• A DCT-based Tensor Completion Approach for Recovering Color Images and Videos from Highly Undersampled Data [0.8399688944263843]
  We propose a novel tensor completion approach to recover color images and videos from undersampled data. A series of numerical experiments including color image inpainting and video data recovery demonstrate that our proposed approach performs better than many existing state-of-theart tensor completion methods.
  arXiv  Detail & Related papers  (2021-10-18T13:41:27Z)
• Uncertainty Inspired RGB-D Saliency Detection [70.50583438784571]
  We propose the first framework to employ uncertainty for RGB-D saliency detection by learning from the data labeling process. Inspired by the saliency data labeling process, we propose a generative architecture to achieve probabilistic RGB-D saliency detection. Results on six challenging RGB-D benchmark datasets show our approach's superior performance in learning the distribution of saliency maps.
  arXiv  Detail & Related papers  (2020-09-07T13:01:45Z)
• Set Based Stochastic Subsampling [85.5331107565578]
  We propose a set-based two-stage end-to-end neural subsampling model that is jointly optimized with an textitarbitrary downstream task network. We show that it outperforms the relevant baselines under low subsampling rates on a variety of tasks including image classification, image reconstruction, function reconstruction and few-shot classification.
  arXiv  Detail & Related papers  (2020-06-25T07:36:47Z)
• Data Augmentation for Histopathological Images Based on Gaussian-Laplacian Pyramid Blending [59.91656519028334]
  Data imbalance is a major problem that affects several machine learning (ML) algorithms. In this paper, we propose a novel approach capable of not only augmenting HI dataset but also distributing the inter-patient variability. Experimental results on the BreakHis dataset have shown promising gains vis-a-vis the majority of DA techniques presented in the literature.
  arXiv  Detail & Related papers  (2020-01-31T22:02:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.