A least squares algorithm for global joint decomposition of complex matrix sets.
Tual TraininiEric MoreauPublished in: CAMSAP (2011)
Keyphrases
- least squares
- learning algorithm
- experimental evaluation
- dynamic programming
- decomposition algorithm
- detection algorithm
- k means
- optimization algorithm
- particle swarm optimization
- parameter estimation
- np hard
- search space
- computational complexity
- matching algorithm
- times faster
- computational cost
- segmentation algorithm
- levenberg marquardt
- worst case
- significant improvement
- preprocessing
- optimal solution
- linear programming
- recognition algorithm
- rows and columns
- convergence rate
- clustering method
- expectation maximization
- search algorithm
- objective function