Publication

Algorithms and methods for sparse approximation in structured dictionaries

Publications associées (117)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Sparse molecular image representation

Pascal Frossard, Sofia Karygianni

Sparsity-based models have proven to be very effective in most image processing applications. The notion of sparsity has recently been extended to structured sparsity models where not only the number of components but also their support is important. This ...

Elsevier2016

‪Stochastic Control-A Moment Approach to Sparse Control Design‬

We consider design of sparse controllers for a stochastic linear system with infinite horizon quadratic objective. We formulate the non-sparse optimal solution through a semidefinite program for the second order moments of the states and inputs. Given that ...

University of Minnesota2016

Transformation-Invariant Dictionary Learning for Classification with 1-Sparse Representations

Pascal Frossard, Elif Vural, Ahmet Caner Yüzügüler

Sparse representations of images in well-designed dictionaries can be used for effective classification. Meanwhile, training data available in most realistic settings are likely to be exposed to geometric transformations, which poses a challenge for the de ...

2014

Learning Parametric Dictionaries for Signals on Graphs

Pascal Frossard, David Shuman

In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties – the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on wei ...

Institute of Electrical and Electronics Engineers2014

Jump-Sparse and Sparse Recovery Using Potts Functionals

Martin Kurt Storath

We recover jump-sparse and sparse signals from blurred incomplete data corrupted by (possibly non-Gaussian) noise using inverse Potts energy functionals. We obtain analytical results (existence of minimizers, complexity) on inverse Potts functionals and pr ...

Ieee-Inst Electrical Electronics Engineers Inc2014

Model-based Sketching and Recovery with Expanders

Volkan Cevher, Luca Baldassarre, Bubacarr Bah

Linear sketching and recovery of sparse vectors with randomly constructed sparse matrices has numerous applications in several areas, including compressive sensing, data stream computing, graph sketching, and combinatorial group testing. This paper conside ...

2014

Fast detection of novel problematic patterns based on dictionary learning and prediction of their lithographic difficulty

Andreas Krause, Frank Grégoire Jean de Morsier, Maria Gabrani

Assessing pattern printability in new large layouts faces important challenges of runtime and false detection. Lithographic simulation tools and classification techniques do not scale well. We propose a fast pattern detection method by learning an overcomp ...

2014

Online dictionary learning over distributed models

Ali H. Sayed

In this paper, we consider learning dictionary models over a network of agents, where each agent is only in charge of a portion of the dictionary elements. This formulation is relevant in big data scenarios where multiple large dictionary models may be spr ...

IEEE2014

LAYOUT ASSESSMENT METHOD AND SYSTEM

Frank Grégoire Jean de Morsier, Virginia Estellers Casas, Nathalie Casati, Maria Gabrani

Candidate layout patterns can be assessed using a sparse pattern dictionary of known design layout patterns by determining sparse coefficients for each candidate pattern, reconstructing the respective candidate pattern, and determining reconstruction error ...

U.S. Patent and Trademark Office; U.S. DEPARTMENT OF COMMERCE2013

A geometric framework for registration of sparse images

Pascal Frossard, Alhussein Fawzi

We examine the problem of image registration when images have a sparse representation in a dictionary of geometric features. We propose a novel algorithm for aligning images by pairing their sparse components. We show numerically that this algorithm works ...

2013