Path-based spectral clustering: Guarantees, robustness to outliers, and fast algorithms
We consider the problem of clustering with the longest-leg path distance (LLPD) metric,
which is informative for elongated and irregularly shaped clusters. We prove finite-sample …
which is informative for elongated and irregularly shaped clusters. We prove finite-sample …
Learning by unsupervised nonlinear diffusion
This paper proposes and analyzes a novel clustering algorithm, called learning by
unsupervised nonlinear diffusion (LUND), that combines graph-based diffusion geometry …
unsupervised nonlinear diffusion (LUND), that combines graph-based diffusion geometry …
Spectral–spatial diffusion geometry for hyperspectral image clustering
An unsupervised learning algorithm to cluster hyperspectral image (HSI) data that leverages
spatially regularized random walks is proposed. Markov diffusions are defined on the space …
spatially regularized random walks is proposed. Markov diffusions are defined on the space …
Learning by unsupervised nonlinear diffusion
This paper proposes and analyzes a novel clustering algorithm that combines graph-based
diffusion geometry with techniques based on density and mode estimation. The proposed …
diffusion geometry with techniques based on density and mode estimation. The proposed …
Spatially regularized active diffusion learning for high-dimensional images
JM Murphy - Pattern Recognition Letters, 2020 - Elsevier
An active learning method for the classification of high-dimensional images is proposed in
which spatially-regularized nonlinear diffusion geometry is used to characterize cluster …
which spatially-regularized nonlinear diffusion geometry is used to characterize cluster …
Path-based spectral clustering: Guarantees, robustness to outliers, and fast algorithms
We consider the problem of clustering with the longest-leg path distance (LLPD) metric,
which is informative for elongated and irregularly shaped clusters. We prove finite-sample …
which is informative for elongated and irregularly shaped clusters. We prove finite-sample …
Iterative active learning with diffusion geometry for hyperspectral images
We propose an active learning algorithm for labeling hyperspectral images (HSI). Pixels with
ambiguous class affinity are iteratively estimated using geometric and statistical properties of …
ambiguous class affinity are iteratively estimated using geometric and statistical properties of …
Spatiotemporal analysis using Riemannian composition of diffusion operators
Multivariate time-series have become abundant in recent years, as many data-acquisition
systems record information through multiple sensors simultaneously. In this paper, we …
systems record information through multiple sensors simultaneously. In this paper, we …
[HTML][HTML] Spatiotemporal analysis using Riemannian composition of diffusion operators
Multivariate time-series have become abundant in recent years, as many data-acquisition
systems record information through multiple sensors simultaneously. In this paper, we …
systems record information through multiple sensors simultaneously. In this paper, we …
Patch-Based Diffusion Learning for Hyperspectral Image Clustering
JM Murphy - … 2020-2020 IEEE International Geoscience and …, 2020 - ieeexplore.ieee.org
An algorithm for clustering hyperspectral images (HSI) based on diffusion geometry in the
space of high-dimensional image patches is proposed. By using the patch structure of the …
space of high-dimensional image patches is proposed. By using the patch structure of the …