Percorrer por autor "Bioucas-Dias, José M."
A mostrar 1 - 10 de 37
Resultados por página
Opções de ordenação
- Blind hyperspectral unmixingPublication . Nascimento, Jose; Bioucas-Dias, José M.Hyperspectral unmixing methods aim at the decomposition of a hyperspectral image into a collection endmember signatures, i.e., the radiance or reflectance of the materials present in the scene, and the correspondent abundance fractions at each pixel in the image. This paper introduces a new unmixing method termed dependent component analysis (DECA). This method is blind and fully automatic and it overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. DECA is based on the linear mixture model, i.e., each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abundances are modeled as mixtures of Dirichlet densities, thus enforcing the non-negativity and constant sum constraints, imposed by the acquisition process. The endmembers signatures are inferred by a generalized expectation-maximization (GEM) type algorithm. The paper illustrates the effectiveness of DECA on synthetic and real hyperspectral images.
- Blind hyperspectral unmixingPublication . Nascimento, Jose; Bioucas-Dias, José M.This paper introduces a new hyperspectral unmixing method called Dependent Component Analysis (DECA). This method decomposes a hyperspectral image into a collection of reflectance (or radiance) spectra of the materials present in the scene (endmember signatures) and the corresponding abundance fractions at each pixel. DECA models the abundance fractions as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. This method overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. DECA performance is illustrated using simulated and real data.
- Classificação não-supervisionada de dados hiperespectrais usando análise em componentes independentesPublication . Nascimento, Jose; Bioucas-Dias, José M.No passado recente foram desenvolvidas v árias t écnicas para classi ca ção de dados hiperspectrais. Uma abordagem tí pica consiste em considerar que cada pixel e uma mistura linear das reflectancias espectrais dos elementos presentes na c élula de resolu ção, adicionada de ru ído. Para classifi car e estimar os elementos presentes numa imagem hiperespectral, v ários problemas se colocam: Dimensionalidade dos dados, desconhecimento dos elementos presentes e a variabilidade da reflectância destes. Recentemente foi proposta a An álise em Componentes Independentes,para separa ção de misturas lineares. Nesta comunica ção apresenta-se uma metodologia baseada na An álise em Componentes Independentes para detec ção dos elementos presentes em imagens hiperespectrais e estima ção das suas quantidades. Apresentam-se resultados desta metodologia com dados simulados e com dados hiperespectrais reais, ilustrando a potencialidade da t écnica.
- Dependent component analysis: a hyperspectral unmixing algorithmPublication . Nascimento, Jose; Bioucas-Dias, José M.Linear unmixing decomposes a hyperspectral image into a collection of reflectance spectra of the materials present in the scene, called endmember signatures, and the corresponding abundance fractions at each pixel in a spatial area of interest. This paper introduces a new unmixing method, called Dependent Component Analysis (DECA), which overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical properties of hyperspectral data. DECA models the abundance fractions as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. The performance of the method is illustrated using simulated and real data.
- Does Independent Component Analysis Play a Role in Unmixing Hyperspectral Data?Publication . Nascimento, Jose; Bioucas-Dias, José M.Independent Component Analysis (ICA) have recently been proposed as a tool to unmix hyperspectral data. ICA is founded on two assumptions: i) The observed data vector is a linear mixture of the sources (abundance fractions); ii) sources are independent. Concerning hyperspectral data, the first assumption is valid whenever the constituent substances are surface distributed. The second assumption, however, is violated, since the sum of abundance fractions associated to each pixel is constant due to physical constraints in the data acquisition process. Thus, sources cannot be independent. This paper gives evidence that ICA, at least in its canonical form, is not suited to unmix hyperspectral data. We arrive to this conclusion by minimizing the mutual information of simulated hyperspectral mixtures. The hyperspectral data model includes signature variability, abundance perturbation, sensor Point Spread Function (PSF), abundance constraint and electronic noise. Mutual information computation is based on fitting mixtures of Gaussians to the observed data.
- Does independent component analysis play a role in unmixing hyperspectral data?Publication . Nascimento, Jose; Bioucas-Dias, José M.Independent component analysis (ICA) has recently been proposed as a tool to unmix hyperspectral data. ICA is founded on two assumptions: 1) the observed spectrum vector is a linear mixture of the constituent spectra (endmember spectra) weighted by the correspondent abundance fractions (sources); 2)sources are statistically independent. Independent factor analysis (IFA) extends ICA to linear mixtures of independent sources immersed in noise. Concerning hyperspectral data, the first assumption is valid whenever the multiple scattering among the distinct constituent substances (endmembers) is negligible, and the surface is partitioned according to the fractional abundances. The second assumption, however, is violated, since the sum of abundance fractions associated to each pixel is constant due to physical constraints in the data acquisition process. Thus, sources cannot be statistically independent, this compromising the performance of ICA/IFA algorithms in hyperspectral unmixing. This paper studies the impact of hyperspectral source statistical dependence on ICA and IFA performances. We conclude that the accuracy of these methods tends to improve with the increase of the signature variability, of the number of endmembers, and of the signal-to-noise ratio. In any case, there are always endmembers incorrectly unmixed. We arrive to this conclusion by minimizing the mutual information of simulated and real hyperspectral mixtures. The computation of mutual information is based on fitting mixtures of Gaussians to the observed data. A method to sort ICA and IFA estimates in terms of the likelihood of being correctly unmixed is proposed.
- Estimação do subespaço de sinal em dados hiperespectraisPublication . Nascimento, Jose; Bioucas-Dias, José M.A redução de dimensionalidade é uma tarefa crucial no processamento e análise de dados hiperespectrais. Esta comunicação propõe um método de estimação do subespaço de sinal baseado no erro quadrático médio. O método consiste em primeiro estimar as matrizes de correlação do sinal e do ruído e em segundo seleccionar o conjunto de vectores próprios que melhor representa o subespaço de sinal. O eficiência deste método é ilustrada em imagens hiperespectrais sintéticas e reais.
- Estimation of signal subspace on hyperspectral dataPublication . Bioucas-Dias, José M.; Nascimento, JoseDimensionality reduction plays a crucial role in many hyperspectral data processing and analysis algorithms. This paper proposes a new mean squared error based approach to determine the signal subspace in hyperspectral imagery. The method first estimates the signal and noise correlations matrices, then it selects the subset of eigenvalues that best represents the signal subspace in the least square sense. The effectiveness of the proposed method is illustrated using simulated and real hyperspectral images.
- A fast parallel hyperspectral coded aperture algorithm for compressive sensing using OpenCLPublication . Bernabé, Sergio; Martin, Gabriel; Nascimento, Jose; Bioucas-Dias, José M.; Plaza, Antonio; Botella, Guillermo; Prieto-Matias, ManuelIn this paper, we develop a fast implementation of an hyperspectral coded aperture (HYCA) algorithm on different platforms using OpenCL, an open standard for parallel programing on heterogeneous systems, which includes a wide variety of devices, from dense multicore systems from major manufactures such as Intel or ARM to new accelerators such as graphics processing units (GPUs), field programmable gate arrays (FPGAs), the Intel Xeon Phi and other custom devices. Our proposed implementation of HYCA significantly reduces its computational cost. Our experiments have been conducted using simulated data and reveal considerable acceleration factors. This kind of implementations with the same descriptive language on different architectures are very important in order to really calibrate the possibility of using heterogeneous platforms for efficient hyperspectral imaging processing in real remote sensing missions.
- Fast unsupervised extraction of endmembers spectra from hyperspectral dataPublication . Nascimento, Jose; Bioucas-Dias, José M.Linear unmixing decomposes an hyperspectral image into a collection of re ectance spectra, called endmember signatures, and a set corresponding abundance fractions from the respective spatial coverage. This paper introduces vertex component analysis, an unsupervised algorithm to unmix linear mixtures of hyperpsectral data. VCA exploits the fact that endmembers occupy vertices of a simplex, and assumes the presence of pure pixels in data. VCA performance is illustrated using simulated and real data. VCA competes with state-of-the-art methods with much lower computational complexity.