Nondyadic and nonlinear multiresolution image approximations
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.
We propose to design the reduction operator of an image pyramid so as to minimize the approximation error in the lp-sense (not restricted to the usual p=2), where p can take non-integer values. The underlying image model is specified using shift- ...
We present an optimal spline-based algorithm for the enlargement or reduction of digital images with arbitrary (noninteger) scaling factors. This projection-based approach can be realized thanks to a new finite difference method that allows the computation ...
We present a new method for estimating heart motion from two-dimensional (2D) echocardiographic sequences. It is inspired by the Lucas-Kanade algorithm for optical flow which estimates motion parameters over a sliding window. However, instead of assuming t ...
We analyze the representation of periodic signals in a scaling function basis. This representation is sufficiently general to include the widely used approximation schemes like wavelets, splines and Fourier series representation. We derive a closed form ex ...
We propose to design the reduction operator of an image pyramid so as to minimize the approximation error in the lp sense (not restricted to the usual p = 2), where p can take non-integer values. The underlying image model is specified using arbi ...
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 ...
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 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 ...
Wavelets and radial basis functions (RBF) are two rather distinct ways of representing signals in terms of shifted basis functions. An essential aspect of RBF, which makes the method applicable to non-uniform grids, is that the basis functions, unlike wave ...
We present an explicit formula for spline kernels; these are defined as the convolution of several B-splines of variable widths h and degrees n. The spline kernels are useful for continuous signal processing algorithms that involve B-spline inner-products ...
