A consensus-constrained parsimonious Gaussian mixture model for clustering hyperspectral images

• URL: http://arxiv.org/abs/2403.03349v1
• Date: Tue, 5 Mar 2024 22:23:43 GMT
• Title: A consensus-constrained parsimonious Gaussian mixture model for clustering hyperspectral images
• Authors: Ganesh Babu, Aoife Gowen, Michael Fop, Isobel Claire Gormley
• Abstract summary: Food engineers use hyperspectral images to classify the type and quality of a food sample. In order to train these methods, every pixel in each training image needs to be labelled. A consensus-constrained parsimonious Gaussian mixture model (ccPGMM) is proposed to label pixels in hyperspectral images.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The use of hyperspectral imaging to investigate food samples has grown due to the improved performance and lower cost of spectroscopy instrumentation. Food engineers use hyperspectral images to classify the type and quality of a food sample, typically using classification methods. In order to train these methods, every pixel in each training image needs to be labelled. Typically, computationally cheap threshold-based approaches are used to label the pixels, and classification methods are trained based on those labels. However, threshold-based approaches are subjective and cannot be generalized across hyperspectral images taken in different conditions and of different foods. Here a consensus-constrained parsimonious Gaussian mixture model (ccPGMM) is proposed to label pixels in hyperspectral images using a model-based clustering approach. The ccPGMM utilizes available information on the labels of a small number of pixels and the relationship between those pixels and neighbouring pixels as constraints when clustering the rest of the pixels in the image. A latent variable model is used to represent the high-dimensional data in terms of a small number of underlying latent factors. To ensure computational feasibility, a consensus clustering approach is employed, where the data are divided into multiple randomly selected subsets of variables and constrained clustering is applied to each data subset; the clustering results are then consolidated across all data subsets to provide a consensus clustering solution. The ccPGMM approach is applied to simulated datasets and real hyperspectral images of three types of puffed cereal, corn, rice, and wheat. Improved clustering performance and computational efficiency are demonstrated when compared to other current state-of-the-art approaches.

Related papers

• Hierarchical Homogeneity-Based Superpixel Segmentation: Application to Hyperspectral Image Analysis [11.612069983959985]
  We propose a multiscale superpixel method that is computationally efficient for processing hyperspectral data. The proposed hierarchical approach leads to superpixels of variable sizes but with higher spectral homogeneity. For validation, the proposed homogeneity-based hierarchical method was applied as a preprocessing step in the spectral unmixing and classification tasks.
  arXiv  Detail & Related papers  (2024-07-22T01:20:32Z)
• Superpixel Graph Contrastive Clustering with Semantic-Invariant Augmentations for Hyperspectral Images [64.72242126879503]
  Hyperspectral images (HSI) clustering is an important but challenging task. We first use 3-D and 2-D hybrid convolutional neural networks to extract the high-order spatial and spectral features of HSI. We then design a superpixel graph contrastive clustering model to learn discriminative superpixel representations.
  arXiv  Detail & Related papers  (2024-03-04T07:40:55Z)
• Rethinking cluster-conditioned diffusion models for label-free image synthesis [1.4624458429745086]
  Diffusion-based image generation models can enhance image quality when conditioned on ground truth labels. We investigate how individual clustering determinants, such as the number of clusters and the clustering method, impact image synthesis.
  arXiv  Detail & Related papers  (2024-03-01T14:47:46Z)
• Semi-supervised segmentation of land cover images using nonlinear canonical correlation analysis with multiple features and t-SNE [1.7000283696243563]
  Image segmentation is a clustering task whereby each pixel is assigned a cluster label. In this work, by resorting to label only a small quantity of pixels, a new semi-supervised segmentation approach is proposed. The proposed semi-supervised RBF-CCA algorithm has been implemented on several remotely sensed multispectral images.
  arXiv  Detail & Related papers  (2024-01-22T17:56:07Z)
• MB-RACS: Measurement-Bounds-based Rate-Adaptive Image Compressed Sensing Network [65.1004435124796]
  We propose a Measurement-Bounds-based Rate-Adaptive Image Compressed Sensing Network (MB-RACS) framework. Our experiments demonstrate that the proposed MB-RACS method surpasses current leading methods.
  arXiv  Detail & Related papers  (2024-01-19T04:40:20Z)
• Probabilistic Deep Metric Learning for Hyperspectral Image Classification [91.5747859691553]
  This paper proposes a probabilistic deep metric learning framework for hyperspectral image classification. It aims to predict the category of each pixel for an image captured by hyperspectral sensors. Our framework can be readily applied to existing hyperspectral image classification methods.
  arXiv  Detail & Related papers  (2022-11-15T17:57:12Z)
• On Mitigating Hard Clusters for Face Clustering [48.39472979642971]
  Face clustering is a promising way to scale up face recognition systems using large-scale unlabeled face images. We introduce two novel modules, Neighborhood-Diffusion-based Density (NDDe) and Transition-Probability-based Distance (TPDi) Our experiments on multiple benchmarks show that each module contributes to the final performance of our method.
  arXiv  Detail & Related papers  (2022-07-25T03:55:15Z)
• Dictionary learning for clustering on hyperspectral images [0.5584060970507506]
  We propose a method for clustering the pixels of hyperspectral images using sparse coefficients computed from a representative dictionary as features. We show empirically that the proposed method works more effectively than clustering on the original pixels.
  arXiv  Detail & Related papers  (2022-02-02T12:22:33Z)
• Superpixel Segmentation Based on Spatially Constrained Subspace Clustering [57.76302397774641]
  We consider each representative region with independent semantic information as a subspace, and formulate superpixel segmentation as a subspace clustering problem. We show that a simple integration of superpixel segmentation with the conventional subspace clustering does not effectively work due to the spatial correlation of the pixels. We propose a novel convex locality-constrained subspace clustering model that is able to constrain the spatial adjacent pixels with similar attributes to be clustered into a superpixel.
  arXiv  Detail & Related papers  (2020-12-11T06:18:36Z)
• Residual-Sparse Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet frames [146.63177174491082]
  Fuzzy $C$-Means (FCM) algorithm incorporates a morphological reconstruction operation and a tight wavelet frame transform. We present an improved FCM algorithm by imposing an $ell_0$ regularization term on the residual between the feature set and its ideal value. Experimental results reported for synthetic, medical, and color images show that the proposed algorithm is effective and efficient, and outperforms other algorithms.
  arXiv  Detail & Related papers  (2020-02-14T10:00:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.