Anytime Possibilistic Propagation Algorithm.
Nahla Ben AmorSalem BenferhatKhaled MellouliPublished in: Soft-Ware (2002)
Keyphrases
- expectation maximization
- dynamic programming
- learning algorithm
- simulated annealing
- experimental evaluation
- improved algorithm
- computational cost
- k means
- preprocessing
- neural network
- np hard
- times faster
- particle swarm optimization
- theoretical analysis
- computational complexity
- optimal solution
- recognition algorithm
- computationally efficient
- detection algorithm
- ant colony optimization
- image sequences
- selection algorithm
- path planning
- search space
- objective function
- high accuracy
- image registration
- significant improvement