Early drought stress detection in cereals: simplex volume maximisation for hyperspectral image analysis

2012 ◽  
Vol 39 (11) ◽  
pp. 878 ◽  
Author(s):  
Christoph Römer ◽  
Mirwaes Wahabzada ◽  
Agim Ballvora ◽  
Francisco Pinto ◽  
Micol Rossini ◽  
...  
Keyword(s):  
Drought Stress ◽  
Hyperspectral Image ◽  
Vegetation Indices ◽  
Unsupervised Classification ◽  
Hyperspectral Data ◽  
Stress Detection ◽  
Hyperspectral Image Analysis ◽  
Supervised Learning Algorithms ◽  
Spatio Temporal ◽  
Imaging Sensors

Early water stress recognition is of great relevance in precision plant breeding and production. Hyperspectral imaging sensors can be a valuable tool for early stress detection with high spatio-temporal resolution. They gather large, high dimensional data cubes posing a significant challenge to data analysis. Classical supervised learning algorithms often fail in applied plant sciences due to their need of labelled datasets, which are difficult to obtain. Therefore, new approaches for unsupervised learning of relevant patterns are needed. We apply for the first time a recent matrix factorisation technique, simplex volume maximisation (SiVM), to hyperspectral data. It is an unsupervised classification approach, optimised for fast computation of massive datasets. It allows calculation of how similar each spectrum is to observed typical spectra. This provides the means to express how likely it is that one plant is suffering from stress. The method was tested for drought stress, applied to potted barley plants in a controlled rain-out shelter experiment and to agricultural corn plots subjected to a two factorial field setup altering water and nutrient availability. Both experiments were conducted on the canopy level. SiVM was significantly better than using a combination of established vegetation indices. In the corn plots, SiVM clearly separated the different treatments, even though the effects on leaf and canopy traits were subtle.

scholarly journals Flight Considerations and Hyperspectral Image Classifications for Dryland Vegetation Management from a Fixed-wing UAS

2016 ◽  
Vol 5 (2) ◽  
pp. 41 ◽  
Author(s):  
Jessica Mitchell ◽  
Nancy Glenn ◽  
Matthew Anderson ◽  
Ryan Hruska
Keyword(s):  
Hyperspectral Image ◽  
Distribution Patterns ◽  
Unsupervised Classification ◽  
Vegetation Management ◽  
Geometric Error ◽  
Hyperspectral Data ◽  
Unmanned Aerial Systems ◽  
Native Grasses ◽  
Management Objectives ◽  
Aerial Systems

<p class="emsd"><span lang="EN-GB">Unmanned Aerial Systems (UAS)-based hyperspectral remote sensing capabilities developed by the Idaho National Lab and Boise Center Aerospace Lab were tested via demonstration flights that explored the influence of altitude on geometric error, image mosaicking, and dryland vegetation classification. The motivation for this study was to better understand the challenges associated with UAS-based hyperspectral data for distinguishing native grasses such as Sandberg bluegrass (<em>Poa secunda</em>) from invasives such as burr buttercup (<em>Ranunculus testiculatus)</em> in a shrubland environment. The test flights successfully acquired usable flightline data capable of supporting classifiable composite images. Unsupervised classification results support vegetation management objectives that rely on mapping shrub cover and distribution patterns. However, supervised classifications performed poorly despite spectral separability in the image-derived endmember pixels. In many cases, the supervised classifications accentuated noise or features in the mosaic that were artifacts of color balancing and feathering in areas of flightline overlap. Future UAS flight missions that optimize flight planning; minimize illumination differences between flightlines; and leverage ground reference data and time series analysis should be able to effectively distinguish native grasses such as Sandberg bluegrass from burr buttercup. </span></p>

scholarly journals Drought Stress Detection in Juvenile Oilseed Rape Using Hyperspectral Imaging with a Focus on Spectra Variability

2020 ◽  
Vol 12 (20) ◽  
pp. 3462
Author(s):  
Wiktor R. Żelazny ◽  
Jan Lukáš
Keyword(s):  
Drought Stress ◽  
Hyperspectral Imaging ◽  
Oilseed Rape ◽  
Treatment Effects ◽  
Vegetation Index ◽  
Principal Component ◽  
Hyperspectral Data ◽  
Stress Detection ◽  
Mean Values ◽  
Standard Deviations

Hyperspectral imaging (HSI) has been gaining recognition as a promising proximal and remote sensing technique for crop drought stress detection. A modelling approach accounting for the treatment effects on the stress indicators’ standard deviations was applied to proximal images of oilseed rape—a crop subjected to various HSI studies, with the exception of drought. The aim of the present study was to determine the spectral responses of two cultivars, ‘Cadeli’ and ‘Viking’, representing distinctive water management strategies, to three types of watering regimes. Hyperspectral data cubes were acquired at the leaf level using a 2D frame camera. The influence of the experimental factors on the extent of leaf discolorations, vegetation index values, and principal component scores was investigated using Bayesian linear models. Clear treatment effects were obtained primarily for the vegetation indexes with respect to the watering regimes. The mean values of RGI, MTCI, RNDVI, and GI responded to the difference between the well-watered and water-deprived plants. The RGI index excelled among them in terms of effect strengths, which amounted to −0.96[−2.21,0.21] and −0.71[−1.97,0.49] units for each cultivar. A consistent increase in the multiple index standard deviations, especially RGI, PSRI, TCARI, and TCARI/OSAVI, was associated with worsening of the hydric regime. These increases were captured not only for the dry treatment but also for the plants subjected to regeneration after a drought episode, particularly by PSRI (a multiplicative effect of 0.33[0.16,0.68] for ‘Cadeli’). This result suggests a higher sensitivity of the vegetation index variability measures relative to the means in the context of the oilseed rape drought stress diagnosis and justifies the application of HSI to capture these effects. RGI is an index deserving additional scrutiny in future studies, as both its mean and standard deviation were affected by the watering regimes.

scholarly journals Hyperspectral Image Classification Using Parallel Autoencoding Diabolo Networks on Multi-Core and Many-Core Architectures

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 411 ◽  
Author(s):  
Emanuele Torti ◽  
Alessandro Fontanella ◽  
Antonio Plaza ◽  
Javier Plaza ◽  
Francesco Leporati
Keyword(s):  
Deep Learning ◽  
Hyperspectral Imaging ◽  
Hyperspectral Image ◽  
Unsupervised Classification ◽  
Hyperspectral Data ◽  
Machine Learning Techniques ◽  
High Data ◽  
Learning Techniques ◽  
Speed Up ◽  
Many Core

One of the most important tasks in hyperspectral imaging is the classification of the pixels in the scene in order to produce thematic maps. This problem can be typically solved through machine learning techniques. In particular, deep learning algorithms have emerged in recent years as a suitable methodology to classify hyperspectral data. Moreover, the high dimensionality of hyperspectral data, together with the increasing availability of unlabeled samples, makes deep learning an appealing approach to process and interpret those data. However, the limited number of labeled samples often complicates the exploitation of supervised techniques. Indeed, in order to guarantee a suitable precision, a large number of labeled samples is normally required. This hurdle can be overcome by resorting to unsupervised classification algorithms. In particular, autoencoders can be used to analyze a hyperspectral image using only unlabeled data. However, the high data dimensionality leads to prohibitive training times. In this regard, it is important to realize that the operations involved in autoencoders training are intrinsically parallel. Therefore, in this paper we present an approach that exploits multi-core and many-core devices in order to achieve efficient autoencoders training in hyperspectral imaging applications. Specifically, in this paper, we present new OpenMP and CUDA frameworks for autoencoder training. The obtained results show that the CUDA framework provides a speed-up of about two orders of magnitudes as compared to an optimized serial processing chain.

Near Infrared Hyperspectral Image Analysis Using R. Part 5: Animated Visualisation of Hyperspectral Data Using R and ImageJ

NIR news ◽  
2014 ◽  
Vol 25 (7) ◽  
pp. 15-17 ◽  
Author(s):  
Y. Dixit ◽  
R. Cama ◽  
C. Sullivan ◽  
L. Alvarez Jubete ◽  
A. Ktenioudaki
Keyword(s):  
Image Analysis ◽  
Near Infrared ◽  
Hyperspectral Image ◽  
Hyperspectral Data ◽  
Hyperspectral Image Analysis

Dimensionality Reduction and Classification of Hyperspectral Images using Genetic Algorithm

2016 ◽  
Vol 3 (3) ◽  
pp. 503 ◽  
Author(s):  
R. Kiran Kumar ◽  
B. Saichandana ◽  
K. Srinivas
Keyword(s):  
Genetic Algorithm ◽  
Dimensionality Reduction ◽  
Hyperspectral Image ◽  
Image Data ◽  
Unsupervised Classification ◽  
Hyperspectral Data ◽  
Band Selection ◽  
Data Set ◽  
Mode Decomposition ◽  
Fused Image

<p>This paper presents genetic algorithm based band selection and classification on hyperspectral image data set. Hyperspectral remote sensors collect image data for a large number of narrow, adjacent spectral bands. Every pixel in hyperspectral image involves a continuous spectrum that is used to classify the objects with great detail and precision. In this paper, first filtering based on 2-D Empirical mode decomposition method is used to remove any noisy components in each band of the hyperspectral data. After filtering, band selection is done using genetic algorithm in-order to remove bands that convey less information. This dimensionality reduction minimizes many requirements such as storage space, computational load, communication bandwidth etc which is imposed on the unsupervised classification algorithms. Next image fusion is performed on the selected hyperspectral bands to selectively merge the maximum possible features from the selected images to form a single image. This fused image is classified using genetic algorithm. Three different indices, such as K-means Index (KMI) and Jm measure are used as objective functions. This method increases classification accuracy and performance of hyperspectral image than without dimensionality reduction.</p>

Hyperspectral Image Analysis for Plant Stress Detection

2010 ◽  
Author(s):  
Yunseop Kim ◽  
David M Glenn ◽  
Johnny Park ◽  
Henry K Ngugi ◽  
Brian L Lehman
Keyword(s):  
Image Analysis ◽  
Hyperspectral Image ◽  
Plant Stress ◽  
Stress Detection ◽  
Hyperspectral Image Analysis

scholarly journals AN UNSUPERVISED LABELING APPROACH FOR HYPERSPECTRAL IMAGE CLASSIFICATION

2020 ◽  
Vol XLIII-B3-2020 ◽  
pp. 407-415
Author(s):  
J. González Santiago ◽  
F. Schenkel ◽  
W. Gross ◽  
W. Middelmann
Keyword(s):  
Hyperspectral Image ◽  
Ground Truth ◽  
Current Approach ◽  
Hyperspectral Data ◽  
Agglomerative Clustering ◽  
Hyperspectral Image Analysis ◽  
Hierarchical Agglomerative Clustering ◽  
Benchmark Datasets ◽  
Labeling Approach ◽  
Class Labels

Abstract. The application of hyperspectral image analysis for land cover classification is mainly executed in presence of manually labeled data. The ground truth represents the distribution of the actual classes and it is mostly derived from field recorded information. Its manual generation is ineffective, tedious and very time-consuming. The continuously increasing amount of proprietary and publicly available datasets makes it imperative to reduce these related costs. In addition, adequately equipped computer systems are more capable of identifying patterns and neighbourhood relationships than a human operator. Based on these facts, an unsupervised labeling approach is presented to automatically generate labeled images used during the training of a convolutional neural network (CNN) classifier. The proposed method begins with the segmentation stage where an adapted version of the simple linear iterative clustering (SLIC) algorithm for dealing with hyperspectral data is used. Consequently, the Hierarchical Agglomerative Clustering (HAC) and Fuzzy C-Means (FCM) algorithms are employed to efficiently group similar superpixels considering distances with respect to each other. The distinct utilization of these clustering techniques defines a complementary stage for overcoming class overlapping during image generation. Ultimately, a CNN classifier is trained using the computed image to pixel-wise predict classes on unseen datasets. The labeling results, obtained using two hyperspectral benchmark datasets, indicate that the current approach is able to detect objects boundaries, automatically assign class labels to the entire dataset and to classify new data with a prediction certainty of 90%. Additionally, this method is also capable of achieving better classification accuracy and visual correspondence with reality than the ground truth images.

scholarly journals Improving the Reliability of Mixture Tuned Matched Filtering Remote Sensing Classification Results Using Supervised Learning Algorithms and Cross-Validation

2018 ◽  
Vol 10 (11) ◽  
pp. 1675 ◽  
Author(s):  
Devin Routh ◽  
Lindsi Seegmiller ◽  
Charlie Bettigole ◽  
Catherine Kuhn ◽  
Chadwick D. Oliver ◽  
...  
Keyword(s):  
Supervised Learning ◽  
Cross Validation ◽  
Hyperspectral Image ◽  
Learning Algorithm ◽  
Learning Algorithms ◽  
Hyperspectral Data ◽  
Matched Filtering ◽  
User Input ◽  
Remote Sensing Classification ◽  
Supervised Learning Algorithms

Mixture tuned matched filtering (MTMF) image classification capitalizes on the increasing spectral and spatial resolutions of available hyperspectral image data to identify the presence, and potentially the abundance, of a given cover type or endmember. Previous studies using MTMF have relied on extensive user input to obtain a reliable classification. In this study, we expand the traditional MTMF classification by using a selection of supervised learning algorithms with rigorous cross-validation. Our approach removes the need for subjective user input to finalize the classification, ultimately enhancing replicability and reliability of the results. We illustrate this approach with an MTMF classification case study focused on leafy spurge (Euphorbia esula), an invasive forb in Western North America, using free 30-m hyperspectral data from the National Aeronautics and Space Administration’s (NASA) Hyperion sensor. Our protocol shows for our data, a potential overall accuracy inflation between 18.4% and 30.8% without cross-validation and according to the supervised learning algorithm used. We propose this new protocol as a final step for the MTMF classification algorithm and suggest future researchers report a greater suite of accuracy statistics to affirm their classifications’ underlying efficacies.

scholarly journals Early Detection of Wild Rocket Tracheofusariosis Using Hyperspectral Image-Based Machine Learning

2021 ◽  
Vol 14 (1) ◽  
pp. 84
Author(s):  
Catello Pane ◽  
Gelsomina Manganiello ◽  
Nicola Nicastro ◽  
Francesco Carotenuto
Keyword(s):  
Machine Learning ◽  
Early Detection ◽  
Hyperspectral Image ◽  
Learning Algorithm ◽  
Vegetation Indices ◽  
Symptom Assessment ◽  
Hyperspectral Data ◽  
Cross Prediction ◽  
Average Accuracy ◽  
Wild Rocket

Fusarium oxysporum f. sp. raphani is responsible for wilting wild rocket (Diplotaxis tenuifolia L. [D.C.]). A machine learning model based on hyperspectral data was constructed to monitor disease progression. Thus, pathogenesis after artificial inoculation was monitored over a 15-day period by symptom assessment, qPCR pathogen quantification, and hyperspectral imaging. The host colonization by a pathogen evolved accordingly with symptoms as confirmed by qPCR. Spectral data showed differences as early as 5-day post infection and 12 hypespectral vegetation indices were selected to follow disease development. The hyperspectral dataset was used to feed the XGBoost machine learning algorithm with the aim of developing a model that discriminates between healthy and infected plants during the time. The multiple cross-prediction strategy of the pixel-level models was able to detect hyperspectral disease profiles with an average accuracy of 0.8. For healthy pixel detection, the mean Precision value was 0.78, the Recall was 0.88, and the F1 Score was 0.82. For infected pixel detection, the average evaluation metrics were Precision: 0.73, Recall: 0.57, and F1 Score: 0.63. Machine learning paves the way for automatic early detection of infected plants, even a few days after infection.

scholarly journals Distributed Parallel Endmember Extraction of Hyperspectral Data Based on Spark

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Zebin Wu ◽  
Jinping Gu ◽  
Yonglong Li ◽  
Fu Xiao ◽  
Jin Sun ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Hyperspectral Image ◽  
Programming Model ◽  
Parallel Implementation ◽  
Distributed Processing ◽  
Hyperspectral Data ◽  
Endmember Extraction ◽  
Hyperspectral Image Analysis ◽  
Computing Platform ◽  
Acceleration Techniques

Due to the increasing dimensionality and volume of remotely sensed hyperspectral data, the development of acceleration techniques for massive hyperspectral image analysis approaches is a very important challenge. Cloud computing offers many possibilities of distributed processing of hyperspectral datasets. This paper proposes a novel distributed parallel endmember extraction method based on iterative error analysis that utilizes cloud computing principles to efficiently process massive hyperspectral data. The proposed method takes advantage of technologies including MapReduce programming model, Hadoop Distributed File System (HDFS), and Apache Spark to realize distributed parallel implementation for hyperspectral endmember extraction, which significantly accelerates the computation of hyperspectral processing and provides high throughput access to large hyperspectral data. The experimental results, which are obtained by extracting endmembers of hyperspectral datasets on a cloud computing platform built on a cluster, demonstrate the effectiveness and computational efficiency of the proposed method.

Sign in / Sign up

Export Citation Format

Share Document