Sai Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Sai Zhang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Chuanli Kang
College of Geomatics and Geoinformation, Guilin University of Technology, Guilin 541004, China
3 shared publications - Siyi Wu
College of Geomatics and Geoinformation, Guilin University of Technology, Guilin 541004, China
3 shared publications - Zitao Lin
School of Environment and Spatial Informatics, China University of Mining and Technology, Xuzhou, China
3 shared publications - Chongming Geng
College of Geomatics and Geoinformation, Guilin University of Technology, Guilin 541004, China
2 shared publications - Yiling Lan
College of Geomatics and Geoinformation, Guilin University of Technology, Guilin 541004, China
2 shared publications - Jiale Yang
College of Geomatics and Geoinformation, Guilin University of Technology, Guilin 541004, China
1 shared publication
Latest Publications
- Open Access
Method to Solve Underwater Laser Weak Waves and Superimposed Waves
With the rapid development of Lidar technology, the use of Lidar for underwater terrain detection has become feasible. There is still a challenge in the process of signal resolution: the underwater laser echo signal is different to propagating in the air, and it is easy to produce weak waves and superimposed waves. However, existing waveform decomposition methods are not effective in processing these waveform signals, and the underwater waveform signal cannot be correctly decomposed, resulting in subsequent data-processing errors. To address these issues, this study used a drone equipped with a 532 nm laser to detect a pond as the study background. This paper proposes an improved inflection point selection decomposition method to estimate the parameter. By comparing it with other decomposition methods, we found that the RMSE is 2.544 and R2 is 0.995975, which is more stable and accurate. After estimating the parameters, this study used oscillating particle swarm optimization (OPSO) and the Levenberg–Marquardt algorithm (LM) to optimize the estimated parameters; the final results show that the method in this paper is closer to the original waveform. In order to verify the processing effect of the method on complex waveform, this paper decomposes and optimizes the simulated complex waveforms; the final RMSE is 0.0016, R2 is 1, and the Gaussian component after decomposition can fully represent the original waveform. This method is better than other decomposition methods in complex waveform decomposition, especially regarding weak waves and superimposed waves.
Open AccessMethod to Solve Underwater Laser Weak Waves and Superimposed Waves
With the rapid development of Lidar technology, the use of Lidar for underwater terrain detection has become feasible. There is still a challenge in the process of signal resolution: the underwater laser echo signal is different to propagating in the air, and it is easy to produce weak waves and superimposed waves. However, existing waveform decomposition methods are not effective in processing these waveform signals, and the underwater waveform signal cannot be correctly decomposed, resulting in subsequent data-processing errors. To address these issues, this study used a drone equipped with a 532 nm laser to detect a pond as the study background. This paper proposes an improved inflection point selection decomposition method to estimate the parameter. By comparing it with other decomposition methods, we found that the RMSE is 2.544 and R2 is 0.995975, which is more stable and accurate. After estimating the parameters, this study used oscillating particle swarm optimization (OPSO) and the Levenberg–Marquardt algorithm (LM) to optimize the estimated parameters; the final results show that the method in this paper is closer to the original waveform. In order to verify the processing effect of the method on complex waveform, this paper decomposes and optimizes the simulated complex waveforms; the final RMSE is 0.0016, R2 is 1, and the Gaussian component after decomposition can fully represent the original waveform. This method is better than other decomposition methods in complex waveform decomposition, especially regarding weak waves and superimposed waves.
- Open Access
- 4 June 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (11) , 2930
A Triangular Grid Filter Method Based on the Slope Filter
High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step. Therefore, designing an efficient, accurate, and stable ground extraction algorithm is highly significant for improving the processing efficiency and analysis accuracy of point cloud data. The study area in this article was a park in Guilin, Guangxi, China. The point cloud was obtained by utilizing the UAV platform. In order to improve the stability and accuracy of the filter algorithm, this article proposed a triangular grid filter based on the Slope Filter, found violation points by the spatial position relationship within each point in the triangulation network, improved KD-Tree-Based Euclidean Clustering, and applied it to the non-ground point extraction. This method is accurate, stable, and achieves the separation of ground points from non-ground points. Firstly, the Slope Filter is used to remove some non-ground points and reduce the error of taking ground points as non-ground points. Secondly, a triangular grid based on the triangular relationship between each point is established, and the violation triangle is determined through the grid; thus, the corresponding violation points are found in the violation triangle. Thirdly, according to the three-point collinear method to extract the regular points, these points are used to extract the regular landmarks by the KD-Tree-Based Euclidean Clustering and Convex Hull Algorithm. Finally, the dispersed points and irregular landmarks are removed by the Clustering Algorithm. In order to confirm the superiority of this algorithm, this article compared the filter effects of various algorithms on the study area and filtered the 15 data samples provided by ISPRS, obtaining an average error of 3.46%. The results show that the algorithm presented in this article has high processing efficiency and accuracy, which can significantly improve the processing efficiency of point cloud data in practical applications.
- 4 June 2023
- Published by MDPI AG in Remote Sensing
- Vol. 15 (11) , 2930
Open AccessA Triangular Grid Filter Method Based on the Slope Filter
High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step. Therefore, designing an efficient, accurate, and stable ground extraction algorithm is highly significant for improving the processing efficiency and analysis accuracy of point cloud data. The study area in this article was a park in Guilin, Guangxi, China. The point cloud was obtained by utilizing the UAV platform. In order to improve the stability and accuracy of the filter algorithm, this article proposed a triangular grid filter based on the Slope Filter, found violation points by the spatial position relationship within each point in the triangulation network, improved KD-Tree-Based Euclidean Clustering, and applied it to the non-ground point extraction. This method is accurate, stable, and achieves the separation of ground points from non-ground points. Firstly, the Slope Filter is used to remove some non-ground points and reduce the error of taking ground points as non-ground points. Secondly, a triangular grid based on the triangular relationship between each point is established, and the violation triangle is determined through the grid; thus, the corresponding violation points are found in the violation triangle. Thirdly, according to the three-point collinear method to extract the regular points, these points are used to extract the regular landmarks by the KD-Tree-Based Euclidean Clustering and Convex Hull Algorithm. Finally, the dispersed points and irregular landmarks are removed by the Clustering Algorithm. In order to confirm the superiority of this algorithm, this article compared the filter effects of various algorithms on the study area and filtered the 15 data samples provided by ISPRS, obtaining an average error of 3.46%. The results show that the algorithm presented in this article has high processing efficiency and accuracy, which can significantly improve the processing efficiency of point cloud data in practical applications.
- Open Access
- 30 May 2023
- Published by MDPI AG in Preprints.org
A Triangular Grid Filter Method Based on the Slope Filter
High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step. Therefore, designing an efficient, accurate, and stable ground extraction algorithm is of great significance for improving the processing efficiency and analysis accuracy of point cloud data. The study area in this article was a Park in Guilin, Guangxi, China. The point cloud was obtained by utilizing the UAV platform. In order to improve the stability and accuracy of the Filter algorithm, this article proposed a triangular grid filter based on Slope Filter, found violation points by the spatial position relationship within each point in the triangulation network, improved KD-Tree-Based Euclidean Clustering, and applied it to the non-ground points extraction, this method has good accuracy, stability and achieves good results in separating ground points from non-ground points. At first, using Slope Filter to remove some non-ground points, to reduce the error of taking ground points as non-ground points; Secondly, established a triangular grid based on the triangular relationship between each point, the violation-triangle can determin through the grid, and then the corresponding violation points were found in the violation-triangle; Thirdly, according to the three-point collinear method to extract the regular points, used these points to extract the regular landmarks by KD-Tree-Based Euclidean Clustering and Convex Hull Algorithm; Finally, removed disperse points and irregular landmarks by Clustering Algorithm. In order to confirm the superiority of this algorithm, this article compared the filter effects of various algorithms on the study area and filtered the 15 sample data provided by ISPRS, and obtained an average error of 3. 46%. The results showed that the algorithm in this article have a high processing efficiency and accuracy, which can greatly improve the processing efficiency of point cloud data in practical applications.
- 30 May 2023
- Published by MDPI AG in Preprints.org
Open AccessA Triangular Grid Filter Method Based on the Slope Filter
High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step. Therefore, designing an efficient, accurate, and stable ground extraction algorithm is of great significance for improving the processing efficiency and analysis accuracy of point cloud data. The study area in this article was a Park in Guilin, Guangxi, China. The point cloud was obtained by utilizing the UAV platform. In order to improve the stability and accuracy of the Filter algorithm, this article proposed a triangular grid filter based on Slope Filter, found violation points by the spatial position relationship within each point in the triangulation network, improved KD-Tree-Based Euclidean Clustering, and applied it to the non-ground points extraction, this method has good accuracy, stability and achieves good results in separating ground points from non-ground points. At first, using Slope Filter to remove some non-ground points, to reduce the error of taking ground points as non-ground points; Secondly, established a triangular grid based on the triangular relationship between each point, the violation-triangle can determin through the grid, and then the corresponding violation points were found in the violation-triangle; Thirdly, according to the three-point collinear method to extract the regular points, used these points to extract the regular landmarks by KD-Tree-Based Euclidean Clustering and Convex Hull Algorithm; Finally, removed disperse points and irregular landmarks by Clustering Algorithm. In order to confirm the superiority of this algorithm, this article compared the filter effects of various algorithms on the study area and filtered the 15 sample data provided by ISPRS, and obtained an average error of 3. 46%. The results showed that the algorithm in this article have a high processing efficiency and accuracy, which can greatly improve the processing efficiency of point cloud data in practical applications.