A Subspace Blind Identification Algorithm with Reduced Computational Complexity - Colored Noise Case - .
Nari TanabeToshihiro FurukawaKohichi SakaniwaShigeo TsujiiPublished in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2005)
Keyphrases
- computational complexity
- learning algorithm
- computational cost
- worst case
- preprocessing
- detection algorithm
- np hard
- expectation maximization
- input data
- simulated annealing
- memory requirements
- computational efficiency
- optimization algorithm
- computationally efficient
- objective function
- dynamic programming
- cost function
- color images
- clustering method
- matching algorithm
- median filter
- noisy data
- optimal solution
- eigendecomposition
- convergence rate
- search space
- similarity measure
- feature selection