Search results for "Component analysis"
showing 10 items of 562 documents
Visible-NIR reflectance spectroscopy and manifold learning methods applied to the detection of fungal infections on citrus fruit
2015
Abstract The development of systems for automatically detecting decay in citrus fruit during quality control is still a challenge for the citrus industry. The feasibility of reflectance spectroscopy in the visible and near infrared (NIR) regions was evaluated for the automatic detection of the early symptoms of decay caused by Penicillium digitatum fungus in citrus fruit. Reflectance spectra of sound and decaying surface parts of mandarins cv. ‘Clemenvilla’ were acquired in two different spectral regions, from 650 nm to 1050 nm (visible–NIR) and from 1000 nm to 1700 nm (NIR), pointing to significant differences in spectra between sound and decaying skin for both spectral ranges. Three diffe…
Nonlinear data description with Principal Polynomial Analysis
2012
Principal Component Analysis (PCA) has been widely used for manifold description and dimensionality reduction. Performance of PCA is however hampered when data exhibits nonlinear feature relations. In this work, we propose a new framework for manifold learning based on the use of a sequence of Principal Polynomials that capture the eventually nonlinear nature of the data. The proposed Principal Polynomial Analysis (PPA) is shown to generalize PCA. Unlike recently proposed nonlinear methods (e.g. spectral/kernel methods and projection pursuit techniques, neural networks), PPA features are easily interpretable and the method leads to a fully invertible transform, which is a desirable property…
Spectral clustering with the probabilistic cluster kernel
2015
Abstract This letter introduces a probabilistic cluster kernel for data clustering. The proposed kernel is computed with the composition of dot products between the posterior probabilities obtained via GMM clustering. The kernel is directly learned from the data, is parameter-free, and captures the data manifold structure at different scales. The projections in the kernel space induced by this kernel are useful for general feature extraction purposes and are here exploited in spectral clustering with the canonical k-means. The kernel structure, informative content and optimality are studied. Analysis and performance are illustrated in several real datasets.
Feature extraction from remote sensing data using Kernel Orthonormalized PLS
2007
This paper presents the study of a sparse kernel-based method for non-linear feature extraction in the context of remote sensing classification and regression problems. The so-called kernel orthonormalized PLS algorithm with reduced complexity (rKOPLS) has two core parts: (i) a kernel version of OPLS (called KOPLS), and (ii) a sparse (reduced) approximation for large scale data sets, which ultimately leads to rKOPLS. The method demonstrates good capabilities in terms of expressive power of the extracted features and scalability.
Robustness of texture parameters for color texture analysis
2006
This article proposes to deal with noisy and variable size color textures. It also proposes to deal with quantization methods and to see how such methods change final results. The method we use to analyze the robustness of the textures consists of an auto-classification of modified textures. Texture parameters are computed for a set of original texture samples and stored into a database. Such a database is created for each quantization method. Textures from the set of original samples are then modified, eventually quantized and classified according to classes determined from a precomputed database. A classification is considered incorrect if the original texture is not retrieved. This metho…
Semisupervised Kernel Feature Extraction for Remote Sensing Image Analysis
2014
This paper presents a novel semisupervised kernel partial least squares (KPLS) algorithm for nonlinear feature extraction to tackle both land-cover classification and biophysical parameter retrieval problems. The proposed method finds projections of the original input data that align with the target variable (labels) and incorporates the wealth of unlabeled information to deal with low-sized or underrepresented data sets. The method relies on combining two kernel functions: the standard radial-basis-function kernel based on labeled information and a generative, i.e., probabilistic, kernel directly learned by clustering the data many times and at different scales across the data manifold. Th…
A family of kernel anomaly change detectors
2014
This paper introduces the nonlinear extension of the anomaly change detection algorithms in [1] based on the theory of reproducing kernels. The presented methods generalize their linear counterparts, under both the Gaussian and elliptically-contoured assumptions, and produce both improved detection accuracies and reduced false alarm rates. We study the Gaussianity of the data in Hilbert spaces with kernel dependence estimates, provide low-rank kernel versions to cope with the high computational cost of the methods, and give prescriptions about the selection of the kernel functions and their parameters. We illustrate the performance of the introduced kernel methods in both pervasive and anom…
Semi-Supervised Remote Sensing Image Classification based on Clustering and the Mean Map Kernel
2008
This paper presents a semi-supervised classifier based on the combination of the expectation-maximization (EM) algorithm for Gaussian mixture models (GMM) and the mean map kernel. The proposed method uses the most reliable samples in terms of maximum likelihood to compute a kernel function that accurately reflects the similarity between clusters in the kernel space. The proposed method improves classification accuracy in situations where the available labeled information does not properly describe the classes in the test image.
Non-negative matrix factorization Vs. FastICA on mismatch negativity of children
2009
In this presentation two event-related potentials, mismatch negativity (MMN) and P3a, are extracted from EEG by non-negative matrix factorization (NMF) simultaneously. Typically MMN recordings show a mixture of MMN, P3a, and responses to repeated standard stimuli. NMF may release the source independence assumption and data length limitations required by Fast independent component analysis (FastICA). Thus, in theory NMF could reach better separation of the responses. In the current experiment MMN was elicited by auditory duration deviations in 102 children. NMF was performed on the time-frequency representation of the raw data to estimate sources. Support to Absence Ratio (SAR) of the MMN co…
An Efficient Method for the Visualization of Spectral Images Based on a Perception-Oriented Spectrum Segmentation
2010
We propose a new method for the visualization of spectral images. It involves a perception-based spectrum segmentation using an adaptable thresholding of the stretched CIE standard observer colormatching functions. This allows for an underlying removal of irrelevant channels, and, consequently, an alleviation of the computational burden of further processings. Principal Components Analysis is then used in each of the three segments to extract the Red, Green and Blue primaries for final visualization. A comparison framework using two different datasets shows the efficiency of the proposed method.