An Algorithm for Packing Circles of Two Types in a Fixed Size Container with Non-Euclidean Metric.
Anna A. LempertAlexander L. KazakovQuang Mung LePublished in: AIST (Supplement) (2017)
Keyphrases
- fixed size
- dynamic programming
- packing problem
- learning algorithm
- sliding window
- simulated annealing
- similarity measure
- distance metric
- np hard
- variable size
- detection algorithm
- segmentation algorithm
- computational complexity
- k means
- distance function
- feature space
- object recognition
- metric space
- knapsack problem
- window size
- optimal solution
- objective function