A New Approximation Algorithm for the Minimum Fragment Removal Problem.
Hatem TahriMourad ElloumiPublished in: BIRD (2008)
Keyphrases
- np hard
- preprocessing
- approximation ratio
- experimental evaluation
- optimal solution
- clustering method
- computational cost
- dynamic programming
- worst case
- improved algorithm
- theoretical analysis
- computational complexity
- objective function
- recognition algorithm
- square error
- convergence rate
- error bounds
- cost function
- significant improvement
- k means
- evolutionary algorithm
- search space
- piecewise constant
- approximation algorithms
- polygonal approximation
- high accuracy
- times faster
- matching algorithm
- tree structure
- energy function
- segmentation algorithm
- expectation maximization
- simulated annealing
- data sets
- search algorithm
- similarity measure
- image segmentation