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

We consider the problem of image representation and clustering. Traditionally, an n1 x n2 image is represented by a vector in the Euclidean space R n1 x n2. Some learning algorithms are then applied to these vectors in such a high dimensional space for dimensionality reduction, classification, and clustering. However, an image is intrinsically a matrix, or the second order tensor. The vector representation of the images ignores the spatial relationships between the pixels in an image. In this paper, we introduce a tensor framework for image analysis. We represent the images as points in the tensor space Rn1 mathcal Rn2 which is a tensor product of two vector spaces. Based on the tensor representation, we propose a novel image representation and clustering algorithm which explicitly considers the manifold structure of the tensor space. By preserving the local structure of the data manifold, we can obtain a tensor subspace which is optimal for data representation in the sense of local isometry. We call it TensorImage approach. Traditional clustering algorithm such as k-means is then applied in the tensor subspace. Our algorithm shares many of the data representation and clustering properties of other techniques such as Locality Preserving Projections, Laplacian Eigenmaps, and spectral clustering, yet our algorithm is much more computationally efficient. Experimental results show the efficiency and effectiveness of our algorithm.

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.

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.

Graph-based parallel large scale structure from motion

Estimating wheat biomass by combining image clustering with crop height

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.

Quantitative contrast of urban agglomeration colors based on image clustering algorithm: Case study of the Xia-Zhang-Quan metropolitan area

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.

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.

While the image was sewed in cloth with thread or was made a physical model by 3D printer, the colors of the thread or the material of the 3D printer was limit, to simplify the manufacture processing. Although the conventional image clustering algorithm can segment the image into seldom clusters and give each cluster a specific color that decrease most colors and preserver the main feature. However the contour will be cluster in many clusters induce by the color gradient of the contour. This paper proposed a clustering algorithm based on involved spatial distance to assign the contour a consistent color. The experimental shown that the proposed algorithm had cluster quality more than 90%, the maximum improvement was 57% that com-pared with the conventional clustering algorithm.

GX-Means: A model-based divide and merge algorithm for geospatial image clustering

Image segmentation is an important task in computer vision. Clustering is a common image segmentation approach which divides an image into homogeneous regions, but conventional clustering algorithms such as k-means have a tendency of getting stuck in local optima. In this paper, we propose a novel clustering algorithm based on the Self-Organizing Migrating Algorithm (SOMA). In particular, we adopt SOMA Team To Team Adaptive (SOMA T3A), a recent variant of SOMA, to image clustering. Experimental results on a set of benchmark images show excellent image clustering performance, also in comparison to other state-of-the-art metaheuristics.

Image segmentation plays an important role in machine vision, image recognition, and imaging applications. Based on the fuzzy c-means clustering algorithm, a kernel-distance-based intuitionistic fuzzy c-means clustering (KIFCM) algorithm is proposed. First, a fuzzy complement operator is used to generate the membership degree whereby the hesitation degree of intuitionistic fuzzy set is generated; second, a kernel-induced function is used to calculate the distance from each point to the cluster center instead of the Euclidean distance; third, a new objective function that includes the hesitation degree is established, and the optimization of the objective function results in new iterative expressions for the membership degree and the cluster center. The proposed KIFCM algorithm is compared with the fuzzy c-means clustering (FCM) algorithm, the kernel fuzzy c-means clustering (KFCM) algorithm, and the intuitionistic fuzzy c-means clustering (IFCM) algorithm in segmenting five images. The experimental results verify the effectiveness and superiority of our proposed KIFCM algorithm.

We are mapping an image clustering algorithm onto an FPGA- based computer system. Our approach processes raw pixel data in the red, green, blue color space and generates an output image where all pixels are assigned to classes. A class is a group of pixels with similar color and location. These classes are then used as the basis of further processing to generate tags. The tags, in turn, are used to generate queries for searching libraries of digital images. We run our image tagging approach on an FPGA-based computing machine. The image clustering algorithm is run on an FPGA board, and only the classified image is communicated to the host PC. Further processing is run on the host. Our experimental system consists of an Annapolis Wildforce board with four Xilinx XC4000 chips and a PCI connection to a host PC. Our implementation allows the raw image data to stay local to the FPGAs, and only the class image is communicated to the host PC. The classified pixels are then used to generate tags which can be used for searching a digital library. This approach allows us to parallelize the image processing on the FPGA board, and to minimize the data handled by the PC. FPGA platforms are ideally suited for this sort of initial processing of images. The large amount of image data can be preprocessed by exploiting the inherent parallelism available in FPGA architectures, keeping unnecessary data off the host processor. The result of our algorithm is a reduction by up to a factor of six in the number of bits required to represent each pixel. The output data is passed to the host PC, thus reducing the processing and memory resources needed compared to handling the raw data on the PC. The process of generating tags of images is simplified by first classifying pixels on an FPGA-based system, and digital library search is accelerated.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.