A robust sub-linear time R-FFAST algorithm for computing a sparse DFT.
Sameer PawarKannan RamchandranPublished in: CoRR (2015)
Keyphrases
- worst case
- computationally efficient
- computational cost
- parameter tuning
- preprocessing
- cost function
- theoretical analysis
- experimental evaluation
- probabilistic model
- simulated annealing
- linear programming
- optimal solution
- computational complexity
- optimization algorithm
- high accuracy
- expectation maximization
- np hard
- search space
- objective function
- particle swarm optimization
- dimensionality reduction
- similarity measure
- image matching
- times faster
- convergence rate