MATHICSE Technical Report : Discrete least squares polynomial approximation with random evaluations – application to parametric and stochastic elliptic PDES
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This thesis focuses on the development of novel multiresolution image approximations. Specifically, we present two kinds of generalization of multiresolution techniques: image reduction for arbitrary scales, and nonlinear approximations using other metrics ...
We define texture mapping as an optimization problem for which the goal of preserving the maximum amount of information in the mapped texture. We derive a solution that is optimal in the least-squares sense and that corresponds to the pseudo-inverse of a r ...
We propose a new technique to perform nonuniform to uniform grid conversion: first, interpolate using nonuniform splines, then project the resulting function onto a uniform spline space and finally, resample. We derive a closed form solution to the least-s ...
The geometry of a modern imaging diffractometer is discussed in detail. A method to find all relevant instrument parameters from the control single-crystal measurement data is proposed and the limitations of such a procedure are indicated. Optimization of ...
We show that we can effectively fit arbitrarily complex animation models to noisy data extracted from ordinary face images. Our approach is based on least-squares adjustment, using of a set of progressively finer control triangulations and takes advantage ...
We propose a new optimizer in the context of multimodal image registration. The optimized criterion is the mutual in formation between the images to align. This criterion requires that their joint histogram be available. For its computation, we introduce d ...
We show that we can effectively fit arbitrarily complex animation models to noisy image data. Our approach is based on least-squares adjustment using of a set of progressively finer control triangulations and takes advantage of three complementary sources ...
We define texture mapping as an optimization problem for which the goal of preserving the maximum amount of information in the mapped texture. We derive a solution that is optimal in the least-squares sense and that corresponds to the pseudo-inverse of a ...
Location finding for CDMA subscribers using an antenna array at the base station is studied. Two methods are considered for radio location that are based on time of arrival (TOA) and angle of arrival (AOA) measurements. For TOA estimates, a maximum likelih ...
We investigate the functions of given approximation order L that have the smallest support. Those are shown to be linear combinations of the B-spline of degree L-1 and its L-1 first derivatives. We then show how to find the functions that minimize the asym ...
