On the computational complexity of the LBG and PNN algorithms.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 18282955.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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.