Local Binary Pattern-Based Hyperspectral Image Classification With Superpixel Guidance

This paper proposes a novel face representation approach, local Gabor binary mapping pattern (LGBMP), for multi-view gender classification. In this approach, a face image is first represented as a series of Gabor magnitude pictures (GMP) by applying multi-scale and multi-orientation Gabor filters. Each GMP is then encoded as a LGBP image where a uniform local binary pattern (LBP) operator is used. After that, each LGBP image is divided into non-overlapping rectangular regions, from which spatial histograms are extracted. Although an LGBP feature vector can be obtained by fitting together the regional histograms, it can not be employed in pattern classification due to its high dimension. We propose that each regional LGBP feature be mapped onto a one-dimensional subspace independently before they are concatenated as a whole feature vector. This is attractive since we reduce the feature dimension and also preserve the spatial information of LGBP image. Two ways have been proposed to map the regional LGBP feature in this paper. One is so-called LGBMP-LDA using linear discriminant analysis (LDA) for dimensionality reduction while the other is to project the regional LGBP feature onto the class center connecting line, namely, LGBMP-CCL. As a result, despite several decades of Gabor filters, the final feature dimension is even less than that of the feature extracted by using LBP directly on gray-scale images. The classification tasks in our work are performed by support vector machines (SVM). The experimental results on the CAS-PEAL face database indicate that the proposed approach achieves higher accuracy than the others such as SVMs+Gray-scale pixel, SVMs+Gabor and SVMs+LBP approach, more particularly, it has the lowest dimension of feature vector.

Multimodal biometrics-based systems aim to improve the recognition accuracy of human beings using more than one physical and/or behavioral characteristics of a person. In this paper, different fusion schemes at matching score level and feature level are employed to obtain a robust recognition system using several standard feature extractors. The proposed method involves the consideration of a face–iris multimodal biometric system using score level and feature level fusion. Principal Component Analysis (PCA), subspace Linear Discriminant Analysis (LDA), subpattern-based PCA, modular PCA and Local Binary Patterns (LBP) are global and local feature extraction methods applied on face and iris images. In fact, different feature sets obtained from five local and global feature extraction methods for unimodal iris biometric system are concatenated at feature level fusion called iris feature vector fusion (iris-FVF), while for unimodal face biometric system, LBP is used to achieve efficient texture descriptors. Feature selection is performed using Particle Swarm Optimization (PSO) at feature level fusion step to reduce the dimension of feature vectors for improving the recognition performance. Our proposed method is validated by forming three datasets using ORL, BANCA, FERET face databases and CASIA, UBIRIS iris databases. The results based on recognition performance and ROC analysis demonstrate that the proposed matching score level fusion scheme using Weighted Sum rule, tanh normalization, iris-FVF and facial features extracted by LBP achieves a significant improvement over unimodal and multimodal methods. Support Vector Machine (SVM) and t-norm normalization are also used to improve the recognition performance of the proposed method.

There is a relative paucity of studies that seek to nonparametrically describe or categorize hyperspectral image (HSI) data in the most natural context within which those data are best represented: n-dimensional (n-D) hyperspace, where n is the number of bands in an HSI data cube. Statistical techniques-and specifically those based on second-order statistics-are predominant and generally do not provide (nor are they utilized to provide or 'leave behind') an understanding of the distribution of spectra in hyperspace for the purpose of discovering patterns, comparing data sets, developing a deeper understanding of HSI data, etc. With the terabytes of HSI data in archives today representing a huge diversity of geographical settings, it seems natural to enquire as to whether there are universal patterns among HSI data sets. If such patterns exist, new techniques may be developed to exploit them, e.g., to enhance information extraction speed and accuracy. Since an understanding of the nature of HSI data has rarely gone beyond cursory, visual assessments of geographical setting; i.e., assessments of whether the data are of desert, forest, urban, littoral, etc., environments, it is perhaps worthwhile to develop methods to probe n-D hyperspace with the intent to identify and describe universal data commonalities, differences, classifications, and patterns. Building upon earlier work (Resmini, 2003 [1], 2006 [2]), an algorithm was created to describe the volume (and label the individual volume elements) of hyperspace occupied by an HSI data set. The algorithm essentially discretizes hyperspace assigning addresses to boxes in which data points (i.e., spectra) reside. The algorithm has been applied to visible/near-infrared to shortwave infrared (VNIR/SWIR) and longwave infrared (LWIR) HSI data cubes. Implemented in C code, the algorithm may also be used to calculate the fractal dimension of any array of points in any n-D hyperspace because it is essentially an implementation of box counting. The algorithm is described as are results of its application to actual HSI data sets. The fractal dimension of HSI data derived from the algorithm are also presented and compared to principal componentsbased estimates of data dimensionality. Application of the algorithm for developing a deeper understanding of the nature of HSI data as viewed as points in hyperspace is discussed as are practical applications for 'traditional' HSI exploitation activities such as anomaly and target detection.

In this paper, we propose a new spectral-spatial classification strategy to enhance the classification performances obtained on hyperspectral images by integrating rotation forests and Markov random fields (MRFs). First, rotation forests are performed to obtain the class probabilities based on spectral information. Rotation forests create diverse base learners using feature extraction and subset features. The feature set is randomly divided into several disjoint subsets; then, feature extraction is performed separately on each subset, and a new set of linear extracted features is obtained. The base learner is trained with this set. An ensemble of classifiers is constructed by repeating these steps several times. The weak classifier of hyperspectral data, classification and regression tree (CART), is selected as the base classifier because it is unstable, fast, and sensitive to rotations of the axes. In this case, small changes in the training data of CART lead to a large change in the results, generating high diversity within the ensemble. Four feature extraction methods, including principal component analysis (PCA), neighborhood preserving embedding (NPE), linear local tangent space alignment (LLTSA), and linearity preserving projection (LPP), are used in rotation forests. Second, spatial contextual information, which is modeled by MRF prior, is used to refine the classification results obtained from the rotation forests by solving a maximum a posteriori problem using the α-expansion graph cuts optimization method. Experimental results, conducted on three hyperspectral data with different resolutions and different contexts, reveal that rotation forest ensembles are competitive with other strong supervised classification methods, such as support vector machines. Rotation forests with local feature extraction methods, including NPE, LLTSA, and LPP, can lead to higher classification accuracies than that achieved by PCA. With the help of MRF, the proposed algorithms can improve the classification accuracies significantly, confirming the importance of spatial contextual information in hyperspectral spectral-spatial classification.

In order to quickly distinguish infertile eggs from fertile eggs, the hyperspectral imaging technology consisting of imaging and spectral information was used for detecting the fertile information of eggs. Before hatching eggs were incubated, a hyperspectral imaging system (wavelength between 400 to 1 000 nm) was used to acquire the images one-by-one manually. The characteristic information of ratios of length to short axis, elongation, roundness and the ratios of the yolk area to the whole area was extracted based on the images. The normalization method was used as the spectral data preprocessing, and then 155 spectral characteristic variables were extracted from 520 nm waveband through the correlation coefficient method. Principal component analysis (PCA) method was adopted to reduce the dimensions of image-spectrum fusion information; the top six principal components were extracted. Support vector machine (SVM) method was used to establish classification of fertile and infertile eggs models, which are based on image, spectrum and image-spectrum fusion information respectively. The accuracy rates of the SVM models were 84.00%, 90.00% and 93.00% respectively. The experimental results show that the model based on image-spectrum fusion information technology is superior to the single information model. Hyperspectral transmission imaging technology is effective and feasible to detect the fertile hatching eggs before incubation. Keywords: hyperspectral image, hatching eggs, information fusion, nondestructive detection DOI: 10.3965/j.ijabe.20150804.1672 Citation: Zhu Z H, Liu T, Xie D J, Wang Q H, Ma M H. Nondestructive detection of infertile hatching eggs based on spectral and imaging information. Int J Agric & Biol Eng, 2015; 8(4): 69－76.

Identifying individuals with target mutant phenotypes is a significant procedure in mutant exploitation for implementing genome editing technology in a crop breeding programme. In the present study, a rapid and non-invasive method was proposed to identify CRISPR/Cas9-induced rice mutants from their acceptor lines (huaidao-1 and nanjing46) using hyperspectral imaging in the near-infrared (NIR) range (874.41–1733.91 nm) combined with chemometric analysis. The hyperspectral imaging data were analysed using principal component analysis (PCA) for exploratory purposes, and a support vector machine (SVM) and an extreme learning machine (ELM) were applied to build discrimination models for classification. Meanwhile, PCA loadings and a successive projections algorithm (SPA) were used for extracting optimal spectral wavelengths. The SVM-SPA model achieved best performance, with classification accuracies of 93% and 92.75% being observed for calibration and prediction sets for huaidao-1 and 91.25% and 89.50% for nanjing46, respectively. Furthermore, the classification of mutant seeds was visualized on prediction maps by predicting the features of each pixel on individual hyperspectral images based on the SPA-SVM model. The above results indicated that NIR hyperspectral imaging together with chemometric data analysis could be a reliable tool for identifying CRISPR/Cas9-induced rice mutants, which would help to accelerate selection and crop breeding processes.

As the most classical unsupervised dimension reduction algorithm, principal component analysis (PCA) has been widely used in hyperspectral images (HSIs) preprocessing and analysis tasks. Recently proposed superpixelwise PCA (SuperPCA) has shown promising accuracy where superpixels segmentation technique was first used to segment an HSI to various homogeneous regions and then PCA was adopted in each superpixel block to extract the local features. However, the local features could be ineffective due to the neglect of global information especially in some small homogeneous regions and/or in some large homogeneous regions with mixed ground truth objects. In this article, a novel spectral–spatial and SuperPCA (S <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> -PCA) is proposed to learn the effective and low-dimensional features of HSIs. Inspired by SuperPCA we further adopt superpixels-based local reconstruction to filter the HSIs and use the PCA-based global features as the supplement of local features. It turns out that the global–local and spectral–spatial features can be well exploited. Specifically, each pixel of an HSI is reconstructed by the nearest neighbors’ pixels in the same superpixel block, which could eliminate the noise and enhance the spatial information adaptively. After the local reconstruction-based data preprocessing, PCA is performed on each region and the entire HSI to obtain local and global features, respectively. Then we simply concatenate them to get the global–local and spectral–spatial features for HSIs classification. The experimental results on two HSIs data sets demonstrate the superiority of the proposed method over the state-of-the-art methods. The source code of the proposed model is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/XinweiJiang/S3-PCA</uri> .

Due to the 3-D nature of hyperspectral images, as well as the spatial properties (such as regularity and continuity) of land covers, many 3-D feature extraction operators have been designed to fully exploit the joint spatial–spectral information. However, the large amount of obtained features can suffer from the “curse of dimensionality” problem, especially for the small training sample set. Moreover, various spatial–spectral features can represent the characteristics of the hyperspectral image from different aspects. In this paper, a multiple 3-D feature fusion framework (M3DF3) has been proposed for hyperspectral image classification. First, we extend the 2-D Gabor surface feature into 3-D (3DSF) domains to comply with the spatial–spectral structure of the hyperspectral image, which is directly applied on the original hyperspectral image instead of the Gabor features. Second, three 3-D feature extraction methods, including the 3-D morphological profile, the 3-D local binary pattern, and the proposed 3DSF, that, respectively, characterize the hyperspectral image from three different angles, i.e., morphology, local dependence, and shape smoothness, are fused under a multitask sparse representation framework to take full advantage of the multiple 3-D features together. The proposed M3DF3 approach was fully tested on three real-world hyperspectral image data, i.e., the widely used Indian Pines, Pavia University, and Houston University. The results show that our method can achieve as high as 68.22%, 79.44%, and 72.84% accuracies, respectively, even when only few samples, i.e., three samples per class, are used for training.

&lt;p&gt;Various face recognition methods are derived using local features among them the Local Binary Pattern (LBP) approach is very famous. The histogram techniques based on LBP is a complex task. Later Uniform Local Binary Pattern (ULBP) is derived on LBP, based on the bitwise transitions and ULBP’s are treated as the fundamental property of texture. The ULBP approach treated all Non-Uniform Local Binary Patterns’ (NULBP) into one miscellaneous label. Recently we have derived Prominent LBP (PLBP), Maximum PLBP (MPLBP) and Smallest PLBP (SPLBP). The PLBP consists of the majority of the ULBP’s and some of the NULBP’s. The basic disadvantage of these various variants of LBP’s is they are basically local approaches and completely failed in representing features derived from large regions or macrostructures, which are very much essential for faces. This paper derives PLBP’s on the large region. The rectangular region of this paper is assumed with a size of multiples of three and PLBPs are evaluated on dividing each region into multiple regions. The proposed Multi Region-PLBP (MR-PLBP) approach is tested on three facial databases namely Yale, Indian and AT&amp;amp;T ORL. The experimental results show the proposed approach significantly outperforms the other LBP based face recognition methods.&lt;/p&gt;

Many food products are subjected to quality control analyses for detection of surface residue/contaminants, and there is a trend of requiring more and more documentation and reporting by farmers regarding their use of pesticides. Recent outbreaks of food borne illnesses have been a major contributor to this trend. With a growing need for food safety measures and “smart applications” of insecticides, it is important to develop methods for rapid and accurate assessments of surface residues on food and feed items. As a model system, we investigated detection of a miticide applied to maize leaves and its miticidal bioactivity over time, and we compared two types of reflectance data: fourier transformed infrared (FTIR) data and hyperspectral imaging (HI) data. The miticide (bifenazate) was applied at a commercial field rate to maize leaves in the field, with or without application of a surfactant, and with or without application of a simulated “rain event”. In addition, we collected FTIR and HI from untreated control leaves (total of five treatments). Maize leaf data were collected at seven time intervals from 0 to 48 hours after application. FTIR data were analyzed using conventional analysis of variance of miticide-specific vibration peaks. Two unique FTIR vibration peaks were associated with miticide application (1,700 cm−1 and 763 cm−1). The integrated intensities of these two peaks, miticide application, surfactant, rain event, time between miticide application, and rain event were used as explanatory variables in a linear multi-regression fit to spider mite mortality. The same linear multi-regression approach was applied to variogram parameters derived from HI data in five selected spectral bands (664, 683, 706, 740, and 747 nm). For each spectral band, we conducted a spatial structure analysis, and the three standard variogram parameters (“sill”, “range”, and “nugget”) were examined as possible “indicators” of miticide bioactivity. We demonstrated that both FTIR peaks and standard variogram parameters could be used to accurately predict spider mite mortality, but linear multi-regression fits based on standard variogram parameters had the highest accuracy and were successfully validated with independent data. Based on experimental manipulation of HI data, the use of spatial structure analysis in classification of HI data was discussed.

Feature extraction (FE) methods based on low-rank representation (LRR) have become important topics in hyperspectral images (HSIs) data analysis. In this paper, a supervised FE method for HSIs data based on LRR with the ability to preserve the local pairwise constraints information (LRLPC) is proposed. LRLPC does not change the data dimensionality and only employs a technique to enrich the original feature space (OFS) and to obtain enriched feature space, which results in features richer than OFS. To overcome the problem of LRR in lacking the local structure information (LSI) of data, a local discriminative regularization term is imposed on the fitness function of LRR to keep the LSI of data. For nonlinear structure of data, LRLPC is extended to kernel LRLPC (KLRLPC) using kernel trick. Utilization of existing information in the pairwise constraints is useful for limited labeled samples situations as a common problem in HSI data analysis. The obtained experimental results using two well-known HSI data sets confirm the effectiveness of LRLPC and KLRLPC for dimension reduction and classification of HSIs.

Rapid and nondestructive identification of rice storage year using hyperspectral technology

Remote sensing Hyperspectral Image (HSI) comprises significant information about the earth’s surface which is actually acquired by hundred of narrow and adjacent spectral bands. The intended performance of classification accuracy does not attain due to the volume of the original HSI dataset and the enormous quantity of spectral bands. As such, dimensionality reduction approaches using feature extraction and selection are typically adopted to enhance classification performance. The unsupervised Principal Component Analysis (PCA), as well as the supervised Linear Discriminant Analysis (LDA), are commonly used as linear feature extraction methods for feature subspace detection. However, due to considering the effects of global variation, both PCA and LDA fail to extract local characteristics of HSI. In this paper, we propose a segmented LDA-based (SLDA) feature extraction where we apply the LDA in a segmented way to extract better local characteristics as well as global characteristics from the HSI. Per-pixel classification using a Support Vector Machine (SVM) is applied to our proposed SLDA method, PCA, Segmented-PCA (SPCA), and LDA on the Indian Pines agricultural HSI dataset. The experimental results show that the overall classification performance of SLDA (90.60%) remarkably outperforms all the other investigated methods: PCA (85.55%), SPCA (86.96%), LDA (86.45%), and the complete original dataset without employing any feature reduction method (83.10%). The proposed SLDA also requires the least amount of space complexity in different implementation scenarios.

Hyperspectral images (HSI) provide rich information which may not be captured by other sensing technologies and therefore gradually find a wide range of applications. However, they also generate a large amount of irrelevant or redundant data for a specific task. This causes a number of issues including significantly increased computation time, complexity and scale of prediction models mapping the data to semantics (e.g., classification), and the need of a large amount of labelled data for training. Particularly, it is generally difficult and expensive for experts to acquire sufficient training samples in many applications. This paper addresses these issues by exploring a number of classical dimension reduction algorithms in machine learning communities for HSI classification. To reduce the size of training dataset, feature selection (e.g., mutual information, minimal redundancy maximal relevance) and feature extraction (e.g., Principal Component Analysis (PCA), Kernel PCA) are adopted to augment a baseline classification method, Support Vector Machine (SVM). The proposed algorithms are evaluated using a real HSI dataset. It is shown that PCA yields the most promising performance in reducing the number of features or spectral bands. It is observed that while significantly reducing the computational complexity, the proposed method can achieve better classification results over the classic SVM on a small training dataset, which makes it suitable for real-time applications or when only limited training data are available. Furthermore, it can also achieve performances similar to the classic SVM on large datasets but with much less computing time.

With numerous and contiguous spectral bands acquired from visible light (400?1,000 nm) to (near) infrared (1,000?1,700 nm and over), hyperspectral imaging (HSI) can potentially identify different objects by detecting minor changes in temperature, moisture, and chemical content. As a result, HSI has been widely applied in a number of application areas, including remote sensing [1]. HSI data contains two-dimensional (2-D) spatial and one-dimensional spectral information, and naturally forms a three-dimensional (3-D) hypercube with a high spectral resolution in nanometers that enables robust discrimination of ground features. However, new challenges arise in dealing with extremely large data sets. For a hypercube with relatively small spatial dimension of 600 ? 400 pixels at 16 bits-per-band-per-pixel, the data volume becomes 120 MB for 250 spectral bands. In some cases, this large data volume can be linearly increased when multiple hypercubes are acquired across time to monitor system dynamics in consecutive time instants. When the ratio between the feature dimension (spectral bands) and the number of data samples (in vector-based pixels) is vastly different, high-dimensional data suffers from the well-known curse of dimensionality. For feature extraction and dimensionality reduction, principal components analysis (PCA) is widely used in HSI [2], where the number of extracted components is significantly reduced compared to the original feature dimension, i.e., the number of spectral bands. For effective analysis of large-scale data in HSI, conventional PCA faces three main challenges: