Improving Image Clustering through Sample Ranking and Its Application to
remote--sensing images
- URL: http://arxiv.org/abs/2209.12621v1
- Date: Mon, 26 Sep 2022 12:10:02 GMT
- Title: Improving Image Clustering through Sample Ranking and Its Application to
remote--sensing images
- Authors: Qinglin Li, Guoping Qiu
- Abstract summary: We propose a novel method by first ranking samples within each cluster based on the confidence in their belonging to the current cluster.
For ranking the samples, we developed a method for computing the likelihood of samples belonging to the current clusters based on whether they are situated in densely populated neighborhoods.
We show that our method can be effectively applied to remote-sensing images.
- Score: 14.531733039462058
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Image clustering is a very useful technique that is widely applied to various
areas, including remote sensing. Recently, visual representations by
self-supervised learning have greatly improved the performance of image
clustering. To further improve the well-trained clustering models, this paper
proposes a novel method by first ranking samples within each cluster based on
the confidence in their belonging to the current cluster and then using the
ranking to formulate a weighted cross-entropy loss to train the model. For
ranking the samples, we developed a method for computing the likelihood of
samples belonging to the current clusters based on whether they are situated in
densely populated neighborhoods, while for training the model, we give a
strategy for weighting the ranked samples. We present extensive experimental
results that demonstrate that the new technique can be used to improve the
State-of-the-Art image clustering models, achieving accuracy performance gains
ranging from $2.1\%$ to $15.9\%$. Performing our method on a variety of
datasets from remote sensing, we show that our method can be effectively
applied to remote--sensing images.
Related papers
- Image Clustering Algorithm Based on Self-Supervised Pretrained Models and Latent Feature Distribution Optimization [4.39139858370436]
This paper introduces an image clustering algorithm based on self-supervised pretrained models and latent feature distribution optimization.
Our approach outperforms the latest clustering algorithms and achieves state-of-the-art clustering results.
arXiv Detail & Related papers (2024-08-04T04:08:21Z) - Local Clustering for Lung Cancer Image Classification via Sparse Solution Technique [1.07793546088014]
We view images as the vertices in a weighted graph and the similarity between a pair of images as the edges in the graph.
Our approach is significantly more efficient and either favorable or equally effective compared with other state-of-the-art approaches.
arXiv Detail & Related papers (2024-07-11T18:18:32Z) - Reinforcing Pre-trained Models Using Counterfactual Images [54.26310919385808]
This paper proposes a novel framework to reinforce classification models using language-guided generated counterfactual images.
We identify model weaknesses by testing the model using the counterfactual image dataset.
We employ the counterfactual images as an augmented dataset to fine-tune and reinforce the classification model.
arXiv Detail & Related papers (2024-06-19T08:07:14Z) - Deep Domain Adaptation: A Sim2Real Neural Approach for Improving Eye-Tracking Systems [80.62854148838359]
Eye image segmentation is a critical step in eye tracking that has great influence over the final gaze estimate.
We use dimensionality-reduction techniques to measure the overlap between the target eye images and synthetic training data.
Our methods result in robust, improved performance when tackling the discrepancy between simulation and real-world data samples.
arXiv Detail & Related papers (2024-03-23T22:32:06Z) - Convolutional autoencoder-based multimodal one-class classification [80.52334952912808]
One-class classification refers to approaches of learning using data from a single class only.
We propose a deep learning one-class classification method suitable for multimodal data.
arXiv Detail & Related papers (2023-09-25T12:31:18Z) - Consistency Regularization for Generalizable Source-free Domain
Adaptation [62.654883736925456]
Source-free domain adaptation (SFDA) aims to adapt a well-trained source model to an unlabelled target domain without accessing the source dataset.
Existing SFDA methods ONLY assess their adapted models on the target training set, neglecting the data from unseen but identically distributed testing sets.
We propose a consistency regularization framework to develop a more generalizable SFDA method.
arXiv Detail & Related papers (2023-08-03T07:45:53Z) - Clustering by Maximizing Mutual Information Across Views [62.21716612888669]
We propose a novel framework for image clustering that incorporates joint representation learning and clustering.
Our method significantly outperforms state-of-the-art single-stage clustering methods across a variety of image datasets.
arXiv Detail & Related papers (2021-07-24T15:36:49Z) - Graph Contrastive Clustering [131.67881457114316]
We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method.
Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features.
On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
arXiv Detail & Related papers (2021-04-03T15:32:49Z) - Unifying Remote Sensing Image Retrieval and Classification with Robust
Fine-tuning [3.6526118822907594]
We aim at unifying remote sensing image retrieval and classification with a new large-scale training and testing dataset, SF300.
We show that our framework systematically achieves a boost of retrieval and classification performance on nine different datasets compared to an ImageNet pretrained baseline.
arXiv Detail & Related papers (2021-02-26T11:01:30Z) - Deep Transformation-Invariant Clustering [24.23117820167443]
We present an approach that does not rely on abstract features but instead learns to predict image transformations.
This learning process naturally fits in the gradient-based training of K-means and Gaussian mixture model.
We demonstrate that our novel approach yields competitive and highly promising results on standard image clustering benchmarks.
arXiv Detail & Related papers (2020-06-19T13:43:08Z)
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.