An algorithm to compute a T-transitive opening of a proximity.
Luis GarmendiaAdela SalvadorPublished in: EUSFLAT Conf. (2005)
Keyphrases
- dynamic programming
- learning algorithm
- cost function
- computational complexity
- preprocessing
- expectation maximization
- experimental evaluation
- detection algorithm
- times faster
- probabilistic model
- worst case
- np hard
- objective function
- hardware implementation
- recognition algorithm
- memory requirements
- improved algorithm
- matching algorithm
- experimental study
- optimization algorithm
- theoretical analysis
- computationally efficient
- simulated annealing
- high accuracy
- computational cost
- search space
- moving objects