Reducing the complexity of the LPC vector quantizer using the k-d tree search algorithm.
V. RamasubramanianKuldip K. PaliwalPublished in: EUROSPEECH (1997)
Keyphrases
- vector quantizer
- tree search algorithm
- vector quantization
- image coding
- subband image coding
- entropy constrained
- branch and bound
- finite state
- computational complexity
- tree search
- image compression
- language model
- constraint satisfaction
- vehicle routing problem
- monte carlo tree search
- machine learning
- monte carlo
- filter bank
- upper bound
- learning algorithm
- neural network