Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017 (2017), Article ID 3696850, 11 pages
https://doi.org/10.1155/2017/3696850
Research Article

A Clustering Method for Data in Cylindrical Coordinates

1University of Electro-Communications, 1-5-1 Chofugaoka, Chofu, Tokyo 182-8585, Japan
2Department of Computer and Information Engineering, National Institute of Technology, Tsuyama College, 654-1 Numa, Tsuyama, Okayama 708-8506, Japan

Correspondence should be addressed to Kazuhisa Fujita

Received 7 April 2017; Revised 18 July 2017; Accepted 16 August 2017; Published 27 September 2017

Academic Editor: Ivan Giorgio

Copyright © 2017 Kazuhisa Fujita. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. M. Anderson-Cook and B. S. Otieno, “Cylindrical data,” Ecological Statistics, 2013. View at Google Scholar
  2. N.-Y. An and C.-M. Pun, “Color image segmentation using adaptive color quantization and multiresolution texture characterization,” Signal, Image and Video Processing, vol. 8, no. 5, pp. 943–954, 2014. View at Publisher · View at Google Scholar · View at Scopus
  3. J. B. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281–297, University of California Press, Berkeley, Calif, USA, 1967. View at Google Scholar · View at MathSciNet
  4. X. Wu, V. Kumar, J. R. Quinlan et al., “Top 10 algorithms in data mining,” Knowledge and Information Systems, vol. 14, no. 1, pp. 1–37, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. I. S. Dhillon and D. S. Modha, “Concept decompositions for large sparse text data using clustering,” Machine Learning, vol. 42, no. 1-2, pp. 143–175, 2001. View at Publisher · View at Google Scholar · View at Scopus
  6. A. Banerjee, I. Dhillon, J. Ghosh, and S. Sra, “Generative model-based clustering of directional data,” in Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '03, pp. 19–28, New York, NY, USA, August 2003. View at Publisher · View at Google Scholar · View at Scopus
  7. A. Banerjee, I. S. Dhillon, J. Ghosh, and S. Sra, “Clustering on the unit hypersphere using von Mises-Fisher distributions,” Journal of Machine Learning Research, vol. 6, pp. 1345–1382, 2005. View at Google Scholar · View at MathSciNet
  8. M. Girolami, “Mercer kernel-based clustering in feature space,” IEEE Transactions on Neural Networks, vol. 13, no. 3, pp. 780–784, 2002. View at Publisher · View at Google Scholar · View at Scopus
  9. A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering: analysis and an algorithm,” in Advances in Neural Information Processing Systems, pp. 849–856, MIT Press, Cambridge, Mass, USA, 2001. View at Google Scholar
  10. A. Ben-Hur, D. Horn, H. T. Siegelmann, and V. Vapnik, “Support vector clustering,” Journal of Machine Learning Research, vol. 2, pp. 125–137, 2002. View at Google Scholar
  11. B. E. Boser, I. M. Guyon, and V. N. Vapnik, “Training algorithm for optimal margin classifiers,” in Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory (COLT '92), pp. 144–152, New York, NY, USA, July 1992. View at Scopus
  12. Y. Deng and B. S. Manjunath, “Unsupervised segmentation of color-texture regions in images and video,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 8, pp. 800–810, 2001. View at Publisher · View at Google Scholar · View at Scopus
  13. C.-K. Yang and W.-H. Tsai, “Color image compression using quantization, thresholding, and edge detection techniques all based on the moment-preserving principle,” Pattern Recognition Letters, vol. 19, no. 2, pp. 205–215, 1998. View at Publisher · View at Google Scholar · View at Scopus
  14. N.-C. Yang, W.-H. Chang, C.-M. Kuo, and T.-H. Li, “A fast MPEG-7 dominant color extraction with new similarity measure for image retrieval,” Journal of Visual Communication and Image Representation, vol. 19, no. 2, pp. 92–105, 2008. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Heckbert, “Color image quantization for frame buffer display,” Computer Graphics, vol. 16, no. 3, pp. 297–307, 1982. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Emre Celebi, “Improving the performance of k-means for color quantization,” Image and Vision Computing, vol. 29, no. 4, pp. 260–271, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. D. Özdemir and L. Akarun, “A fuzzy algorithm for color quantization of images,” Pattern Recognition, vol. 35, no. 8, pp. 1785–1791, 2002. View at Publisher · View at Google Scholar · View at Scopus
  18. X. Zhao, Y. Li, and Q. Zhao, “Mahalanobis distance based on fuzzy clustering algorithm for image segmentation,” Digital Signal Processing: A Review Journal, vol. 43, pp. 8–16, 2015. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Atsalakis, N. Papamarkos, N. Kroupis, D. Soudris, and A. Thanailakis, “Colour quantisation technique based on image decomposition and its embedded system implementation,” in Proceedings of the Vision, Image and Signal Processing, IEE Proceedings, vol. 151, pp. 511–524. View at Publisher · View at Google Scholar · View at Scopus
  20. C.-H. Chang, P. Xu, R. Xiao, and T. Srikanthan, “New adaptive color quantization method based on self-organizing maps,” IEEE Transactions on Neural Networks, vol. 16, no. 1, pp. 237–249, 2005. View at Publisher · View at Google Scholar · View at Scopus
  21. E. J. Palomo and E. Domínguez, “Hierarchical color quantization based on self-organization,” Journal of Mathematical Imaging and Vision, vol. 49, no. 1, pp. 1–19, 2014. View at Publisher · View at Google Scholar · View at Scopus
  22. M. G. Omran, A. P. Engelbrecht, and A. Salman, “A color image quantization algorithm based on particle swarm optimization,” Informatica, vol. 29, no. 3, pp. 261–269, 2005. View at Google Scholar · View at Scopus
  23. S. Sra, “A short note on parameter approximation for von Mises-Fisher distributions: and a fast implementation of Is(x),” Computational Statistics, vol. 27, no. 1, pp. 177–190, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  24. K. Y. Yeung and W. L. Ruzzo, “Details of the adjusted rand index and clustering algorithms, supplement to the paper "Principal component analysis for clustering gene expression data",” Bioinformatics, vol. 17, no. 9, pp. 763–774, 2001. View at Google Scholar
  25. H. Li, J. Cai, T. N. A. Nguyen, and J. Zheng, “A benchmark for semantic image segmentation,” in Proceedings of the 2013 IEEE International Conference on Multimedia and Expo, ICME 2013, July 2013. View at Publisher · View at Google Scholar · View at Scopus
  26. D. Martin, C. Fowlkes, D. Tal, and J. Malik, “A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics,” in Proceedings of the 8th International Conference on Computer Vision, pp. 416–423, July 2001. View at Scopus
  27. D. Arthur and S. Vassilvitskii, “k-means++: the advantages of careful seeding,” in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, Society for Industrial and Applied Mathematics, pp. 1027–1035, Philadelphia, PA, USA, 2007. View at MathSciNet
  28. D. DeSieno, “Adding a conscience to competitive learning,” in Proceedings of 1993 IEEE International Conference on Neural Networks (ICNN '93), pp. 117–124 vol.1, San Diego, CA, USA, March 1993. View at Publisher · View at Google Scholar
  29. C.-D. Wang, J.-H. Lai, and J.-Y. Zhur, “A conscience on-line learning approach for kernel-based clustering,” in Proceedings of the 10th IEEE International Conference on Data Mining, ICDM 2010, pp. 531–540, December 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. C.-D. Wang, J.-H. Lai, and J.-Y. Zhu, “Conscience online learning: An efficient approach for robust kernel-based clustering,” Knowledge and Information Systems, vol. 31, no. 1, pp. 79–104, 2012. View at Publisher · View at Google Scholar · View at Scopus
  31. L. Xu, A. Krzyżak, and E. Oja, “Rival penalized competitive learning for clustering analysis, rbf net, and curve detection,” IEEE Transactions on Neural Networks, vol. 4, no. 4, pp. 636–649, 1993. View at Publisher · View at Google Scholar · View at Scopus
  32. T. M. Nair, C. L. Zheng, J. L. Fink, R. O. Stuart, and M. Gribskov, “Rival penalized competitive learning (RPCL): a topology-determining algorithm for analyzing gene expression data,” Computational Biology and Chemistry, vol. 27, no. 6, pp. 565–574, 2003. View at Publisher · View at Google Scholar · View at Scopus