Adaptive two-dimensional embedded image clustering

8Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

With the rapid development of mobile devices, people are generating huge volumes of images data every day for sharing on social media, which draws much research attention to understanding the contents of images. Image clustering plays an important role in image understanding systems. Often, most of the existing image clustering algorithms flatten digital images that are originally represented by matrices into 1D vectors as the image representation for the subsequent learning. The drawbacks of vector-based algorithms include limited consideration of spatial relationship between pixels and computational complexity, both of which blame to the simple vectorized representation. To overcome the drawbacks, we propose a novel image clustering framework that can work directly on matrices of images instead of flattened vectors. Specifically, the proposed algorithm simultaneously learn the clustering results and preserve the original correlation information within the image matrix. To solve the challenging objective function, we propose a fast iterative solution. Extensive experiments have been conducted on various benchmark datasets. The experimental results confirm the superiority of the proposed algorithm.

Cite

CITATION STYLE

APA

Li, Z., Yao, L., Wang, S., Kanhere, S., Li, X., & Zhang, H. (2020). Adaptive two-dimensional embedded image clustering. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 4796–4803). AAAI press. https://doi.org/10.1609/aaai.v34i04.5914

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free