We describe a method of processing hyperspectral images of natural scenes that uses a combination of kmeans clustering and locally linear embedding (LLE). The primary goal is to assist anomaly detection by preserving spectral uniqueness among the pixels. In order to reduce redundancy among the pixels, adjacent pixels which are spectrally similar are grouped using the k-means clustering algorith...

Unsupervised learning algorithm locally linear embedding (LLE) is a typical technique which applies the preserving embedding method of high dimensional data to low dimension. The number of neighborhood nodes of LLE is a decisive parameter because the improper value will affect the manifold structure in the local neighborhood and lead to the lower computational efficiency. Based on the fact that...

A number of manifold learning algorithms have been recently proposed, including locally linear embedding (LLE). These algorithms not only merely reduce data dimensionality, but also attempt to discover a true low dimensional structure of the data. The common feature of the most of these algorithms is that they operate in a batch or offline mode. Hence, when new data arrive, one needs to rerun t...

Manifold learning addresses the problem of finding low–dimensional structure within collections of high–dimensional data. Recent interest in this problem was motivated by the development of a pair of algorithms, locally linear embedding (LLE) [6] and isometric feature mapping (IsoMap) [8]. Both methods use local, linear relationships to derive global, nonlinear structure, although their specifi...

Linear discriminant analysis (LDA) is a simple but widely used algorithm in pattern recognition. However it has some shortcomings in that it is sensitive to outliers and limited to linearly separable cases. To solve this problem a new version of nonlinear discriminant algorithm is proposed. This new version, SC-LLE, uses LDA combined with LLE method to take into account non-linearly separable c...

The Locally Linear Embedding (LLE) algorithm is an unsupervised nonlinear dimensionality-reduction method, which reports a low recognition rate in classification because it gives no consideration to the label information of sample distribution. In this paper, a classification method of supervised LLE (SLLE) based on Linear Discriminant Analysis (LDA) is proposed. First, samples are classified a...

In this paper, we proposed a new nonlinear dimensionality reduction algorithm called regularized Kernel Local Linear Embedding (rKLLE) for highly structured data. It is built on the original LLE by introducing kernel alignment type of constraint to effectively reduce the solution space and find out the embeddings reflecting the prior knowledge. To enable the non-vectorial data applicability of ...

Manifold learning approaches such as locally linear embedding algorithm (LLE) and isometric mapping (Isomap) algorithm are aimed to discover the intrinsical low dimensional variables from high-dimensional nonlinear data. While, in order to achieve effective recognition tasks based on manifold learning, many problems remain to be solved. In this paper, we propose unified algorithm based on LLE a...

Fault diagnosis is essentially a kind of pattern recognition. The measured signal samples usually distribute on nonlinear low-dimensional manifolds embedded in the high-dimensional signal space, so how to implement feature extraction, dimensionality reduction and improve recognition performance is a crucial task. In this paper a novel machinery fault diagnosis approach based on a statistical lo...