A general method to include prior knowledge in regularization functionals is presented. In a first step, components of prior information are formalized by defining relevant distances from template functions, playing the role of locally or
Nonlinear Regularization with Prior Templates Jorg C. Lemm Institut fur Theoretische Physik I Wilhelm{Klemm{Str.9 D{48149 Munster Germany Email: lemm@uni-muenster.de
Extended Abstract
1 Introduction A general method to include prior knowledge in regularization functionals is presented. In a rst step, components of prior information are formalized by de ning relevant distances from template functions, playing the role of locally or globally de ned function prototypes. In a second step the components are combined by the logical operations AND and OR, similar to fuzzy logical methods. Implementing the probabilistic AND yields the classical linear regularization methods, like splines or Radial Basis Functions. For many problems knowledge formulated in terms of a probabilistic OR is available. Objects, like faces, for example consist of constituents, e.g. eyes, mouth, nose, which may appear in one of several relatively well de ned variants, e.g. eyes may be open OR closed, blue OR brown. The implementation of such a probabilistic OR, however, yields nonlinear stationarity equations, which are the topic of the present paper. Two approaches are introduced for implementing a probabilistic OR. The rst one interprets the individual components as (shifted and rescaled) log{ probabilities and results in a mixture model over a function space, resembling a physical system at nite temperature. The corresponding temperature can be varied, similarly to the approach of Rose, Gurewitz,& Fox (1990) for clustering. The second approach directly constructs an e ective total posterior by fuzzy logical{like combination of prior components. Introducing a temperature{like parameter this corresponds to the Landau{Ginzburg treatment of phase transitions. The resulting equations turn out to be similar, for example, to equations obtained in quantum mechanical scattering theory. For both methods a variety of local learning algorithms can be chosen. The two approaches and corresponding learning algorithms are exempli ed in a numerical model. 1
A Newton-type method for nonlinear ill-posed problems with A-smooth regularization 隐藏>> 维普资讯 http://www.cqvip.com JunlfhnhinvrtEgs din,07l()4743...
Conjugate Gradient Algorithm with Edge-Preserving Regularization for Image ...In order to solve this nonlinear and ill-posed inverse scattering problem, ...
{convex Regularization Universitat Munster Institut ... E ji=1 iji 2 i=1 F with (nonlinear) ...templates Wt 2 1 20 -1 -2 5 10 15 20 ...
(i.e., 10 templates), λ=0.01 (for L1 regularization), 100 particles...Blasch. “Kalman Filtering with Nonlinear State Constraints.” ISIF Proc. ...
Mode sum regularization approach for the self-force in black hole space...(thus allowing the design of templates needed for detection and interpretation...
) H. K. Pikkarainen (RICAM) Regularization of ill-posed problems Helsinki, June 2010 20 / 32 Nonlinear inverse problems Nonlinear inverse problem: y =...
2013A regularization for the projection twin support vector machine_电子/...nonlinear cases, so we only compare our nonlinear RPTSVM with TWSVM and ...
Nonlinear Regularization with Prior Templates Jorg C. Lemm Institut fur Theoretische Physik I Wilhelm{Klemm{Str.9 D{48149 Munster Germany Email: lemm@uni...
piecewise linearization of any nonlinear systems [...They are determined by setting up the prior ...the cost function as the regularization term [27...
(xi) – f(φ(1)(xi)))2 – Prior component...?uTHu Regularization model ? DARTEL has three ...templates from 6 subjects Nonlinear Registered Rigid...
热门文档