Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for image clustering

Image clustering is an important but challenging task in machine learning. As in most image processing areas, the latest improvements came from models based on the deep learning approach. However, classical deep learning methods have problems to deal with spatial image transformations like scale and rotation. In this p…

2019-02-09abs ↗pdf ↗

We propose JECL, a method for clustering image-caption pairs by training parallel encoders with regularized clustering and alignment objectives, simultaneously learning both representations and cluster assignments. These image-caption pairs arise frequently in high-value applications where structured training data is e…

2019-01-04abs ↗pdf ↗

Traditional nearest points methods use all the samples in an image set to construct a single convex or affine hull model for classification. However, strong artificial features and noisy data may be generated from combinations of training samples when significant intra-class variations and/or noise occur in the image s…

2014-03-03abs ↗pdf ↗

Recently, deep clustering, which is able to perform feature learning that favors clustering tasks via deep neural networks, has achieved remarkable performance in image clustering applications. However, the existing deep clustering algorithms generally need the number of clusters in advance, which is usually unknown in…

2018-12-11abs ↗pdf ↗

MFCVAE clusters data over multiple facets, improving disentanglement and generation.

problem Clustering high-dimensional data like images over multiple characteristics.
method Variational autoencoder with hierarchical latent variables and Mixture-of-Gaussians priors.
result MFCVAE learns and clusters over multiple aspects of data in a disentangled manner.

Simplified image clustering achieves competitive results without text-based embeddings.

problem Complexity and resource requirements of state-of-the-art clustering methods.
method SCP: trains a small cluster head using pre-trained vision model features and positive data pairs.
result SCP achieves highly competitive performance on various benchmark datasets.

Method screens similar capsule endoscopic images, reducing doctor workload and improving accuracy.

problem Time-consuming and high error rate in manual inspection of large numbers of similar capsule endoscopic images.
method Structural similarity analysis of visually salient areas and hierarchical clustering.
result 76% reduction in similar images, 100% lesion recall, 18-minute average play time.

YuruGAN generates yuru-chara images using GANs and clustering for small datasets.

problem Generating high-quality yuru-chara images with limited data.
method Class conditional GAN with clustering and data augmentation.
result Improved quality of generated yuru-chara images through clustering and data augmentation.

A new clustering method using deep neural networks with size constraints.

problem Clustering high-dimensional data like images, especially when similarity is not well captured by Euclidean distance.
method Rewriting kk-means as an optimal transport task, adding entropic regularization, and introducing constraints on cluster sizes.
result The proposed method outperforms state-of-the-art clustering methods in unsupervised accuracy.

The ability to characterize the color content of natural imagery is an important application of image processing. The pixel by pixel coloring of images may be viewed naturally as points in color space, and the inherent structure and distribution of these points affords a quantization, through clustering, of the color i…

2012-02-20abs ↗pdf ↗

A new method classifies high-dimensional images with minimal labels using diffusion geometry.

problem Classifying high-dimensional images efficiently and accurately.
method Spatially-regularized nonlinear diffusion geometry for clustering and active learning.
result High-accuracy labelings achieved with a very small number of training labels.

In this paper we present a new model and an algorithm for unsupervised clustering of 2-D data such as images. We assume that the data comes from a union of multilinear subspaces (UOMS) model, which is a specific structured case of the much studied union of subspaces (UOS) model. For segmentation under this model, we de…

2015-12-21abs ↗pdf ↗

We describe a new optimization scheme for finding high-quality correlation clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our a…

2012-08-02abs ↗pdf ↗

Detecting stellar clusters have always been an important research problem in Astronomy. Although images do not convey very detailed information in detecting stellar density enhancements, we attempt to understand if new machine learning techniques can reveal patterns that would assist in drawing better inferences from t…

2018-09-05abs ↗pdf ↗

Efficiently clusters data with weak assumptions, robust to contamination.

problem General-shaped clustering under weak parametric assumptions with data contamination.
method Two-step hybrid robust clustering algorithm combining trimmed k-means and hierarchical agglomeration.
result Outperforms state-of-the-art methods in various applications.

We propose a deep amortized clustering (DAC), a neural architecture which learns to cluster datasets efficiently using a few forward passes. DAC implicitly learns what makes a cluster, how to group data points into clusters, and how to count the number of clusters in datasets. DAC is meta-learned using labelled dataset…

2019-09-30abs ↗pdf ↗

New framework quantifies uncertainty in flexible density-based clustering.

problem Uncertainty quantification in clustering with non-parametric density estimation.
method Martingale posterior distributions and density-based clustering.
result Efficient GPU-compatible inference on clustering structures with uncertainty.

Proposes ConiVAT for better cluster assessment and clustering with background knowledge.

problem Challenges in cluster assessment and clustering with noise and bridge points.
method Uses background constraints to improve VAT/iVAT for complex datasets.
result Improves clustering accuracy and resolves issues with noise and bridge points.

Pixel intensity is a widely used feature for clustering and segmentation algorithms, the resulting segmentation using only intensity values might suffer from noises and lack of spatial context information. Wavelet transform is often used for image denoising and classification. We proposed a novel method to incorporate …

2019-07-05abs ↗pdf ↗

The paper introduces a statistical distance matrix for better feature representation and clustering.

problem Lack of detailed distance representation between feature elements.
method Extended traditional statistical distance to a matrix form (statistical distance matrix) and applied hierarchical clustering.
result The statistical distance matrix with clustering (Information Mandala) provides clearer and geometrically arranged feature representations.

This paper advocates a novel framework for segmenting a dataset in a Riemannian manifold MM into clusters lying around low-dimensional submanifolds of MM. Important examples of MM, for which the proposed clustering algorithm is computationally efficient, are the sphere, the set of positive definite matrices, and the…

2014-10-01abs ↗pdf ↗

Classical clustering algorithms typically either lack an underlying probability framework to make them predictive or focus on parameter estimation rather than defining and minimizing a notion of error. Recent work addresses these issues by developing a probabilistic framework based on the theory of random labeled point…

2018-06-02abs ↗pdf ↗

This paper explores how the latent structure affects clustering in GAN-generated data.

problem Achieving well-clustered data in GAN-generated spaces, especially with class imbalance.
method Derives conditions for faithful clustering in GANs, including multimodal latent space, latent space inversion, and cluster priors imposition.
result Necessary and sufficient conditions for clustering in GANs are identified, and their importance is demonstrated through ablative studies.

CDL index improves clustering validation for non-convex data.

problem Selecting clustering algorithms and hyperparameters without labeled data.
method CDL uses compactness, centers, and covariances to compute a probabilistic description length bound.
result CDL outperforms conventional CVIs on synthetic and image benchmarks.

Satellite images predict U.S. county mortality rates.

problem Predicting mortality rates in U.S. counties using satellite imagery.
method Convolutional neural network trained on crude mortality rates, learned features interpreted using Shapley Additive Feature Explanations.
result Predicted mortality from satellite images correlated strongly with true mortality rates (Pearson r=0.72).

Proposes Group Loss for deep metric learning to improve clustering and image retrieval.

problem Improving deep metric learning for better clustering and image retrieval.
method Group Loss based on label-propagation method enforcing embedding similarity across all samples of a group.
result Shows state-of-the-art results on clustering and image retrieval on several datasets.

The use of brain images as markers for diseases or behavioral differences is challenged by the small effects size and the ensuing lack of power, an issue that has incited researchers to rely more systematically on large cohorts. Coupled with resolution increases, this leads to very large datasets. A striking example in…

2015-11-16abs ↗pdf ↗

Infinite hierarchical contrastive clustering identifies personal environments linked to health outcomes.

problem Identifying meaningful relationships between environmental features and health outcomes on an individual level.
method Contrastive clustering framework with stick-breaking prior and participant-specific prediction loss.
result Model effectively identifies distinct personal environments and groups them into meaningful types linked to health outcomes.

A hierarchical clustering algorithm for data clouds without structure assumptions.

problem Exploring data clouds without making structure assumptions.
method Hierarchical topological clustering algorithm that infers persistence of outliers and clusters of arbitrary shape from data hierarchy.
result The algorithm can provide meaningful clusters in complex datasets.