Tag: cluster validity

Abstract: Superpixel segmentation methods have been found to be increasingly valuable in image processing and analysis. Superpixel segmentation approaches have been used as a preprocessing step for a wide variety of image analysis tasks such as full scene segmentation, automated scene understanding, object detection and classification, and have been used to reduce computation time during […]

Abstract: The Possibilistic Fuzzy Local Information C-Means (PFLICM) method is presented as a technique to segment side-look synthetic aperture sonar (SAS) imagery into distinct regions of the sea-floor. In this work, we investigate and present the results of an automated feature selection approach for SAS image segmentation. The chosen features and resulting segmentation from the […]

Abstract: A map-guided superpixel segmentation method for hyperspectral imagery is developed and introduced. The proposed approach develops a hyperspectral-appropriate version of the SLIC superpixel segmentation algorithm, leverages map information to guide segmentation, and incorporates the semi-supervised Partial Membership Latent Dirichlet Allocation (sPM-LDA) to obtain a final superpixel segmentation. The proposed method is applied to two […]

Abstract: Many superpixel segmentation algorithms which are suitable for the regular color images like images with three channels: red, green and blue (RGB images) have been developed in the literature. However, because of the high dimensionality of hyperspectral imagery, these regular superpixel segmentation algorithms often do not perform well in hyperspectral imagery. Although there are […]

Abstract: The Johnson-Lindenstrauss (JL) lemma, with known probability, sets a lower bound q0 on the dimension for which a random projection of p-dimensional vector data is guaranteed to be within (1±ε) of being an isometry in a randomly projected downspace. We study several ways to identify a “good” rogue random projection when the target downspace […]

Abstract: A new approach for simultaneously comparing sets of hyperspectral endmembers and proportion values using the Earth Movers Distance (EMD) is presented. First, the EMD is defined and calculated per-pixel based on the proportion values and corresponding endmembers. Next, these per-pixel EMD distances are aggregated to obtain a final measure of dissimilarity. In particular, the […]

Abstract: A number of noteworthy techniques have been put forth recently in different research fields for comparing clusterings. Herein, we introduce a new method for comparing soft (fuzzy, probabilistic, and possibilistic) partitions based on the earth mover’s distance (EMD) and the ordered weighted average (OWA). The proposed method is a metric, depending on the ground […]

Abstract: A hyperspectral pixel is generally composed of a relatively small number of endmembers. Several unmixing methods have been developed to enforce this concept through sparsity promotion or piece-wise convex mixing models. Piece-wise convex unmixing methods often require as parameters the number of endmembers and the number of sets of endmembers needed. However, these values […]