A data structure and algorithm based on a linear key for a rectangle retrieval problem.
D. J. AbelJ. L. SmithPublished in: Comput. Vis. Graph. Image Process. (1983)
Keyphrases
- data structure
- optimization algorithm
- dynamic programming
- np hard
- high accuracy
- computational complexity
- k means
- particle swarm optimization
- simulated annealing
- computational cost
- experimental evaluation
- cost function
- expectation maximization
- linear complexity
- knapsack problem
- tree structure
- linear programming
- times faster
- matching algorithm
- improved algorithm
- significant improvement
- space efficient
- preprocessing
- optimal solution
- objective function
- linear systems
- recognition algorithm
- learning algorithm
- convex hull
- linked list
- closed form
- detection algorithm
- segmentation algorithm
- worst case
- search space
- lower bound
- search algorithm
- similarity measure