This paper proposes to use compression-based similarity measures to cluster spectral signatures on the basis of their similarities. Such universal distances estimate the shared information between two objects by comparing their compression factors, which can be obtained by any standard compressor. Experiments on spectra, both collected in the field and selected from a hyperspectral scene, show that these methods may outperform traditional choices for spectral distances based on vector processing such as Spectral Angle, Spectral Information Divergence, Spectral Correlation, and Euclidean Distance
Abstract The construction process for a similarity matrix has an important impact on the performance...
Hyperspectral measures are used to capture the degree of similarity between two spectra. Spectral An...
Part 5: Algorithms and Data ManagementInternational audienceFinding clusters in data is a challengin...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors...
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors...
In cluster analysis, data are clustered into meaningful groups so that the objects in the same group...
Abstract—Capturing both the shape of the spectral continuum and the positions/widths of absorption b...
Constructing a rational affinity matrix is crucial for spectral clustering. In this paper, a novel s...
The construction of a similarity matrix is one significant step for the spectral clustering algorith...
This paper investigates the efficiency of spectral metrics when used in spectral screening of hypers...
Spectral clustering is one of the most widely used techniques for extracting the underlying...
Abstract The construction process for a similarity matrix has an important impact on the performance...
Hyperspectral measures are used to capture the degree of similarity between two spectra. Spectral An...
Part 5: Algorithms and Data ManagementInternational audienceFinding clusters in data is a challengin...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
This paper proposes to use compression-based similarity measures to cluster spectral signatures on t...
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors...
Spectral clustering is a powerful method for finding structure in a dataset through the eigenvectors...
In cluster analysis, data are clustered into meaningful groups so that the objects in the same group...
Abstract—Capturing both the shape of the spectral continuum and the positions/widths of absorption b...
Constructing a rational affinity matrix is crucial for spectral clustering. In this paper, a novel s...
The construction of a similarity matrix is one significant step for the spectral clustering algorith...
This paper investigates the efficiency of spectral metrics when used in spectral screening of hypers...
Spectral clustering is one of the most widely used techniques for extracting the underlying...
Abstract The construction process for a similarity matrix has an important impact on the performance...
Hyperspectral measures are used to capture the degree of similarity between two spectra. Spectral An...
Part 5: Algorithms and Data ManagementInternational audienceFinding clusters in data is a challengin...