A stable and efficient algorithm for difficult Non-Orthogonal Joint Diagonalization problems.
Antoine SouloumiacPublished in: EUSIPCO (2011)
Keyphrases
- optimization algorithm
- benchmark problems
- computational cost
- detection algorithm
- objective function
- preprocessing
- theoretical analysis
- single pass
- test problems
- improved algorithm
- computationally efficient
- linear programming
- worst case
- simulated annealing
- computational complexity
- search space
- k means
- energy function
- clustering method
- np hard
- dynamic programming
- experimental evaluation
- segmentation algorithm
- recognition algorithm
- euler number
- computationally feasible
- computational geometry
- high accuracy
- linear systems
- high efficiency
- optimization problems
- particle swarm optimization
- significant improvement
- path planning
- matching algorithm
- np complete
- metaheuristic
- learning algorithm