An NLMS algorithm for the identification of bilinear forms.
Constantin PaleologuJacob BenestySilviu CiochinaPublished in: EUSIPCO (2017)
Keyphrases
- cost function
- computational complexity
- times faster
- experimental evaluation
- dynamic programming
- learning algorithm
- detection algorithm
- worst case
- computational cost
- objective function
- expectation maximization
- optimization algorithm
- significant improvement
- identification rate
- improved algorithm
- genetic algorithm
- matching algorithm
- tree structure
- input data
- linear programming
- probabilistic model
- k means
- segmentation algorithm
- video sequences
- kalman filter
- np hard