An efficient algorithm for computing the K-overlapping maximum convex sum problem.
Mohammed ThaherTadao TakaokaPublished in: ICCS (2011)
Keyphrases
- times faster
- expectation maximization
- preprocessing
- convex hull
- k means
- optimal solution
- objective function
- computational complexity
- np hard
- experimental evaluation
- optimization algorithm
- learning algorithm
- high accuracy
- matching algorithm
- detection algorithm
- dynamic programming
- tree structure
- worst case
- simulated annealing
- computationally efficient
- theoretical analysis
- computational cost
- significant improvement
- clustering method
- search space
- feature space
- search algorithm
- data structure
- recognition algorithm
- improved algorithm