To realize the effective application of interactive 3D technology in IETM, this paper proposes an interactive 3D method based on three.js. Using three.js, IETM can conveniently load and obtain the object information of the 3D model. According to the obtained information, IETM can further create and display the animations of the 3D model. Based on three.js, IETM can also read the information stored in the data module to establish cross-references between 3D model objects and other elements in IETM. By controlling the web pages generated by IETM, users can control 3D model objects and achieve full interaction. In order to avoid operation conflicts, view, animation and manipulation modes are set in the proposed method to realize the full interaction between users and the 3D scene.
KEYWORDS: Detection and tracking algorithms, Binary data, Sensors, Principal component analysis, Image processing, Projection systems, Mahalanobis distance, Spectroscopy, Spatial resolution, Signal to noise ratio
Due to lacking use of prior information, the anomaly detection results are not always satisfactory. However, with the establishment of the spectral library, it becomes possible to obtain one or more spectra of the background in the image to be detected. If we can make use of such background information that is always ignored or discarded, the detection result is very likely to be improved. Hence, we proposed a hyperspectral anomaly detection method using a background endmember signature. To better separate the anomaly from the background, we first perform spectral unmixing to estimate the abundance matrix for further study instead of the original spectral data. In this process, we introduce a non-negative matrix factorization-based unmixing method and a corresponding initialization method using a background endmember. Then the low-rank property contained in the abundance matrix is exploited. A low-rank decomposition method is used to separate the anomalies. The proposed algorithm is evaluated on both synthetic and real data sets. Experiment results show the effectiveness of the proposed method and the improvement brought by the usage of a known background endmember.
Anomaly detection (AD) is an important technique for hyperspectral image processing and analysis. Typically, it is accomplished by extracting knowledge from the background and distinguishing anomalies and background using the difference between them. However, it is almost impossible to obtain “pure” background to achieve an ideal detection because of anomaly contamination. The low-rank and sparse matrix decomposition (LRaSMD) technique has been proved to have the potential to solve the aforementioned problem. But the accuracy and time consumption need to be further improved. Thus we propose a local hyperspectral AD method based on LRaSMD with an optimization algorithm for better performance. The LRaSMD technique is first implemented with semisoft Go decomposition (GoDec) rather than GoDec to quickly and accurately set the background apart from the anomalies. Then the low-rank prior knowledge of the background is fully explored to compute the background statistics. After that, the local Mahalanobis distance of pixels is calculated with the sliding dual-window strategy to detect the probable anomalies. The proposed method is validated using four real hyperspectral data sets with ground-truth information. Our experimental results indicate that the proposed method achieves better detection performance as compared with the comparison algorithms.
Nonnegative matrix factorization (NMF) is a widely used method of hyperspectral unmixing (HU) since it can simultaneously decompose the hyperspectral data matrix into two nonnegative matrices. While traditional NMF cannot guarantee the sparsity of the decomposition results and remain the geometric structure during the decomposition. On the other hand, deep learning, with carefully designed multi-layer structures, has shown great potential in learning data representation and been widely used in many fields. In this paper, we proposed a graph-regularized and sparsityconstrained deep NMF (GSDNMF) for hyperspectral unmixing. The deep NMF structure was acquired by unfolding NMF into multiple layers. To improve the unmixing performance, the L1 regularizers of both the endmember and abundance matrices were used to add sparsity constraint. And the graph regularization term in each layer was also incorporated to remain the geometric structure. Since the model is a multi-factor NMF problem, it is difficult to optimize all the factors simutaneously. In order to acquire better intializations for the model, we proposed a layer-wise pretraining strategy to initialize the deep network based on the efficient NMF solver, NeNMF. An alternative update algorithm was also proposed to further fine-tune the network to obtain the final decompositon results. Experiments on both the synthetic data and real data demonstrate that our algorithm outperforms several state-of-art approaches.
Hyperspectral unmixing (HU) refers to the process of decomposing the hyperspectral image into a set of endmember spectra and the corresponding set of abundance fractions. Non-negative matrix factorization (NMF) has been widely used in HU. However, most NMF-based unmixing methods have single-decomposition structures, which may have poor performance for highly mixed and ill-conditioned data. We proposed a sparsity-constrained multilayer NMF (MLNMF) method for spectral unmixing of highly mixed data. The MLNMF structure was established by decomposing the abundance matrix layer-by-layer to acquire the endmember matrix and the abundance matrix in the next layer. To reduce the space of solutions, sparsity constraints were added to the multilayer model by incorporating an L1 regularizer to the abundance matrix in each layer. Moreover, a layerwise strategy based on the Nesterov’s optimal gradient method was also proposed to optimize the multifactor NMF problem. Experiments on both synthetic data and real data demonstrate that our proposed method outperforms several other state-of-art approaches.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.