Image coding using transform vector quantization with training set synthesis
Signal Processing - Image and Video Coding beyond Standards
Fast PNN Using Partial Distortion Search
CAIP '01 Proceedings of the 9th International Conference on Computer Analysis of Images and Patterns
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph
IEEE Transactions on Pattern Analysis and Machine Intelligence
Iterative shrinking method for clustering problems
Pattern Recognition
Improvement of the fast exact pairwise-nearest-neighbor algorithm
Pattern Recognition
Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection
The Journal of Machine Learning Research
Fast agglomerative clustering using information of k-nearest neighbors
Pattern Recognition
An agglomerative clustering algorithm using a dynamic k-nearest-neighbor list
Information Sciences: an International Journal
| Hi-index | 0.01 |
This correspondence compares the computational complexity of the pair-wise nearest neighbor (PNN) and Linde-Buzo-Gray (LBG) algorithms by deriving analytical expressions for their computational times. It is shown that for a practical codebook size and training vector sequence, the LBG algorithm is indeed more computationally efficient than the PNN algorithm