Denoising Multi-Color QR Codes and Stiefel-Valued Data by Relaxed Regularizations
Robert Beinert, Jonas Bresch

TL;DR
This paper extends a convex denoising approach to handle multi-binary and Stiefel-valued data, such as multi-color QR codes and recognition data, using relaxed regularizations for improved noise reduction.
Contribution
It introduces new TV and Tikhonov denoising models with convex relaxations for multi-binary and Stiefel-valued data, expanding the applicability of manifold-based denoising methods.
Findings
Effective denoising demonstrated on synthetic experiments.
Convex relaxations enable efficient optimization.
Applicable to multi-color QR codes and recognition tasks.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMedical Image Segmentation Techniques · Digital Image Processing Techniques · Image and Signal Denoising Methods
