Some Recovery Conditions for Basis Learning by L1-Minimization
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.
Any finite, separately convex, positively homogeneous function on R2 is convex. This was first established by the first author ["Direct methods in calculus of variations", Springer-Verlag (1989)]. Here we give a new and concise proof of this re ...
Recently Heyde, Kou and Peng (2007) proposed the notion of a natural risk statistic associated with a finite sample that relaxes the subadditivity assumption in the classical coherent risk statistics. In this note we use convex analysis to provide alternat ...
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ell1 minimisation, or more precisely the problem of identifying a dictionary dico from a set of training samples Y knowing that $ ...
This paper presents an experimental research that focuses on collaboration in a multi-player game. The aim of the project is to study the cognitive impacts of awareness tools, i.e. artifacts that allow users of a collaborative system to be aware of what is ...
The problem of efficiently representing and approximating digital data is an open challenge and it is of paramount importance for many applications. This dissertation focuses on the approximation of natural signals as an organized combination of mutually c ...
In this paper, we propose the use of (adaptive) nonlinear approximation for dimensionality reduction. In particular, we propose a dimensionality reduction method for learning a parts based representation of signals using redundant dictionaries. A redundant ...
Every convex polyhedron in the Euclidean space Rd admits both H- and V-representation. For both formats, a representation is canonical if it is minimal and unique up to some elementary operations. In this paper, we extend the usual definition of canonic ...
In this work we explore the potentialities of a framework for the representation of audio-visual signals using decompositions on overcomplete dictionaries. Redundant decompositions may describe audio-visual sequences in a concise fashion, preserving good r ...
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effectiveness of dictionary-based methods, however, is strongly influenced by the ...
The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effectiveness of dictionary-based methods, however, is strongly influenced by the ...