On the performance of an optimized NLMS algorithm.
Constantin PaleologuSilviu CiochinaRazvan CaramalauJacob BenestyPublished in: ECAI (2015)
Keyphrases
- computational cost
- improved algorithm
- np hard
- dynamic programming
- experimental evaluation
- video sequences
- detection algorithm
- optimization algorithm
- k means
- probabilistic model
- data structure
- recognition algorithm
- times faster
- theoretical analysis
- linear programming
- simulated annealing
- worst case
- significant improvement
- search space
- computational complexity
- image sequences
- computationally efficient
- segmentation algorithm
- evolutionary algorithm
- tree structure
- objective function
- learning algorithm