Ke Guo

Ke Guo


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 August 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YLYiping Li
Yiping Li
XZXiangbing Zhou
Xiangbing Zhou
建G建刚 gu
建刚 gu
KGKe Guo
Ke Guo
Wu DengWu Deng
Wu Deng
With rapid economic and demographic growth, traffic conditions in medium and large cities are becoming extremely congested. Numerous metropolitan management organizations hope to promote the coordination of traffic and urban development by formulating and improving traffic development strategies. The effectiveness of these solutions depends largely on an accurate assessment of the distribution of urban hotspots (centers of traffic activity). In recent years, many scholars have employed the K-Means clustering technique to identify urban hotspots, believing it to be efficient. K-means clustering is a sort of iterative clustering analysis. When the data dimensionality is large and the sample size is enormous, the K-Means clustering algorithm is sensitive to the initial clustering centers. To mitigate the problem, a hybrid heuristic “fuzzy system-particle swarm-genetic” algorithm, named FPSO-GAK, is employed to obtain better initial clustering centers for the K-Means clustering algorithm. The clustering results are evaluated and analyzed using three-cluster evaluation indexes (SC, SP and SSE) and two-cluster similarity indexes (CI and CSI). A taxi GPS dataset and a multi-source dataset were employed to test and validate the effectiveness of the proposed algorithm in comparison to the Random Swap clustering algorithm (RS), Genetic K-means algorithm (GAK), Particle Swarm Optimization (PSO) based K-Means, PSO based constraint K-Means, PSO based Weighted K-Means, PSO-GA based K-Means and K-Means++ algorithms. The comparison findings demonstrate that the proposed algorithm can achieve better clustering results, as well as successfully acquire urban hotspots.

15 September 2019 in Minerals
Verified
Journal Article
Open access
PDF file
BLBinbin Li
Binbin Li
BLBingli Liu
Bingli Liu
KGKe Guo
Ke Guo
CLCheng Li
Cheng Li
BWBin Wang
Bin Wang
The effective integration of geochemical data with multisource geoscience data is a necessary condition for mapping mineral prospects. In the present study, based on the maximum entropy principle, a maximum entropy model (MaxEnt model) was established to predict the potential distribution of copper deposits by integrating 43 ore-controlling factors from geological, geochemical and geophysical data. The MaxEnt model was used to screen the ore-controlling factors, and eight ore-controlling factors (i.e., stratigraphic combination entropy, structural iso-density, Cu, Hg, Li, La, U, Na2O) were selected to establish the MaxEnt model to determine the highest potential zone of copper deposits. The spatial correlation between each ore-controlling factor and the occurrence of a copper mine was studied using a response curve, and the relative importance of each ore-controlling factor was determined by jackknife analysis in the MaxEnt model. The results show that the occurrence of copper ore is positively correlated with the content of Cu, Hg, La, structural iso-density and stratigraphic combination entropy, and negatively correlated with the content of Na2O, Li and U. The model’s performance was evaluated by the area under the receiver operating characteristic curve (AUC), Cohen’s maximized Kappa and true skill statistic (TSS) (training AUC = 0.84, test AUC = 0.8, maximum Kappa = 0.5 and maximum TSS = 0.6). The results indicate that the model can effectively integrate multi-source geospatial data to map mineral prospectivity.

1 September 2022 in Remote Sensing
Verified
Journal Article
Open access
PDF file
RCruichun chang
ruichun chang
Zhe ChenZhe Chen
Zhe Chen
DWDaming Wang
Daming Wang
KGKe Guo
Ke Guo
Long-term degradation of black soil has led to reductions in soil fertility and ecological service functions, which have seriously threatened national food security and regional ecological security. This study is motivated by the UN’s Sustainable Development Goal (SDG) 2—Zero Hunger, specifically, SDG 2.4 Sustainable Food Production Systems. The aim was to monitor the soil organic matter (SOM) content of black soil and its dynamics via hyperspectral remote sensing inversion. This is of great significance to the effective utilization and sustainable development of black soil resources. Taking the typical black soil area of Northeast China as an example, the hyperspectral data of ground features were compared with SOM contents measured in soil samples to correlate SOM with spectral features. Based on their quantitative relationship, a dynamic fitness inertia weighted particle swarm optimization (DPSO) algorithm is proposed, which balances the global and local search abilities of a particle swarm optimization algorithm. The DPSO algorithm is applied to the parameter adjustment of an artificial neural network (BPNN), which is used instead of a traditional error back propagation algorithm, to build a DPSO-BPNN model. Then a global optimal analytical expression of hyperspectral inversion is obtained to improve the generalization ability and stability of the remote sensing quantitative inversion model. The results show that DPSO-BPNN model is more stable and accurate than existing models, such as multiple stepwise regression, partial least squares, and BP neural network models (adjust complex coefficient of determination = 0.89, root mean square error = 1.58, relative recent deviation = 2.93). The results of DPSO-BPNN inversion are basically consistent with the trend in SOM contents measured during surface geochemical exploration. As such, this study provides a basis for hyperspectral remote sensing inversion and monitoring of the SOM contents in black soil.

3 September 2020 in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
Verified
Journal Article
Open access
HHHongwei Han
Hongwei Han
GWGuxi Wang
Guxi Wang
MWMaozhi Wang
Maozhi Wang
JMJiaqing Miao
Jiaqing Miao
SGSi Guo
Si Guo
KGKe Guo
Ke Guo
In recent years, sparse unmixing has attracted significant attention as it can effectively avoid the bottleneck problems associated with the absence of pure pixels and the estimation of the number of endmembers in hyperspectral scenes. The joint-sparsity model has outperformed the single sparse unmixing method. However, the joint-sparsity model might cause some aliasing artifacts for the pixels on the boundaries of different constituent endmembers. To address this shortcoming, researchers have developed many unmixing algorithms based on low-rank representation, which makes good use of the global structure of data. In addition, the high mutual coherence of spectral libraries strongly affects the applicability of spare unmixing. In this study, adopting combined constraints imposing sparsity and low rankness, a novel algorithm called non-convex joint-sparsity and low-rank unmixing with dictionary pruning (NCJSpLRUDP) is developed. In particular, we impose sparsity on the abundance matrix using the l2,p mixed norm, and we also employ the weighted Schatten p-norm instead of the convex nuclear norm as an approximation for the rank. The key parameter p is set between 0.4 and 0.6, and a good quality sparse solution is generated. The effectiveness of the proposed algorithm is demonstrated on both simulated and real hyperspectral datasets.

4 November 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
CHChun He
Chun He
KGKe Guo
Ke Guo
CHChun He
Chun He
In recent years, image filtering has been a hot research direction in the field of image processing. Experts and scholars have proposed many methods for noise removal in images, and these methods have achieved quite good denoising results. However, most methods are performed on single noise, such as Gaussian noise, salt and pepper noise, multiplicative noise, and so on. For mixed noise removal, such as salt and pepper noise + Gaussian noise, although some methods are currently available, the denoising effect is not ideal, and there are still many places worthy of improvement and promotion. To solve this problem, this paper proposes a filtering algorithm for mixed noise with salt and pepper + Gaussian noise that combines an improved median filtering algorithm, an improved wavelet threshold denoising algorithm and an improved Non-local Means (NLM) algorithm. The algorithm makes full use of the advantages of the median filter in removing salt and pepper noise and demonstrates the good performance of the wavelet threshold denoising algorithm and NLM algorithm in filtering Gaussian noise. At first, we made improvements to the three algorithms individually, and then combined them according to a certain process to obtain a new method for removing mixed noise. Specifically, we adjusted the size of window of the median filtering algorithm and improved the method of detecting noise points. We improved the threshold function of the wavelet threshold algorithm, analyzed its relevant mathematical characteristics, and finally gave an adaptive threshold. For the NLM algorithm, we improved its Euclidean distance function and the corresponding distance weight function. In order to test the denoising effect of this method, salt and pepper + Gaussian noise with different noise levels were added to the test images, and several state-of-the-art denoising algorithms were selected to compare with our algorithm, including K-Singular Value Decomposition (KSVD), Non-locally Centralized Sparse Representation (NCSR), Structured Overcomplete Sparsifying Transform Model with Block Cosparsity (OCTOBOS), Trilateral Weighted Sparse Coding (TWSC), Block Matching and 3D Filtering (BM3D), and Weighted Nuclear Norm Minimization (WNNM). Experimental results show that our proposed algorithm is about 2–7 dB higher than the above algorithms in Peak Signal-Noise Ratio (PSNR), and also has better performance in Root Mean Square Error (RMSE), Structural Similarity (SSIM), and Feature Similarity (FSIM). In general, our algorithm has better denoising performance, better restoration of image details and edge information, and stronger robustness than the above-mentioned algorithms.

24 September 2021 in Minerals
Verified
Journal Article
Open access
PDF file
CLCheng Li
Cheng Li
BLBingli Liu
Bingli Liu
KGKe Guo
Ke Guo
BLBinbin Li
Binbin Li
YKYunhui Kong
Yunhui Kong
The smoothing effect of data interpolation could cause useful information loss in geochemical mapping, and the uncertainty assessment of geochemical anomaly could help to extract reasonable anomalies. In this paper, multiple-point geostatistical simulation and local singularity analysis (LSA) are proposed to identify regional geochemical anomalies and potential mineral resources areas. Taking Cu geochemical data in the Mila Mountain Region, southern Tibet, as an example, several conclusions were obtained: (1) geochemical mapping based on the direct sampling (DS) algorithm of multiple-point geostatistics can avoid the smoothing effect through geochemical pattern simulation; (2) 200 realizations generated by the direct sampling simulation reflect the uncertainty of an unsampled value, and the geochemical anomaly of each realization can be extracted by local singularity analysis, which shows geochemical anomaly uncertainty; (3) the singularity-quantile (S-Q) analysis method was used to determine the separation thresholds of E-type α, and uncertainty analysis was carried out on the copper anomaly to obtain the anomaly probability map, which should be more reasonable than the interpolation-based geochemical map for geochemical anomaly identification. According to the anomaly probability and favorable geological conditions in the study area, several potential mineral resource targets were preliminarily delineated to provide direction for subsequent mineral exploration.