* Returns the indices of the k centroids which are closer to the given descriptor. Can be used for soft * quantization. Fast implementation with a bounded priority queue. TO DO: early stopping! * *@paramdescriptor *@paramk *@return*/protectedint[] computeKNearestCentroids(double[] descriptor...
1. "A bounded queue is a first-in-first-out queue with a fixed capacity" http://venus.cs.depaul.edu/Java/chap08.html 2. "It is possible for a Queue implementation to restrict the number of elements that it holds; such queues are known as bounded. Some Queue implementations in jav...