Are ensemble-average learning curves reliable in evaluating the performance of adaptive filters?
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.
Deals with the problem of worst-case parameter estimation in the presence of bounded uncertainties in a linear regression model. The problem has been formulated and solved in Chandrasekaran et al. (1997). It distinguishes itself from other estimation schem ...
We provide an overview of adaptive estimation algorithms over
distributed networks. The algorithms rely on local collaborations and exploit the space-time structure of the data. Each node is allowed to communicate with its neighbors in order to exploit th ...
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 problem of estimating and predicting Origin-Destination (OD) tables is known to be important and difficult. In the specific context of Intelligent Transportation Systems (ITS), the dynamic nature of the problem and the real-time requirements make it ev ...
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 ...
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 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 ...
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 ...
Brightfield microscopy often suffers from limited depth of field, which prevents thick specimens from being imaged entirely in-focus. By optically sectioning the specimen, the in-focus regions can be acquired over multiple images. Extended depth of field m ...
