A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Wavelet-based methods have become most popular for the compression of two-dimensional medical images and sequences. The standard implementations consider data sizes that are powers of two. There is also a large body of literature treating issues such as th ...
Medical image processing is a demanding domain, both in terms of CPU and memory requirements. The volume of data to be processed is often large (a typical MRI dataset requires 10 MBytes) and many processing tools are only useful to the physician if they ar ...
We present an exact algorithm for the computation of the moments of a region bounded by a curve represented in a scaling function or wavelet basis. Using Green's theorem, we show that the computation of the area moments is equivalent to applying a suitable ...
We present a statistical view of the texture retrieval problem by combining the two related tasks, namely feature extraction (FE) and similarity measurement (SM), into a joint modeling and classification scheme. We show that using a con- sistent estimator ...
Frequency-domain implementations improve the computational efficiency and the convergence rate of adaptive schemes. This paper develops frequency-domain adaptive structures that are based on the trigonometric transforms DCT and DST. The structures involve ...
We introduce a novel, adaptive image representation using spatially varying wavelet packets (WPs), Our adaptive representation uses the fast double-tree algorithm introduced previously (Herley et al., 1993) to optimize an operational rate-distortion (R-D) ...
Bright-field microscopy suffers from a relatively small depth-of-field. Typically, the specimen’s profile covers a range larger than the depth-of-field, and parts of the specimen that lie outside the object plane appear blurred. The specimen can be ‘scanne ...
We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths hi and degrees ni. We apply our results to derive spline-convolution-based algorithms for two closely related prob ...
We present a generic video codec, which is able to compress image sequences efficiently regardless of their input formats. In addition, this codec supports a wide range of bit rates, without significant changes in its main architecture. A multiresolution r ...
New techniques for redundancy removal of quantized coefficients of a wavelet transform are discussed. Several strategies are developed to improve the redundancy reduction stage in subband/wavelet based image compression. The influence of the scanning path ...
