Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
250
1On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD
, 2013
"... This article gives theoretical insights into the performance of K-SVD, a dictionary learning algorithm that has gained significant popularity in practical applications. The particular question studied here is when a dictionary Φ ∈ Rd×K can be recovered as local minimum of the minimisation criterion ..."
Abstract
- Add to MetaCart
underlying K-SVD from a set of N training signals yn = Φxn. A theoretical analysis of the problem leads to two types of identifiability results assuming the training signals are generated from a tight frame with coefficients drawn from a random symmetric distribution. First asymptotic results showing
permission. Structured Codes in Information Theory: MIMO and Network Applications
"... All rights reserved. ..."
1An Achievability Scheme for the Compound Channel with State Noncausally Available at the Encoder
"... ar ..."
TO CODE OR NOT TO CODE
, 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract
- Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:
Results 11 - 20
of
250
