References
- Tzu-Chuen Lu, and Ching-Yun Chang, "A Survey of VQ Codebook Generation," Journal of Information Hiding and Multimedia Signal Processing, vol. 1, no. 3, pp. 190-203, 2010.
- Gersho A, and Gray RM, "Vector Quantization and Signal Compression," Boston, MA: Kluwer Academic Publishers, 1991.
- Liaw YC, Lai JZC, and Lo W, "Image restoration of compressed image using classified vector quantiz ation," Pattern Recognition 35: 329-340, 2002 https://doi.org/10.1016/S0031-3203(01)00048-6
- Theodoridis S, and Koutroumbas, "Pattern Recognition. 2nd edn.," New York: Elsevier Academic Press, 2003.
- Lai JZC, and Liaw YC, "Fast-searching algorithm for vector quantization using projection and triangular inequality," IEEE Trans. Image Processing 13: 1554-1558, 2004 https://doi.org/10.1109/TIP.2004.837559
- C. W. Tsai, C. Y. Lee, M. C. Chiang, and C. S. Yang, "A Fast VQ Codebook Generation Algorithm via Pat tern Reduction, Pattern Recognition Letters", vol. 30, pp. 653-660, 2009. https://doi.org/10.1016/j.patrec.2009.02.003
- Xiao-Gang W, and Yue L, "Web mining based on user access patterns for web personalization," ISECS International Colloquium on Computing, Communication, Control, and Management. 1: 194-197, 2009.
- Gan G, Ma C, and Wu J, "Data Clustering: Theory, Algorithms, and Applications," Philadelphia, PA: SIAM, 2007.
- Krishnamoorthy R, Kalpana J, "Minimum distortion clustering technique for orthogonal polynomials tra nsform vector quantizer," Proc. 2011 Inter. Conf. Communication, Computing & Security. 443-448, 2011.
- Dumitrescu S, Wu X, "On properties of locally optimal multiple description scalar quantizers with convexcells," IEEE Trans. Inform. Theor. 55: 5591-5606, 2009. https://doi.org/10.1109/TIT.2009.2032831
- Lai JZC, and Lue CC, "Fast search algorithms for VQ codebook generation," J. Vis. Comm. Image Represent. 7: 163-168, 1996. https://doi.org/10.1006/jvci.1996.0016
- Huang CM, Bi Q, Stiles GS, and Harris RW, "Fast full search equivalent encoding algorithms for image compression using vector quantization", IEEE Trans. Image Process. 1: 413-416, 1992. https://doi.org/10.1109/83.148613
- Pelleg D, and Moore A, "Accelerating exact K-means algorithms with geometric reasoning," Proc. AC M SIGKDD. 277-281, 1999.
- Kanungo T, Mount D, Netanyahu N, Piatko C, and Silverman R, "An efficient K-means clustering algo rithm: Analysis and implementation," IEEE Trans. Pattern Anal. Mach. Intell. 24: 881-892, 2002. https://doi.org/10.1109/TPAMI.2002.1017616
- 김성재, 안철응, 김승호, "벡터 양자화를 위한 삼각 부등식을 이용하는 빠른 코드북 탐색법," 한국정보과학회 1998년도 가을 학술발표논문집 제25권 제2호(II), pp. 526-528, 1998.
- Charles Elkan, "Using the Triangle Inequality to Accelerate k-Means," Proceedings of the Twentieth International Conference on Machine Learning, 147-153, 2003.
- T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: an efficient data clustering method for very large databases," Proceedings of the ACM SIGMOD, pp. 103-114, 1996.
- A.W. Moore, "The anchors hierarchy: Using the tria ngle inequality to survive high dimensional data," Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence, pp. 397-405, 2000.
- KDDCUP 1993, www.cs.purdue.edu/commugrate/data/kddcpu/1998
- MNIST Dataset, yann.lecun.com/exdb/mnist
- Ji He, Man Lan, Chew-Lim Tan, Sam-Yuan Sung and Hwee-Boon Low, "Initialization of clusters refinement algorithms: a review and comparative study," International Joint Conference on Neural Networks, pp. 25-29, 2004.
Cited by
- Online VQ Codebook Generation using a Triangle Inequality vol.16, pp.3, 2015, https://doi.org/10.9728/dcs.2015.16.3.373
- Mathematical Thinking of Elementary School Students and Teacher Roles during Problem-Solving Process to Form the Concept of Triangle Inequality vol.28, pp.2, 2012, https://doi.org/10.29275/jerm.2018.05.28.2.203