paper-with-me

홈 › Papers

A parameterless scale-space approach to find meaningful modes in histograms - Application to image and spectrum segmentation

2014-01-13 · Jérôme Gilles, Kathryn Heal

In this paper, we present an algorithm to automatically detect meaningful modes in a histogram. The proposed method is based on the behavior of local minima in a scale-space representation. We show that the detection of such meaningful modes is equivalent in a two classes clustering problem on the length of minima scale-space curves. The algorithm is easy to implement, fast, and does not require any parameters. We present several results on histogram and spectrum segmentation, grayscale image segmentation and color image reduction.

📄 PDF Abstract BibTeX arXiv:1401.2686

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringImage SegmentationSegmentationSemantic Segmentation

Similar Papers 제목 키워드 기반

The K-modes algorithm for clustering

2013-04-24 · Miguel Á. Carreira-Perpiñán, Weiran Wang

Many clustering algorithms exist that estimate a cluster centroid, such as K-means, K-medoids or mean-shift, but no algorithm seems to exist that clusters data by returning exactly K meaningful modes. We propose a natura…

Clusteringvalid

The Laplacian K-modes algorithm for clustering

2014-06-16 · Weiran Wang, Miguel Á. Carreira-Perpiñán

In addition to finding meaningful clusters, centroid-based clustering algorithms such as K-means or mean-shift should ideally find centroids that are valid patterns in the input space, representative of data in their clu…

Clusteringvalid

Inferring financial stock returns correlation from complex network analysis

2024-07-29 · Ixandra Achitouv

Financial stock returns correlations have been studied in the prism of random matrix theory, to distinguish the signal from the "noise". Eigenvalues of the matrix that are above the rescaled Marchenko Pastur distribution…

Multiscale texture separation

2024-11-01 · Jerome Gilles

In this paper, we investigate theoretically the behavior of Meyer's image cartoon + texture decomposition model. Our main results is a new theorem which shows that, by combining the decomposition model and a well chosen …

Hallucinating optimal high-dimensional subspaces

2014-01-31 · Ognjen Arandjelovic

Linear subspace representations of appearance variation are pervasive in computer vision. This paper addresses the problem of robustly matching such subspaces (computing the similarity between them) when they are used to…

Vocal Bursts Intensity Prediction