Sparse image approximation with application to flexible image coding
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.
We show that the complete information that is available after an image has been encoded is not just an approximate quantized image version, but a whole set of consistent images that contains the original image by necessity. From this starting point, we dev ...
Stabilized finite elements on strongly anisotropic meshes are considered. The design of the stability coefficients is addressed for both the advection-diffusion and the Stokes problems when using continuous piecewise linear finite elements on triangles. Us ...
This paper presents a new image representation method based on anisotropic refinement. It has been shown that wavelets are not optimal to code 2-D objects which need true 2-D dictionaries for efficient approximation. We propose to use rotations and anisotr ...
Compression efficiency is mainly driven by redundancy of the overcomplete set of functions chosen for the signal decomposition. In Matching Pursuit algorithms for example, the redundancy of the dictionary influences the convergence of the residual energy. ...
This paper proposes a multiresolution Matching Pursuit decomposition of natural images. Matching Pursuit is a greedy algorithm that decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary, by iteratively picking the wav ...
This paper proposes a multiresolution Matching Pursuit decomposition of natural images. Matching Pursuit is a greedy algorithm that decomposes any signal into a linear expansion of waveforms taken from a redundant dictionary, by iteratively picking the wav ...
The matching pursuit algorithm can be used to derive signal decompositions in terms of the elements of a dictionary of time-frequency atoms. Using a structured overcomplete dictionary yields a signal model that is both parametric and signal-adaptive. In th ...
The matching pursuit algorithm can be used to derive signal decompositions in terms of the elements of a dictio- nary of time–frequency atoms. Using a structured overcomplete dictionary yields a signal model that is both parametric and signal adaptive. In ...
Institute of Electrical and Electronics Engineers1999
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit properties. The coefficients energy in Matching Pursuit indeed decreases with t ...
A method for the automatic segmentation, recognition and measurement of neuronal myelinated fibers in nerve histological sections is presented. In this method, the fiber parameters i.e. perimeter, area, position of the fiber and myelin sheath thickness are ...
