Browsing by Author "Chen, Shuhan"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
Item Exploration of Data Scene Characterization and 3D ROC Evaluation for Hyperspectral Anomaly Detection(MDPI, 2023-12-28) Chang, Chein-I; Chen, Shuhan; Zhong, Shengwei; Shi , YidanWhether or not a hyperspectral anomaly detector is effective is determined by two crucial issues, anomaly detectability and background suppressibility (BS), both of which are very closely related to two factors, the datasets used for a selected hyperspectral anomaly detector and detection measures used for its performance evaluation. This paper explores how anomaly detectability and BS play key roles in hyperspectral anomaly detection (HAD). To address these two issues, we investigate three key elements attributed to HAD. One is a selected hyperspectral anomaly detector, and another is the datasets used for experiments. The third one is the detection measures used to evaluate the effectiveness of a hyperspectral anomaly detector. As for hyperspectral anomaly detectors, twelve commonly used anomaly detectors were evaluated and compared. To address the appropriate use of datasets for HAD, seven popular and widely used datasets were studied for HAD. As for the third issue, the traditional area under a receiver operating characteristic (ROC) curve of detection probability—PD versus false alarm probability, PF, (AUC(D,F))—was extended to 3D ROC analysis where a 3D ROC curve was developed to generate three 2D ROC curves from which eight detection measures could be derived to evaluate HAD in all round aspects, including anomaly detectability, BS and joint anomaly detectability and BS. Qualitative analysis showed that many works reported in the literature which claimed that their developed hyperspectral anomaly detectors performed better than other anomaly detectors are actually not true because they overlooked these two issues. Specifically, a comprehensive study via extensive experiments demonstrated that these 3D ROC curve-derived detection measures can be further used to address the various characterizations of different data scenes and also to provide explanations as to why certain data scenes are not suitable for HAD.Item Iterative Random Training Sampling Spectral Spatial Classification for Hyperspectral Images(IEEE, 2020-07-09) Chang, Chein-I; Ma, Kenneth Yeonkong; Liang, Chia-Chen; Kuo, Yi-Mei; Chen, Shuhan; Zhong, ShengweiHyperspectral image classification (HSIC) has generated considerable interests over the past years. However, one of challenging issues arising in HSIC is inconsistent classification, which is mainly caused by random training sampling (RTS) of selecting training data. This is because a different set of training samples may produce a different classification result. A general approach to addressing this problem is the so-called K-fold method which implements RTS K times and takes the average of overall accuracy with respect to standard deviation to describe a confidence level of classification performance. To deal with this issue, this article develops an iterative RTS (IRTS) method as an alternative to the K-fold method to reduce the uncertainty caused by RTS. Its idea is to add the spatial filtered classification maps to the image cube that is currently being processed via feedback loops to augment image cubes iteratively. Then, the training samples will be reselected randomly from the new augmented image cubes iteration-by-iteration. As a result, the training samples selected from each iteration will be updated by new added spatial information captured by spatial filters implemented at the iteration. The experimental results clearly demonstrate that IRTS successfully improves classification accuracy as well as reduces inconsistency in results.Item Iterative Scale-Invariant Feature Transform for Remote Sensing Image Registration(IEEE, 2020-07-22) Chen, Shuhan; Zhong, Shengwei; Xue, Bai; Li, Xiaorun; Zhao, Liaoying; Chang, Chein-IDue to significant geometric distortions and illumination differences, developing techniques for high precision and robust multisource remote sensing image registration poses a great challenge. This article presents an iterative image registration approach, called iterative scale-invariant feature transform (ISIFT) for remote sensing images, which extends the traditional scale-invariant feature transform (SIFT)-based registration system to a close-feedback SIFT system that includes a rectification feedback loop to update rectified parameters in an iterative manner. Its key idea uses consistent feature point sets obtained by maximum similarity to calculate new alignment parameters to rectify the current sensed image and the resulting rectified sensed image is then fed back to update and replace the current sensed image as a new sensed image to reimplement SIFT for next iteration. The same process is repeated iteratively until an automatic stopping rule is satisfied. To evaluate the performance of ISIFT, both the simulated and real images are used for experiments for the validation of ISIFT. In addition, several data sets are particularly designed to conduct a comparative study and analysis with existing state-of-the-art methods. Furthermore, experiments with different rotation are also performed to verify the adaptability of ISIFT under different rotation distortions. The experimental results demonstrate that ISIFT improves performance and produces better registration accuracy than traditional SIFT-based methods and existing state-of-the-art methods.Item Optical Remote Sensing Image Registration Using Spatial-Consistency and Average Regional Information Divergence Minimization via Quantum-Behaved Particle Swarm Optimization(MDPI, 2020-09-19) Chen, Shuhan; Xue, Bai; Yang, Han; Li, Xiaorun; Zhao, Liaoying; Chang, Chein-IDue to invariance to significant intensity differences, similarity metrics have been widely used as criteria for an area-based method for registering optical remote sensing image. However, for images with large scale and rotation difference, the robustness of similarity metrics can greatly determine the registration accuracy. In addition, area-based methods usually require appropriately selected initial values for registration parameters. This paper presents a registration approach using spatial consistency (SC) and average regional information divergence (ARID), called spatial-consistency and average regional information divergence minimization via quantum-behaved particle swarm optimization (SC-ARID-QPSO) for optical remote sensing images registration. Its key idea minimizes ARID with SC to select an ARID-minimized spatial consistent feature point set. Then, the selected consistent feature set is tuned randomly to generate a set of M registration parameters, which provide initial particle warms to implement QPSO to obtain final optimal registration parameters. The proposed ARID is used as a criterion for the selection of consistent feature set, the generation of initial parameter sets, and fitness functions used by QPSO. The iterative process of QPSO is terminated based on a custom-designed automatic stopping rule. To evaluate the performance of SC-ARID-QPSO, both simulated and real images are used for experiments for validation. In addition, two data sets are particularly designed to conduct a comparative study and analysis with existing state-of-the-art methods. The experimental results demonstrate that SC-ARID-QPSO produces better registration accuracy and robustness than compared methods.Item Orthogonal Subspace Projection-Based Go-Decomposition Approach to Finding Low-Rank and Sparsity Matrices for Hyperspectral Anomaly Detection(IEEE, 2020-07-14) Chang, Chein-I; Cao, Hongju; Chen, Shuhan; Shang, Xiaodi; Yu, Chunyan; Song, MeipingLow-rank and sparsity-matrix decomposition (LRaSMD) has received considerable interests lately. One of effective methods for LRaSMD is called go decomposition (GoDec), which finds low-rank and sparse matrices iteratively subject to the predetermined low-rank matrix order m and sparsity cardinality k. This article presents an orthogonal subspace-projection (OSP) version of GoDec to be called OSPGoDec, which implements GoDec in an iterative process by a sequence of OSPs to find desired low-rank and sparse matrices. In order to resolve the issues of empirically determining p = m + j and k, the well-known virtual dimensionality (VD) is used to estimate p in conjunction with the Kuybeda et al. developed minimax-singular value decomposition (MX-SVD) in the maximum orthogonal complement algorithm (MOCA) to estimate k. Consequently, LRaSMD can be realized by implementing OSP-GoDec using p and k determined by VD and MX-SVD, respectively. Its application to anomaly detection demonstrates that the proposed OSP-GoDec coupled with VD and MX-SVD performs very effectively and better than the commonly used LRaSMD-based anomaly detectors.