Fast orthogonal sparse approximation algorithms over local dictionaries.
Boris MailhéRémi GribonvalPierre VandergheynstFrédéric BimbotPublished in: Signal Process. (2011)
Keyphrases
- approximation algorithms
- sparse representation
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- set cover
- network design problem
- exact algorithms
- approximation schemes
- primal dual
- compressive sensing
- np hardness
- face recognition
- facility location problem
- disjoint paths
- approximation ratio
- open shop
- constant factor approximation
- randomized algorithms
- constant factor
- precedence constraints
- combinatorial auctions
- undirected graph
- upper bound