Sparse approximations with a high resolution greedy algorithm.
Benjamin G. SalomonHanoch UrPublished in: ICECS (2004)
Keyphrases
- greedy algorithm
- sparse approximations
- high resolution
- sparse representation
- gaussian process
- super resolution
- greedy algorithms
- dynamic programming
- worst case
- image processing
- greedy heuristic
- knapsack problem
- set cover
- objective function
- influence maximization
- greedy strategy
- random walk
- latent variables
- signal processing
- face recognition
- data sets
- denoising
- np hard
- multiscale
- image segmentation
- influence spread