Generalized Minkowski sets for the regularization of inverse problems

03/10/2019
by   Bas Peters, et al.
0

Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive model descriptions for regularization lead to better imaging results. These include cartoon-texture decomposition, morphological component analysis, and robust principal component analysis; methods that typically rely on penalty functions. We propose a regularization framework, based on the Minkowski set, that merges the strengths of additive models and constrained formulations. We generalize the Minkowski set, such that the model parameters are the sum of two components, each of which is constrained to an intersection of sets. Furthermore, the sum of the components is also an element of another intersection of sets. These generalizations allow us to include multiple pieces of prior knowledge on each of the components, as well as on the sum of components, which is necessary to ensure physical feasibility of partial-differential-equation based parameters estimation problems. We derive the projection operation onto the generalized Minkowski sets and construct an algorithm based on the alternating direction method of multipliers. We illustrate how we benefit from using more prior knowledge in the form of the generalized Minkowski set using seismic waveform inversion and video background-anomaly separation.

READ FULL TEXT

page 9

page 11

page 13

research
06/14/2022

Hybrid Projection Methods for Solution Decomposition in Large-scale Bayesian Inverse Problems

We develop hybrid projection methods for computing solutions to large-sc...
research
02/26/2019

Algorithms and software for projections onto intersections of convex and non-convex sets with applications to inverse problems

We propose algorithms and software for computing projections onto the in...
research
10/22/2014

Penalized versus constrained generalized eigenvalue problems

We investigate the difference between using an ℓ_1 penalty versus an ℓ_1...
research
11/14/2020

On the relation between constraint regularization, level sets, and shape optimization

We consider regularization methods based on the coupling of Tikhonov reg...
research
06/03/2020

RODE-Net: Learning Ordinary Differential Equations with Randomness from Data

Random ordinary differential equations (RODEs), i.e. ODEs with random pa...
research
03/17/2020

Deep connections between learning from limited labels physical parameter estimation – inspiration for regularization

Recently established equivalences between differential equations and the...
research
04/19/2011

High-Dimensional Inference with the generalized Hopfield Model: Principal Component Analysis and Corrections

We consider the problem of inferring the interactions between a set of N...

Please sign up or login with your details

Forgot password? Click here to reset