Fast Algorithm and Efficient Implementation of GMM-Based Pattern Classifiers
This paper proposes a fast decision algorithm in pattern classification based on Gaussian mixture models (GMM). Statistical pattern classification problems often meet a situation that comparison between probabilities is obvious and involve redundant computations. When GMM is adopted for the probability model, the exponential function should be evaluated. This work firstly reduces the exponential computations to simple and rough interval calculations. The exponential function is realized by scaling and multiplication with powers of two so that the decision is efficiently realized. For finer decision, a refinement process is also proposed. In order to verify the significance, experimental results on TI DM6437 EVM board and TED TB-3S-3400DSP-IMG board are shown through the application to a color extraction problem. It is verified that the classification was almost completed without any refinement process and the refinement process can proceed the residual decisions.
KeywordsPattern classification Gaussian mixture model Bayesian decision Efficient implementation color extraction
The authors would like to acknowledge the support from the Texas Instruments University program.
- 8.Shi, M., Bermak, A., Chandrasekaran, S., & Amira, A. (2006). An efficient FPGA implementation of Gaussian mixture models-based classifier using distributed arithmetic. In IEEE Proc. of int. conf. on electronics, circuits and systems ’06 (pp. 1276–1279).Google Scholar
- 10.Meyer-Baese, U. (2007). Digital signal processing with field programmable gate arrays (3rd edn.). New York: Springer.Google Scholar