Search results for "A priori and a posteriori"
showing 10 items of 119 documents
Quasi-Newton approach to nonnegative image restorations
2000
Abstract Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform (FFT) based schemes result in efficient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an image consists of positive light intensities, and thus a nonnegativity constraint should be enforced. This constraint and other ways of incorporating a priori information have been suggested in various applications, and can lead to substantial improvements in the reconstructions. Neverth…
Time multiplexing super-resolved imaging without a priori knowledge of the spatial distribution of the encoding structured illumination
2021
Time multiplexing is a super-resolution technique that sacrifices time to overcome the resolution reduction obtained because of diffraction. There are many super resolution methods based on time multiplexing, but all of them require a priori knowledge of the time changing encoding mask, which is projected on the object and used to encode and decode the high-resolution information. In this paper, we present a time multiplexing technique that does not require the a priori knowledge on the projected encoding mask. First, the theoretical concept of the technique is demonstrated; then, numerical simulations and experimental results are presented.
Functional A Posteriori Error Estimate for a Nonsymmetric Stationary Diffusion Problem
2015
In this paper, a posteriori error estimates of functional type for a stationary diffusion problem with nonsymmetric coefficients are derived. The estimate is guaranteed and does not depend on any particular numerical method. An algorithm for the global minimization of the error estimate with respect to an auxiliary function over some finite dimensional subspace is presented. In numerical tests, global minimization is done over the subspace generated by Raviart-Thomas elements. The improvement of the error bound due to the p-refinement of these spaces is investigated.
Existence and asymptotic properties for quasilinear elliptic equations with gradient dependence
2016
Abstract The paper focuses on a Dirichlet problem driven by the ( p , q ) -Laplacian containing a parameter μ > 0 in the principal part of the elliptic equation and a (convection) term fully depending on the solution and its gradient. Existence of solutions, uniqueness, a priori estimates, and asymptotic properties as μ → 0 and μ → ∞ are established under suitable conditions.
Guaranteed and computable error bounds for approximations constructed by an iterative decoupling of the Biot problem
2021
The paper is concerned with guaranteed a posteriori error estimates for a class of evolutionary problems related to poroelastic media governed by the quasi-static linear Biot equations. The system is decoupled by employing the fixed-stress split scheme, which leads to an iteratively solved semi-discrete system. The error bounds are derived by combining a posteriori estimates for contractive mappings with functional type error control for elliptic partial differential equations. The estimates are applicable to any approximation in the admissible functional space and are independent of the discretization method. They are fully computable, do not contain mesh-dependent constants, and provide r…
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem
2015
A dynamic time window relates to two operations that must be executed within a given time meaning that the difference between the points in time when the two operations are performed is bounded from above. The most prevalent context of dynamic time windows is when precedence is given for the two operations so that it is a priori specified that one operation must take place before the other. A prominent vehicle routing problem with dynamic time windows and precedence is the dial-a-ride problem (DARP), where user-specified transportation requests from origin to destination points must be serviced. The paper presents a new branch-and-cut-and-price solution approach for the DARP, the prototypi…
Dealing with preference uncertainty in contingent willingness to pay for a nature protection program: A new approach
2013
In this paper, we propose an alternative preference uncertainty measurement approach where respondents have the option to indicate their willingness to pay (WTP) for a nature protection program either as exact values or intervals from a payment card, depending on whether they are uncertain about their valuation. On the basis of their responses, we then estimate their degree of uncertainty. New within this study is that the respondent's degree of uncertainty is "revealed", while it is "stated" in those using existing measurement methods. Three statistical models are used to explore the sources of respondent uncertainty. We also present a simple way of calculating the uncertainty adjusted mea…
Nonlinearities and Adaptation of Color Vision from Sequential Principal Curves Analysis
2016
Mechanisms of human color vision are characterized by two phenomenological aspects: the system is nonlinear and adaptive to changing environments. Conventional attempts to derive these features from statistics use separate arguments for each aspect. The few statistical explanations that do consider both phenomena simultaneously follow parametric formulations based on empirical models. Therefore, it may be argued that the behavior does not come directly from the color statistics but from the convenient functional form adopted. In addition, many times the whole statistical analysis is based on simplified databases that disregard relevant physical effects in the input signal, as, for instance…
Heretical Mutiple Importance Sampling
2016
Multiple Importance Sampling (MIS) methods approximate moments of complicated distributions by drawing samples from a set of proposal distributions. Several ways to compute the importance weights assigned to each sample have been recently proposed, with the so-called deterministic mixture (DM) weights providing the best performance in terms of variance, at the expense of an increase in the computational cost. A recent work has shown that it is possible to achieve a trade-off between variance reduction and computational effort by performing an a priori random clustering of the proposals (partial DM algorithm). In this paper, we propose a novel "heretical" MIS framework, where the clustering …
Modelling by Statistic in Research of Mathematics Education
2008
Summary. The aim of this paper is to study the quantitative tools of the research in didactics. We want to investigate the theoretical-experimental relationships between factorial and implicative analysis. This chapter consists of three parts. The first one deals with the didactic research and some fundamental tools: the a priori analysis of a didactic situation, the collection of experimental data and the statistic analysis of data. The purpose of the second and the third section is to introduce the experimental comparison between the factorial and the implicative analysis in two researches in mathematics education.