Fast Implementation of the Exact PNN Algorithm (1999)
BibTeX
@MISC{Fränti99fastimplementation,
author = {Pasi Fränti and Timo Kaukoranta},
title = {Fast Implementation of the Exact PNN Algorithm},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Straightforward implementation of the exact pairwise nearest neighbor (PNN) takes O(N³) time, where N is the number of training vectors. This is rather slow in practical situations. Fortunately much faster implementation can be obtained with rather simple modifications to the basic algorithm. In the present paper we propose a fast O(tN²) time implementation of the exact PNN, where t is shown to be significantly smaller than N. We give all necessary data structures and implementation details, and give time complexity of the algorithm both in the best and in the worst case. The proposed implementation achieves the results of the exact PNN with the same O(N) memory requirement.
Citations
| 1300 | Vector Quantization and Signal Compression - Gersho, Gray - 1991 |
| 976 | An algorithm for vector quantizer design - Linde, Buzo, et al. - 1980 |
| 319 | Sphere Packings, Lattices and Groups - Conway, Sloane - 1988 |
| 73 | A new vector quantization clustering algorithm - Equitz - 1989 |
| 23 | An efficient agglomerative clustering algorithm using a heap - Kurita - 1991 |
| 15 | A better tree-structured vector quantizer - Wu, Zhang - 1991 |
| 13 | A clustering algorithm for entropy-constrained vector quantizer design with applications in coding image pyramids - Garrido, Pearlman, et al. - 1995 |
| 9 | On the computational complexity of the LBG and PNN algorithms - Shanbehzadeh, Ogunbona - 1997 |
| 8 | On the splitting method for VQ codebook generation - Fränti, Kaukoranta, et al. - 1997 |
| 7 | Iterative split-and-merge algorithm for VQ codebook generation - Kaukoranta, Fränti, et al. - 1998 |
