An efficient algorithm for computing the distance between close partitions.
Daniel Cosmin PorumbelJin-Kao HaoPascale KuntzPublished in: Discret. Appl. Math. (2011)
Keyphrases
- computational complexity
- experimental evaluation
- np hard
- objective function
- improved algorithm
- computationally efficient
- high accuracy
- learning algorithm
- matching algorithm
- optimization algorithm
- theoretical analysis
- optimal solution
- ant colony optimization
- distance function
- expectation maximization
- simulated annealing
- computational cost
- preprocessing
- high dimensional
- maximum likelihood
- k means
- video sequences
- segmentation algorithm
- probabilistic model
- dynamic programming
- path planning
- times faster
- distance transform