Image compression with learnt tree-structured dictionaries
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.
In this paper we consider a multinational corporate structuring problem. This problem involves designing a corporate/organisational structure (across different countries) so as to remit profits from a number of subsidiaries to a single parent company, whil ...
This paper presents a new method for learning overcomplete dictionaries adapted to efficient joint representation of stereo images. We first formulate a sparse stereo image model where the multi-view correlation is described by local geometric transforms o ...
Institute of Electrical and Electronics Engineers2011
We explore hierarchical refinement of NURBS as a basis for adaptive isogeometric and immersed boundary analysis. We use the principle of B-spline subdivision to derive a local refinement procedure, which combines full analysis suitability of the basis with ...
The objective of this PhD thesis is the approximate computation of the solutions of the Spectral Problem associated with the Laplace operator on a compact Riemann surface without boundaries. A Riemann surface can be seen as a gluing of portions of the Hype ...
In this work we present a new greedy algorithm for sparse approximation called LocOMP. LocOMP is meant to be run on local dictionaries made of atoms with much shorter supports than the signal length. This notably encompasses shift-invariant dictionaries an ...
We propose a new method for imaging sound speed in breast tissue from measurements obtained by ultrasound tomography (UST) scan- ners. Given the measurements, our algorithm finds a sparse image representation in an overcomplete dictionary that is adapted t ...
Complex economic models often lack the structure for the application of standard techniques in monotone comparative statics. Generalized monotonicity analysis (GMA) extends the available methods in several directions. First, it provides a way of finding pa ...
This paper presents a general methodology based on the matrix pencil method (MPM) for the fitting of frequency-domain responses in order to be properly represented in time-domain analysis. By virtue of the proposed method, a rational fitting of the frequen ...
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse, we mean that only a few dictionary elements, compared to the ambient signal ...
Sparse methods are widely used in image and audio processing for denoising and classification, but there have been few previous applications to neural signals for brain-computer interfaces (BCIs). We used the dictionary- learning algorithm K-SVD, coupled w ...
