Search

As one of the most important algorithms in target detection, constrained energy minimization (CEM) has been widely used and developed in recent years. However, it is easy to verify that the target detection result of CEM varies with the data origin, which is apparently unreasonable since the distribution of the target of interest is objective and, therefore, unrelated to the selection of data origin. The clever eye (CE) algorithm tries to solve this problem by adding the data origin as a new variable from the perspective of the filter output energy. However, due to the nonconvexity of the objective function, CE can only obtain locally optimal solutions by using the gradient ascent method. In this article, we find a striking conclusion that there exists an analytical solution for CE that corresponds to the solution of a linear equation and further prove that all the solutions of the linear equation are globally optimal. [ABSTRACT FROM AUTHOR]

Target detection algorithms for hyperspectral remote sensing imagery, such as the two most commonly used remote sensing detection algorithms, the constrained energy minimization (CEM) and matched filter (MF), can usually be attributed to the inner product between a weight filter (or detector) and a pixel vector. CEM and MF have the same expression except that MF requires data centralization first. However, this difference leads to a difference in the target detection results. That is to say, the selection of the data origin could directly affect the performance of the detector. Therefore, does there exist another data origin other than the zero and mean-vector points for a better target detection performance? This is a very meaningful issue in the field of target detection, but it has not been paid enough attention yet. In this study, we propose a novel objective function by introducing the data origin as another variable, and the solution of the function is corresponding to the data origin with the minimal output energy. The process of finding the optimal solution can be vividly regarded as a clever eye automatically searching the best observing position and direction in the feature space, which corresponds to the largest separation between the target and background. Therefore, this new algorithm is referred to as the clever eye algorithm (CE). Based on the Sherman–Morrison formula and the gradient ascent method, CE could derive the optimal target detection result in terms of energy. Experiments with both synthetic and real hyperspectral data have verified the effectiveness of our method. [ABSTRACT FROM AUTHOR]

How to find the representative bands is a key issue in band selection for hyperspectral data. Very often, unsupervised band selection is associated with data clustering, and the cluster centers (or exemplars) are considered ideal representatives. However, partitioning the bands into clusters may be very time-consuming and affected by the distribution of the data points. In this letter, we propose a new band selection method, i.e., exemplar component analysis (ECA), aiming at selecting the exemplars of bands. Interestingly, ECA does not involve actual clustering. Instead, it prioritizes the bands according to their exemplar score, which is an easy-to-compute indicator defined in this letter measuring the possibility of bands to be exemplars. As a result, ECA is of high efficiency and immune to distribution structures of the data. The experiments on real hyperspectral data set demonstrate that ECA is an effective and efficient band selection method. [ABSTRACT FROM PUBLISHER]

Band selection (BS) plays an important role in the dimensionality reduction of hyperspectral data. However, as to the existing BS methods, few are specially designed for target detection. In this letter, we combine the target detection and BS process together and put forward a new BS method for target detection, named least absolute shrinkage and selection operator (LASSO)-based BS (LBS). Interestingly, by using a linear regression model with L1 regularization (LASSO model), LBS transforms the discrete BS problem into the continuous optimization problem, which cannot only avoid the complicated subset selection process but also evaluate the importance of all the bands simultaneously. The experiments on real hyperspectral data demonstrate that LBS is a very effective BS method for target detection. [ABSTRACT FROM PUBLISHER]

Most unsupervised band selection methods take the information of bands into account, but few of them pay attention to the quality of bands. In this paper, by combining idea of noise-adjusted principal components (NAPCs) with a state-of-art band selection method [maximum determinant of covariance matrix (MDCM)], we define a new index \mbiQ to quantitatively measure the quality of the hyperspectral data cube. Both signal-to-noise ratios (SNRs) and correlation of bands are simultaneously considered in \mbiQ. Based on the new index defined in this article, we propose an unsupervised band selection method called minimum noise band selection (MNBS). Taking the quality (\mbiQ) of the data cube as selection criterion, MNBS tries to find the bands with both high SNRs and low correlation (high \mbiQ). The subset selection method, sequential backward selection (SBS), is used in MNBS to improve the search efficiency. Some comparative experiments based on simulated as well as real hyperspectral data are conducted to evaluate the performance of MNBS in this study. The experimental results show that the bands selected by MNBS are always more effective than those selected by other methods in terms of classification. [ABSTRACT FROM PUBLISHER]

Target detection has recently drawn considerable interest in hyperspectral image processing. People tend to exclude corrupted or badly damaged bands before applying the target detection algorithm to the data for better detection results. In this letter, it is proved that adding any band independent of the original image, even a noisy band, would be always beneficial to the performance of constrained energy minimization in terms of output energy. Finally, several tests are conducted to further justify our viewpoint. [ABSTRACT FROM PUBLISHER]

This letter proposes a small target detection method for the hyperspectral image based on higher order statistics. This method first calculates the coskewness tensor of the hyperspectral image, followed by the orthogonal decomposition using higher order singular value decomposition. The obtained singular vectors are then used to perform the orthogonal transform to the centralized image. Compared to the popular blind source separation techniques, the presented method keeps clear of nonconvergence. Experiments with a real hyperspectral image show that the interested small target will be presented in the first few bands (even in the first band) very clearly after the transformation. [ABSTRACT FROM PUBLISHER]

Abstract: A fast endmember-extraction algorithm based on Gaussian Elimination Method (GEM) is proposed in this paper under the fact that a pixel is an endmember if it has the maximum value in any spectral band of a hyperspectral image when based on linear mixing model. Applying Gaussian elimination is much like performing a lower triangular matrix to transform the hyperspectral image. As more endmembers have been extracted, fewer bands are needed to be involved in the Gaussian elimination process, thus greatly reducing the computing time. The experimental results with both simulated and real hyperspectral images indicate that the method proposed here is much faster than the vertex component analysis (VCA) method, and can provide a similar performance with VCA. [Copyright &y& Elsevier]