9 research outputs found
Spectral-Spatial Classification of Hyperspectral Data based on a Stochastic Minimum Spanning Forest Approach
International audienceIn this paper, a new method for supervised hyperspectral data classification is proposed. In particular, the notion of stochastic Minimum Spanning Forest (MSF) is introduced. For a given hyperspectral image, a pixelwise classification is first performed. From this classification map, M marker maps are generated by randomly selecting pixels and labeling them as markers for the construction of Minimum Spanning Forests. The next step consists in building an MSF from each of the M marker maps. Finally, all the M realizations are aggregated with a maximum vote decision rule, in order to build the final classification map. The proposed method is tested on three different data sets of hyperspectral airborne images with different resolutions and contexts. The influence of the number of markers and of the number of realizations M on the results are investigated in experiments. The performance of the proposed method is compared to several classification techniques (both pixelwise and spectral-spatial) using standard quantitative criteria and visual qualitative evaluation
Hyperspectral data classification improved by minimum spanning forests
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Remote sensing technology has applications in various knowledge domains, such as agriculture, meteorology, land use, environmental monitoring, military surveillance, and mineral exploration. The increasing advances in image acquisition techniques have allowed the generation of large volumes of data at high spectral resolution with several spectral bands representing images collected simultaneously. We propose and evaluate a supervised classification method composed of three stages. Initially, hyperspectral values and entropy information are employed by support vector machines to produce an initial classification. Then, the K-nearest neighbor technique searches for pixels with high probability of being correctly classified. Finally, minimum spanning forests are applied to these pixels to reclassify the image taking spatial restrictions into consideration. Experiments on several hyperspectral images are conducted to show the effectiveness of the proposed method. (C) 2016 Society of Photo-Optical Instrumentation Engineers (SPIE)Remote sensing technology has applications in various knowledge domains, such as agriculture, meteorology, land use, environmental monitoring, military surveillance, and mineral exploration. The increasing advances in image acquisition techniques have all102117FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOCNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)2011/22749-8307113/2012-
Recommended from our members
Hemodynamic Instability and Cardiovascular Events After Traumatic Brain Injury Predict Outcome After Artifact Removal With Deep Belief Network Analysis.
BACKGROUND: Hemodynamic instability and cardiovascular events heavily affect the prognosis of traumatic brain injury. Physiological signals are monitored to detect these events. However, the signals are often riddled with faulty readings, which jeopardize the reliability of the clinical parameters obtained from the signals. A machine-learning model for the elimination of artifactual events shows promising results for improving signal quality. However, the actual impact of the improvements on the performance of the clinical parameters after the elimination of the artifacts is not well studied. MATERIALS AND METHODS: The arterial blood pressure of 99 subjects with traumatic brain injury was continuously measured for 5 consecutive days, beginning on the day of admission. The machine-learning deep belief network was constructed to automatically identify and remove false incidences of hypotension, hypertension, bradycardia, tachycardia, and alterations in cerebral perfusion pressure (CPP). RESULTS: The prevalences of hypotension and tachycardia were significantly reduced by 47.5% and 13.1%, respectively, after suppressing false incidents (P=0.01). Hypotension was particularly effective at predicting outcome favorability and mortality after artifact elimination (P=0.015 and 0.027, respectively). In addition, increased CPP was also statistically significant in predicting outcomes (P=0.02). CONCLUSIONS: The prevalence of false incidents due to signal artifacts can be significantly reduced using machine-learning. Some clinical events, such as hypotension and alterations in CPP, gain particularly high predictive capacity for patient outcomes after artifacts are eliminated from physiological signals
Vector attribute profiles for hyperspectral image classification
International audienceMorphological attribute profiles are among the most prominent spectral-spatial pixel description methods. They are efficient, effective and highly customizable multi-scale tools based on hierarchical representations of a scalar input image. Their application to multivariate images in general, and hyperspectral images in particular, has been so far conducted using the marginal strategy, i.e. by processing each image band (eventually obtained through a dimension reduction technique) independently. In this paper, we investigate the alternative vector strategy, which consists in processing the available image bands simultaneously. The vector strategy is based on a vector ordering relation that leads to the computation of a single max-and min-tree per hyperspectral dataset, from which attribute profiles can then be computed as usual. We explore known vector ordering relations for constructing such max-trees and subsequently vector attribute profiles, and introduce a combination of marginal and vector strategies. We provide an experimental comparison of these approaches in the context of hyperspectral classification with common datasets, where the proposed approach outperforms the widely used marginal strategy
Hyperspectral Image Unmixing Incorporating Adjacency Information
While the spectral information contained in hyperspectral images is rich, the spatial resolution of such images is in many cases very low. Many pixel spectra are mixtures of pure materials’ spectra and therefore need to be decomposed into their constituents. This work investigates new decomposition methods taking into account spectral, spatial and global 3D adjacency information. This allows for faster and more accurate decomposition results