Image clustering with tensor representation

Traditional image clustering algorithms deal with single-task clustering (STC) problem on a single domain. However, with the increasing number of related images on the Web, it is challenging for STCs to perform related image clustering tasks independently without considering the between-task relationship, which mainly consists of similar visual features and image patterns among tasks. Therefore, it is intuitive to resort to multi-task clustering (MTC) algorithms. However, most existing MTCs learn a shared feature subspace, which may lead to negative transfer when facing the image clustering tasks that are not strongly related. In this paper, we propose a novel multi-task image clustering algorithm, which performs multiple image clustering tasks simultaneously and propagates the task correlation to improve clustering performance. Specifically, we first extend the information bottleneck method to cluster tasks independently. The related and unrelated images between the pairwise clusters of different tasks are then discovered. Meanwhile, two corresponding types of correlations are propagated among the tasks, where only the positive correlation benefits the clustering of each task. A sequential and collaborative method is further designed to ensure an optimal solution. Moreover, we perform a theoretical analysis of the properties on correlation propagation and the convergence of our algorithm. The experimental results demonstrate that the proposed algorithm outperforms the state-of-the-art clustering methods.

In this paper, we propose a new image clustering algorithm, referred to as clustering using local discriminant models and global integration (LDMGI). To deal with the data points sampled from a nonlinear manifold, for each data point, we construct a local clique comprising this data point and its neighboring data points. Inspired by the Fisher criterion, we use a local discriminant model for each local clique to evaluate the clustering performance of samples within the local clique. To obtain the clustering result, we further propose a unified objective function to globally integrate the local models of all the local cliques. With the unified objective function, spectral relaxation and spectral rotation are used to obtain the binary cluster indicator matrix for all the samples. We show that LDMGI shares a similar objective function with the spectral clustering (SC) algorithms, e.g., normalized cut (NCut). In contrast to NCut in which the Laplacian matrix is directly calculated based upon a Gaussian function, a new Laplacian matrix is learnt in LDMGI by exploiting both manifold structure and local discriminant information. We also prove that K-means and discriminative K-means (DisKmeans) are both special cases of LDMGI. Extensive experiments on several benchmark image datasets demonstrate the effectiveness of LDMGI. We observe in the experiments that LDMGI is more robust to algorithmic parameter, when compared with NCut. Thus, LDMGI is more appealing for the real image clustering applications in which the ground truth is generally not available for tuning algorithmic parameters.

Estimating wheat biomass by combining image clustering with crop height

Hyperspectral image (HSI) clustering has been widely used in the field of remote sensing. However, most traditional clustering algorithms are not suitable for dealing with large-scale HSI due to their low clustering performance and high computational complexity. In this letter, we propose a novel fuzzy clustering algorithm, called fuzzy embedded clustering based on the bipartite graph (FECBG), to efficiently deal with large-scale HSI clustering problems. First, we propose the FECBG method that incorporates fuzzy clustering with the nonnegative regularization term based on the bipartite graph into a unified model, which has good clustering performance and reduces the sensitivity of fuzzy clustering to the initial cluster centers. Second, we adopt the fast spectral embedded method to obtain the low-dimensional representation of HSI data, to reduce the computational complexity. At last, we add the nonnegative regularization term based on the bipartite graph to fuzzy clustering, to constrain the solution space of the fuzzy membership matrix. Experimental results on several HSI data sets have demonstrated the efficiency and effectiveness of the proposed FECBG algorithm.

Simulated annealing spectral clustering algorithm for image segmentation

Complete and high-quality labeled dataset is indispensable for image classification. Considering the often arduous task of data labeling, clustering algorithms are commonly utilized in the preliminary stages of data classification to perform preliminary categorization. Traditional clustering algorithms, such as K-means and Gaussian Mixture Model, often struggle to effectively cluster images. In this paper, we propose a novel image clustering method utilizing teacher-student model and autoencoder. Specifically, the teacher model is a fully connected autoencoder and the student model consists of multiple convolutional autoencoders. We firstly obtain sub-datasets by applying the K-means algorithm to cluster the output of the teacher model, then utilize the student model to achieve clustering through an iterative data exchange method where the same data can converge. In addition, the proposed method can filter low-quality data to a certain extent by recording the frequency of exchanges because clustering is achieved during multiple exchanges of data. Experiments on a synthetic dataset and three benchmark image datasets (MNIST, FashionMNIST and USPS) show that our method can achieve satisfactory clustering results.

Graph-based parallel large scale structure from motion

This paper proposes a new method for image clustering based on fuzzy mutual information. A new Particle Swarm Optimization based on diversity of symmetrical distribution (sdPSO) is adopt as optimization algorithm and the object function is based upon the fuzzy mutual information and cluster distance measure optimum between the original image and the one after clustering segmentation. Appling the method into a noised medical image, the result image has clear and continuous boundary and keeps complete internal characteristics. By comparing with the other image clustering algorithms, experimental results show that the image segmentation quality of this method is improved obviously.

Previous chapter Next chapter Full AccessProceedings Proceedings of the 2007 SIAM International Conference on Data Mining (SDM)Incremental Spectral Clustering With Application to Monitoring of Evolving Blog CommunitiesHuazhong Ning, Wei Xu, Yun Chi, Yihong Gong, and Thomas HuangHuazhong Ning, Wei Xu, Yun Chi, Yihong Gong, and Thomas Huangpp.261 - 272Chapter DOI:https://doi.org/10.1137/1.9781611972771.24PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm. The existing spectral clustering algorithms are all off-line algorithms, i.e., they can not incrementally update the clustering result given a small change of the data set. However, the capability of incrementally updating is essential to some applications such as real time monitoring of the evolving communities of websphere or blogsphere. Unlike traditional stream data, these applications require incremental algorithms to handle not only insertion/deletion of data points but also similarity changes between existing items. This paper extends the standard spectral clustering to such evolving data by introducing the incidence vector/matrix to represent two kinds of dynamics in the same framework and by incrementally updating the eigenvalue system. Our incremental algorithm, initialized by a standard spectral clustering, continuously and efficiently updates the eigenvalue system and generates instant cluster labels, as the data set is evolving. The algorithm is applied to a blog data set. Compared with recomputation of the solution by standard spectral clustering, it achieves similar accuracy but with much lower computational cost. Close inspection into the blog content shows that the incremental approach can discover not only the stable blog communities but also the evolution of the individual multi-topic blogs. Previous chapter Next chapter RelatedDetails Published:2007ISBN:978-0-89871-630-6eISBN:978-1-61197-277-1 https://doi.org/10.1137/1.9781611972771Book Series Name:ProceedingsBook Code:PR127Book Pages:xiv + 648Key words:Incremental clustering, Spectral Clustering, Incidence Vector/Matrix, Web-blogs

As one kind of popular application in computer vision, image clustering has attracted many attentions. Some machine learning algorithms have been widely employed, such as K-Means, Non-negative Matrix Factorization (NMF), Graph regularized Non-negative Matrix Factorization (GNMF) and Locally Consistent Concept Factorization (LCCF). These methods possess respective strength and weakness. The common problem existing in these clustering algorithms is that they only use one kind of feature. However, different kinds of features complement each other and can be used to improve performance results. In this paper, in order to make use of the complementarity between different features, we propose an image representation method based on multi-features. Clustering results on several benchmark image data sets show that the proposed scheme outperforms some classical methods.

A enhanced fuzzy clustering algorithm for probability density functions and image clustering using Inception Resnet-v2 features

Based on the traditional grid density clustering algorithm, proposing A Data Stream Clustering Algorithm Based on Density and Extended Grid(DEGDS). The algorithm combines the advantages of grid clustering algorithm and density clustering algorithm, by improving the defects of clustering parameters by artificially set, get any shape of the cluster. The algorithm uses the local density of each sample point and the distance from the other sample points, determining the number of clustering centers in the grid, and realizing the automatic determination of the clustering center, which avoids the influence of improper selection of initial centroid on clustering results. And in the process of combining the Spark parallel framework for partitioning the data to achieve its parallelization. For data points clustered outside the grid, the clustering within the grid has been effectively expanded by extending the grid, to ensure the accuracy of clustering. Introduced density estimation is connected and grid boundaries to merging grid, saving memory consumption. Using the attenuation factor to incremental update grid density, reflect the evolution of spatial data stream. The experimental results show that compared with the traditional clustering algorithm, the DEGDS algorithm has a large performance improvement in accuracy and efficiency, and can be effectively for large data clustering.

By cooperatively learning features and assigning clusters, deep clustering is superior to conventional clustering algorithms. Numerous deep clustering algorithms have been developed for a variety of application levels; however, the majority are still incapable of learning robust noise-resistant latent features, which limits the clustering performance. To address this open research challenge, we introduce, for the first time, a new approach called: Robust Deep Embedded Image Clustering algorithm with Separable Krawtchouk and Hahn Moments (RDEICSKHM). Our approach leverages the advantages of Krawtchouk and Hahn moments, such as local feature extraction, discrete orthogonality, and noise tolerance, to obtain a meaningful and robust image representation. Moreover, we employ LayerNormalization to further improve the latent space quality and facilitate the clustering process. We evaluate our approach on four image datasets: MNIST, MNIST-test, USPS, and Fashion-MNIST. We compare our method with several deep clustering methods based on two metrics: clustering accuracy (ACC) and normalized mutual information (NMI). The experimental results show that our method achieves superior or competitive performance on all datasets, demonstrating its effectiveness and robustness for deep image clustering.

Semi-supervised or constrained clustering refers to clustering data instances in the presence of very limited supervisory information. Although it has been widely investigated in traditional clustering algorithms such as k-means, hierarchical and spectral clustering, little research has addressed the problem of incorporating such knowledge into swarm-intelligence based clustering algorithms. In this study, we present a new Constrained Ant Clustering Algorithm (CACA) with its application to the task of aspect category identification in product reviews, a central clustering task in Aspect-Based Sentiment Analysis (ABSA). We validate our CACA on benchmark datasets, and we show its effectiveness to real-world datasets for ABSA.

Most existing object-based image retrieval systems are based on single object matching, with its main limitation being that one individual image region (object) can hardly represent the user’s retrieval target, especially when more than one object of interest is involved in the retrieval. Integrated Region Matching (IRM) has been used to improve the retrieval accuracy by evaluating the overall similarity between images and incorporating the properties of all the regions in the images. However, IRM does not take the user’s preferred regions into account and has undesirable time complexity. In this article, we present a Feedback-based Image Clustering and Retrieval Framework (FIRM) using a novel image clustering algorithm and integrating it with Integrated Region Matching (IRM) and Relevance Feedback (RF). The performance of the system is evaluated on a large image database, demonstrating the effectiveness of our framework in catching users’ retrieval interests in object-based image retrieval.