{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:10:13Z","timestamp":1654110613578},"reference-count":27,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7,1]]},"abstract":"<p>An intuitive way of color image segmentation is through clustering in which each pixel in an image is treated as a data point in the feature space. A feature space is effective if it can provide high distinguishability among objects in images. Typically, in the preprocessing phase, various modalities or feature spaces are considered, such as color, texture, intensity, and spatial information. Feature selection or reduction can also be understood as transforming the original feature space into a more distinguishable space (or subspaces) for distinguishing different content in an image. Most clustering-based image segmentation algorithms work in the full feature space while considering the tradeoff between efficiency and effectiveness. The authors\u2019 observation indicates that often time objects in images can be simply detected by applying clustering algorithms in subspaces. In this paper, they propose an image segmentation framework, named Hill-Climbing based Projective Clustering (HCPC), which utilizes EPCH (an efficient projective clustering technique by histogram construction) as the core framework and Hill-Climbing K-means (HC) for dense region detection, and thereby being able to distinguish image contents within subspaces of a given feature space. Moreover, a new feature space, named HSVrVgVb, is also explored which is derived from Hue, Saturation, and Value (HSV) color space. The scalability of the proposed algorithm is linear to the dimensionality of the feature space, and our segmentation results outperform that of HC and other projective clustering-based algorithms.<\/p>","DOI":"10.4018\/jmdem.2012070104","type":"journal-article","created":{"date-parts":[[2012,11,19]],"date-time":"2012-11-19T18:58:27Z","timestamp":1353351507000},"page":"66-82","source":"Crossref","is-referenced-by-count":0,"title":["Color Image Segmentation"],"prefix":"10.4018","volume":"3","author":[{"given":"Song","family":"Gao","sequence":"first","affiliation":[{"name":"The University of Alabama at Birmingham, USA"}]},{"given":"Chengcui","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of Alabama at Birmingham, USA"}]},{"given":"Wei-Bang","family":"Chen","sequence":"additional","affiliation":[{"name":"Virginia State University, USA"}]}],"member":"2432","reference":[{"key":"jmdem.2012070104-0","doi-asserted-by":"crossref","unstructured":"Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999). Fast algorithms for projected clustering. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 61-72).","DOI":"10.1145\/304181.304188"},{"key":"jmdem.2012070104-1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C. C., & Yu, P. S. (2000). Finding generalized projected clusters in high dimensional spaces. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 70-81).","DOI":"10.1145\/335191.335383"},{"key":"jmdem.2012070104-2","unstructured":"Duvenaud, D. (2010). Multiscale conditional random fields for machine vision (Unpublished master\u2019s thesis). The University of British Columbia, Vancouver, BC, Canada. Retrieved from http:\/\/mlg.eng.cam.ac.uk\/duvenaud\/papers\/multiscale_crf_thesis.pdf"},{"key":"jmdem.2012070104-3","author":"B.Everitt","year":"2012","journal-title":"Cluster analysis"},{"key":"jmdem.2012070104-4","unstructured":"Farabet, C., Couprie, C., Najman, L., & LeCun, Y. (2012). Scene parsing with multiscale feature learning, purity trees, and optimal covers. In Proceedings of the 29th International Conference on Machine Learning."},{"issue":"4","key":"jmdem.2012070104-5","first-page":"453","article-title":"On the histogram as a density estimator: L2 theory.","volume":"57","author":"D.Freedman","year":"1981","journal-title":"Probability Theory and Related Fields"},{"key":"jmdem.2012070104-6","doi-asserted-by":"crossref","unstructured":"Gao, S., Zhang, C., & Chen, W.-B. (2010). A variable bin width histogram based image clustering algorithm. In Proceedings of the 4th IEEE International Conference on Semantic Computing (pp. 166-171).","DOI":"10.1109\/ICSC.2010.25"},{"key":"jmdem.2012070104-7","unstructured":"Gao, S., Zhang, C., & Chen, W.-B. (2011). Identifying image spam authorship with a variable bin width histogram-based projective clustering. In Proceedings of the IEEE International Conference on Multimedia and Expo (pp. 1-6)."},{"key":"jmdem.2012070104-8","first-page":"402","author":"J. W.Han","year":"2005","journal-title":"Data mining: Concepts and techniques"},{"key":"jmdem.2012070104-9","unstructured":"Hinneburg, A., & Keim, D. A. (1999). Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In Proceedings of the 25th International Conference on Very Large Data Bases (pp. 506-517)."},{"key":"jmdem.2012070104-10","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"jmdem.2012070104-11","doi-asserted-by":"crossref","unstructured":"Kim, T., Lee, K., & Lee, S. (2010). Learning full pairwise affinities for spectral segmentation. In Proceedings of the 23rd IEEE Conference on Computer Vision and Pattern Recognition (pp. 2101-2108).","DOI":"10.1109\/CVPR.2010.5539888"},{"key":"jmdem.2012070104-12","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"key":"jmdem.2012070104-13","unstructured":"Li, Z., Wu, X., & Chang, S. (2012). Segmentation using superpixels: A bipartite graph partitioning approach. In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (pp. 789-796)."},{"key":"jmdem.2012070104-14","first-page":"284","author":"D. J. C.MacKay","year":"2003","journal-title":"Information theory, inference and learning algorithms"},{"key":"jmdem.2012070104-15","doi-asserted-by":"crossref","unstructured":"Mori, G. (2005). Guiding model search using segmentation. In Proceedings of the 10th IEEE International Conference on Computer Vision (pp. 1417-1423).","DOI":"10.1109\/ICCV.2005.112"},{"key":"jmdem.2012070104-16","unstructured":"Mori, G., Ren, X., Efros, A., & Malik, J. (2004). Recovering human body configurations: Combining segmentation and recognition. In Proceedings of the IEEE Computer Vision and Pattern Recognition."},{"key":"jmdem.2012070104-17","unstructured":"Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. In Neural Information Processing Foundation (Eds.), Advances in neural information processing systems (pp. 849-856). Cambridge, MA: MIT Press."},{"key":"jmdem.2012070104-18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.47"},{"key":"jmdem.2012070104-19","unstructured":"Ohashi, T., Aghbari, Z., & Makinouchi, A. (2003). Hillclimbing algorithm for efficient color-based image segmentation. In Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition, and Applications."},{"key":"jmdem.2012070104-20","doi-asserted-by":"crossref","unstructured":"Osborne, J. D., Gao, S., Chen, W.-B., Andea, A., & Zhang, C. (2011). Machine classification of melanoma and nevi from skin lesions. In Proceedings of the ACM Symposium on Applied Computing (pp. 100-105).","DOI":"10.1145\/1982185.1982210"},{"key":"jmdem.2012070104-21","doi-asserted-by":"crossref","unstructured":"Ren, X., & Malik, J. (2003). Learning a classification model for segmentation. In Proceedings of the 9th International Conference on Computer Vision (pp. 10-17).","DOI":"10.1109\/ICCV.2003.1238308"},{"key":"jmdem.2012070104-22","first-page":"111","author":"S.Russell","year":"2003","journal-title":"Artificial intelligence: A modern approach"},{"key":"jmdem.2012070104-23","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316849"},{"key":"jmdem.2012070104-24","doi-asserted-by":"publisher","DOI":"10.1002\/wics.35"},{"key":"jmdem.2012070104-25","first-page":"279","author":"L. G.Shapiro","year":"2011","journal-title":"Computer vision"},{"key":"jmdem.2012070104-26","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"}],"container-title":["International Journal of Multimedia Data Engineering and Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=72893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T18:41:44Z","timestamp":1654108904000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jmdem.2012070104"}},"subtitle":["From the View of Projective Clustering"],"short-title":[],"issued":{"date-parts":[[2012,7,1]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jmdem.2012070104","relation":{},"ISSN":["1947-8534","1947-8542"],"issn-type":[{"value":"1947-8534","type":"print"},{"value":"1947-8542","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,1]]}}}