Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm.
Ralf L. M. PeetersBernard HanzonMartine OliviPublished in: ECC (1999)
Keyphrases
- high accuracy
- worst case
- preprocessing
- improved algorithm
- computational cost
- computational complexity
- significant improvement
- cost function
- dynamic programming
- expectation maximization
- detection algorithm
- optimal solution
- experimental evaluation
- objective function
- segmentation algorithm
- theoretical analysis
- optimization algorithm
- computationally efficient
- markov chain
- ant colony optimization
- tree structure
- times faster
- convergence rate
- neural network
- linear programming
- markov random field
- learning algorithm
- image sequences
- probabilistic model
- np hard