An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ℤ2.
Vincent LefèvrePublished in: SCAN (1998)
Keyphrases
- optimal solution
- lower bound
- detection algorithm
- high accuracy
- np hard
- learning algorithm
- distance metric
- computational cost
- dynamic programming
- knapsack problem
- search space
- recognition algorithm
- combinatorial optimization
- times faster
- lower and upper bounds
- online algorithms
- theoretical analysis
- simulated annealing
- worst case
- upper bound
- probabilistic model
- computational complexity
- image sequences
- linear programming
- convex hull
- experimental evaluation
- cost function
- distance transform