Search

This paper proposes a solution to the problem of mobile robot navigation and trajectory interpolation in dynamic environments with large scenes. The solution combines a semantic laser SLAM system that utilizes deep learning and a trajectory interpolation algorithm. The paper first introduces some open-source laser SLAM algorithms and then elaborates in detail on the general framework of the SLAM system used in this paper. Second, the concept of voxels is introduced into the occupation probability map to enhance the ability of local voxel maps to represent dynamic objects. Then, in this paper, we propose a PointNet++ point cloud semantic segmentation network combined with deep learning algorithms to extract deep features of dynamic point clouds in large scenes and output semantic information of points on static objects. A descriptor of the global environment is generated based on its semantic information. Closed-loop completion of global map optimization is performed to reduce cumulative error. Finally, T-trajectory interpolation is utilized to ensure the motion performance of the robot and improve the smooth stability of the robot trajectory. The experimental results indicate that the combination of the semantic laser SLAM system with deep learning and the trajectory interpolation algorithm proposed in this paper yields better graph-building and loop-closure effects in large scenes at SIASUN large scene campus. The use of T-trajectory interpolation ensures vibration-free and stable transitions between target points. [ABSTRACT FROM AUTHOR]

With the increasing utilization of sampling-based path planning methods in the field of mobile robots, the RRT* algorithm faces challenges in complex indoor scenes, including high sampling randomness and slow convergence speed. To tackle these issues, this paper presents an improved RRT* path-planning algorithm based on the generalized Voronoi diagram with an adaptive bias strategy. Firstly, the algorithm leverages the properties of the generalized Voronoi diagram (GVD) to obtain heuristic paths, and a sampling region with target bias is constructed, increasing the purposefulness of the sampling process. Secondly, the node expansion process incorporates an adaptive bias strategy, dynamically adjusting the step size and expanding direction. This strategy allows the algorithm to adapt to the local environment leading to improved convergence speed. To ensure the generation of smooth paths, the paper employs the cubic spline curve interpolation algorithm for trajectory optimization to ensure that the mobile robotic can obtain the best trajectory. Finally, the proposed algorithm is experimentally compared with existing algorithms, including the RRT* and Informed-RRT* algorithms, to verify the feasibility and stability. [ABSTRACT FROM AUTHOR]

The skid resistance of asphalt pavement is an important factor affecting road safety. However, few studies have characterized the contribution of the macro- and micro-texture to the skid resistance of asphalt pavement. In this paper, the generalized extreme studentized deviate (GESD) and neighboring-region interpolation algorithm (NRIA) were used to identify and replace outliers, and median filters were used to suppress noise in texture data to reconstruct textures. On this basis, the separation of the macro- and micro-texture and the Monte Carlo algorithm were used to characterize the skid resistance of asphalt pavement. The results show that the GESD method can accurately identify outliers in the texture, and the median filtering can eliminate burrs in texture data while retaining more original detail information. The contribution of the macro-texture on the skid resistance is mainly attributed to the frictional resistance caused by the adhesion and elastic hysteresis, and the main contribution of the micro-texture is a micro-bulge cutting part in the friction mechanism. This investigation can provide inspiration for the interior mechanism and the specific relationship between the pavement textures and the skid resistance of asphalt pavement. [ABSTRACT FROM AUTHOR]

In autonomous driving systems, high-speed and real-time image processing, along with object recognition, are crucial technologies. This paper builds upon the research achievements in industrial item-sorting systems and proposes an object-recognition and sorting system for autonomous driving. In industrial sorting lines, goods-sorting robots often need to work at high speeds to efficiently sort large volumes of items. This poses a challenge to the robot's real-time vision and sorting capabilities, making it both practical and economically viable to implement a real-time and low-cost sorting system in a real-world industrial sorting line. Existing sorting systems have limitations such as high cost, high computing resource consumption, and high power consumption. These issues mean that existing sorting systems are typically used only in large industrial plants. In this paper, we design a high-speed, low-cost, low-resource-consumption FPGA (Field-Programmable Gate Array)-based item-sorting system that achieves similar performance to current mainstream sorting systems but at a lower cost and consumption. The recognition component employs a morphological-recognition method, which segments the image using a frame difference algorithm and then extracts the color and shape features of the items. To handle sorting, a six-degrees-of-freedom robotic arm is introduced into the sorting segment. The improved cubic B-spline interpolation algorithm is employed to plan the motion trajectory and consequently control the robotic arm to execute the corresponding actions. Through a series of experiments, this system achieves an average recognition delay of 25.26 ms, ensures smooth operation of the gripping motion trajectory, minimizes resource consumption, and reduces implementation costs. [ABSTRACT FROM AUTHOR]

With the increase in the use of high-frequency power electronic devices, the harmonics injected into the power grid show a trend of high-frequency development. The continuous rise of the supraharmonic emission level in the distribution network has become one of the power quality problems that needs to be solved urgently in the power grid. In this paper, an algorithm based on the Interpolation of the Self-convolutional Window All-phase Compressive Sampling Matching Pursuit (ISWApCoSaMP) is proposed. Firstly, the self-convolution operation is used for the maximum sidelobe decay (MSD) window, and then the compressed sampling matching pursuit model based on the All-phase is constructed, leading to the All-phase Compressive Sampling Matching Pursuit (ApCoSaMP). Finally, the four-spectrum-line interpolation is combined to utilize spectrum line information to improve the accuracy of signal parameter detection in the frequency domain. The introduced All-phase greatly improves the phase measurement accuracy because the initial phase of the supraharmonic signal is selected for phase estimation. In addition, the self-convolutional window and four-spectrum-line interpolation make full use of the information in the time and frequency domains, thus optimizing the measurement results of amplitude and frequency. The algorithm achieves high accuracy in the measurement results of simulated signals and accurately measures supraharmonics. [ABSTRACT FROM AUTHOR]

The construction of a high-precision geomagnetic map is a prerequisite for geomagnetic navigation and magnetic target-detection technology. The Kriging interpolation algorithm makes use of the variogram to perform linear unbiased and optimal estimation of unknown sample points. It has strong spatial autocorrelation and is one of the important methods for geomagnetic map construction. However, in a region with a complex geomagnetic field, the sparse geomagnetic survey lines make the ratio of line-spacing resolution to in-line resolution larger, and the survey line direction differs from the geomagnetic trend, which leads to a serious effect of geometric anisotropy and thus, reduces the interpolation accuracy of the geomagnetic maps. Therefore, this paper focuses on the problem of geometric anisotropy in the process of constructing a geomagnetic map with sparse data, analyzes the influence of sparse data on geometric anisotropy, deduces the formula of geometric anisotropy correction, and proposes a modified interpolation algorithm accounting for geometric anisotropy correction of variogram for sparse geomagnetic data. The results of several sets of simulations and measured data show that the proposed method has higher interpolation accuracy than the conventional spherical variogram model in a region where the geomagnetic anomaly gradient changes sharply, which provides an effective way to build a high-precision magnetic map of the complex geomagnetic field under the condition of sparse survey lines. [ABSTRACT FROM AUTHOR]

With the proposal of intelligent mines, the demand for drilling is increasing daily. Therefore, it is particularly crucial to gather more geological data by interpolation of limited drilling data for subsequent three-dimensional geological modeling. In this paper, a hybrid sparrow optimization Kriging model (HSSA), in which chaos theory and Levy flight are integrated into the initial population update algorithm of the sparrow algorithm and the location update algorithm of the entrants, is proposed. Next, the golden sine optimization algorithm is introduced into the reconnaissance and early warning mechanism of the sparrow algorithm to further improve the accuracy and local escape ability. By the correlation optimization of the original sparrow algorithm, the speed and accuracy of swarm intelligence optimization are further improved. In addition, the model solves the parameters of the variation function of the ordinary Kriging interpolation and reduces the generation error of the formation data interpolation. The results of relevant experiments show that the hybrid sparrow optimization Kriging model improves the accuracy and convergence speed compared with other swarm intelligence algorithms and that the accuracy of this model is improved by 8.4% compared with the original Kriging interpolation algorithm. Based on the hybrid sparrow optimization Kriging model, we propose a three-dimensional stratigraphic model for the Yangchangwan Coal Mine, which provides further support for mining operations and three-dimensional stratigraphic research in this area. The accuracy and applicability of the hybrid sparrow optimization Kriging model are further explained using a case study with the stratigraphic model data in the Yangchangwan Coal Mine. HSSA with significant potential for applications in industries such as coal mining and geological exploration. In these fields, the efficient acquisition, processing, and modeling of stratigraphic data are critical for enhancing geological interpretation and optimizing operational workflows. [ABSTRACT FROM AUTHOR]

In this paper, we consider a novel vector-valued rational interpolation algorithm and its application. Compared to the classic vector-valued rational interpolation algorithm, the proposed algorithm relaxes the constraint that the denominators of components of the interpolation function must be identical. Furthermore, this algorithm can be applied to construct the vector-valued interpolation function component-wise, with the help of the common divisors among the denominators of components. Through experimental comparisons with the classic vector-valued rational interpolation algorithm, it is found that the proposed algorithm exhibits low construction cost, low degree of the interpolation function, and high approximation accuracy. [ABSTRACT FROM AUTHOR]

This paper presents an approach to scattered data interpolation using q-Bézier triangular patches via an efficient algorithm. While existing studies have formed q-Bézier triangular patches through convex combination, their application to scattered data interpolation has not been previously explored. Therefore, this study aims to extend the use of q-Bézier triangular patches to scattered data interpolation by achieving C 1 continuity throughout the data points. We test the proposed scheme using both established data points and real-life engineering problems. We compared the performance of the proposed interpolation scheme with a well-known existing scheme by varying the q parameter. The comparison was based on visualization and error analysis. Numerical and graphical results were generated using MATLAB. The findings indicate that the proposed scheme outperforms the existing scheme, demonstrating a higher coefficient of determination ( R 2 ), smaller root mean square error (RMSE), and faster central processing unit (CPU) time. These results highlight the potential of the proposed q-Bézier triangular patches scheme for more accurate and reliable scattered data interpolation via the proposed algorithm. [ABSTRACT FROM AUTHOR]

With the enrichment of GNSS data and the improvement in data processing accuracy, GNSS technology has been widely applied in fields such as crustal deformation. The Crustal Movement Observation Network of China (CMONOC) has provided decades of Global Navigation Satellite System (GNSS) data and related data products for crustal deformation research on the Chinese mainland. The coordinate time series of continuously observed reference stations contain abundant information on crustal movements. In contrast, the coordinate time series of periodically observed campaign stations have limited data, making it difficult to separate or remove instantaneous non-tectonic movements from the time series, as performed with reference stations, to obtain a stable and reliable crustal movement velocity field. To address this issue, this paper proposes a method to improve the estimation of crustal movement velocity at campaign stations using the information of neighboring reference stations. This method constructs a Delaunay triangulation of reference stations and fits the periodic movement of each campaign station using an inverse distance weighted interpolation algorithm based on the reference station information. The crustal movement velocity of the campaign stations is then estimated after removing the periodic movement. This method was verified by its application to the estimation of the vertical motion rate at some reference and campaign stations in Yunnan Province. The results show that the accuracy of vertical motion rate estimation for virtual and real campaign stations improved by an average of 24.4% and 9.6%, respectively, demonstrating the effectiveness of the improved method, which can be applied to estimate crustal movement velocity at campaign stations in other areas. [ABSTRACT FROM AUTHOR]

It is difficult to balance detection speed and detection accuracy in current methods for sampling on feature maps. We combine the parameterless interpolation algorithm used in the traditional method with the algorithm in deep learning to improve shortcomings of the traditional interpolation algorithm by introducing learnable parameters into the algorithm. The new algorithm guarantees the features of the original image by calculating the correlation between feature map channels and pixels to ensure the correct restoration of the image features during up-sampling. In this paper, we propose a new up-sampling operation model — Reparametric Blend Up-sampling (RBU), which uses the method of rearranging pixels to obtain a feature map that matches the up-sampling size, uses blending to compute inter-pixel and inter-channel correlations and back-propagates the model to learn the appropriate parameters to ensure feature extraction. In the field of object detection, this model replaces the original up-sampling operation and improves the mAP mean value by 1.1% and the detection of small target objects by 3.1% in the VOC dataset with the richest application scenarios. [ABSTRACT FROM AUTHOR]

In seismic data processing, data recovery including reconstruction of the missing trace and removal of noise from the recorded data are the key steps in improving the signal-to-noise ratio (SNR). The reconstruction of seismic data and removal of noise becomes a sparse optimization problem that can be solved by using sparse regularization. Sparse regularization is a key tool in the solution of inverse problems. They are used to introduce prior knowledge and make the approximation of ill-posed inverses feasible. It deals with ill-posedness by replacing an ill-posed inverse problem with a well-posed problem that has a solution close to the true solution. In the last 2 decades, interest has shifted from linear toward nonlinear regularization methods even for linear inverse problems. In inverse problems, regularizations serve as stabilizing the solution of ill-posed inverse problems and give a solution that adequately fits measurements without producing unjustifiably complex artifacts. In this paper, we present a novel sparse regularization based on a tensor-based dictionary method for inverse problems (seismic data interpolation and denoising). This regularization avoids the vectorization step for sparse representation of seismic data during the reconstruction process. The key step in sparsifying signals is the choice of sparsity-promoting dictionary learning. The learning-based approach can adaptively sparsify datasets but has high computational complexity and involves no prior-constraint pattern information for the dataset. Many existing dictionary learning methods would be computationally infeasible for the high dimensional seismic data processing. These methods also destroy the essential information as well as it reduces the discriminability and expressibility of the signal, since they deal with vectorization. In this paper, the orthogonal tensor dictionary learning that learns a dictionary from the input data by employing orthogonality and separability is proposed as sparse regularization for the inverse problems. The performance of the proposed method was validated in seismic data interpolation and denoising individually as well as simultaneously. Numerical examples of synthetic and real seismic datasets demonstrate the validity of the proposed method. The SNR of the recovered data confirms that the proposed method is the most effective method than K-singular value decomposition and orthogonal dictionary learning methods. [ABSTRACT FROM AUTHOR]

This paper proposes a B-spline trajectory algorithm to realize multi-axis trajectory interpolation and analyzes the operating accuracy in an embedded system. However, the existing trajectory generation method needs to use computer-aided manufacturing (CAM) software to convert the interpolating trajectory into G code and download the code into the computer numerical control (CNC) system for processing. In this paper, the method of third-degree B-spline interpolation is proposed to generate a curved surface trajectory, and the trajectory generated by this algorithm can be run directly into a CNC system. The precision analysis of the ISO parameter segmentation interpolation algorithm and the theory of constant velocity motion is also presented. The significance of this project is that it designs a complete set of embedded systems, including hardware circuit design and software logic design, and uses low-cost STM32 architecture to realize a B-spline constant-speed interpolation algorithm, which is verified on CNC polishing equipment. A simulation conducted with the MATLAB software and the B-spline curve interpolation experiments performed on a multi-axis polishing machine tool demonstrate the effectiveness and accuracy of the optimized third-degree B-spline algorithm. [ABSTRACT FROM AUTHOR]

The goal of this paper is to strengthen the supervision of fishing behavior in the East China Sea and effectively ensure the sustainable development of fishery resources. Based on AIS data, this paper analyzes three types of fishing boats (purse seine operation, gill net operation and trawl operation) and uses the cubic spline interpolation algorithm to optimize the ship trajectory and construct high-dimensional features. It proposes a new coding method for fishing boat trajectory sequences. This method uses the Geohash algorithm to divide the East China Sea into grids and generate corresponding numbers. Then, the ship trajectory is mapped to the grid, the fishing boat trajectory points are associated with the divided grid, and the ship trajectory ID is extracted from the corresponding grid. The extracted complete trajectory sequence passes through the CBOW (continuous bag of words) model, and the correlation of trajectory points is fully learned. Finally, the fishing boat trajectory is converted from coordinate sequence to trajectory vector, and the processed trajectory sequence is trained by the LightGBM algorithm. In order to obtain the optimal classification effect, the optimal superparameter combination is selected. We put forward a LightGBM algorithm based on the Bayesian optimization algorithm, and obtained the classification results of three kinds of fishing boats. The final result was evaluated using the F1_score. Experimental results show that the F1_score trained with the proposed trajectory vectorization method is the highest, with a training accuracy of 0.925. Compared to XgBoost and CatBoost, the F1_score increased by 1.8 % and 1.2 % , respectively. The results show that this algorithm demonstrates strong applicability and effectiveness in fishery area evaluations and is significant for strengthening fishery resource management. [ABSTRACT FROM AUTHOR]

The aim of this paper is to solve the problem of a large amount of redundant data in the process of large-scale acquisition of Internet of Things sensors. This paper proposes a frequency adaptive data sensing method based on revolving gate algorithm for STM32 power safety data acquisition system. The method realizes the intelligent control of current protection terminal through three-stage current protection algorithm and frequency adaptive data acquisition algorithm. First, the three-stage current protection algorithm is used to protect the circuit, which can trip quickly in case of overload, and reduce the peak current caused by some equipment when starting up, so as to avoid damage to the equipment. Second, the arithmetic mean of each statistic is compared with the last value reported to the server. If the absolute value of the difference between the two exceeds the specified threshold range, the reported value is updated. Otherwise, it is filtered out, and the data smoothness is calculated according to the rules. The data collection interval is dynamically adjusted according to the data smoothness, which can greatly reduce the collection of redundant data and the traffic consumption of Internet of Things devices. On the server side, the inverse algorithm is used for interpolation and reconstruction to recover the collected data. This method is applied to the developed electricity safety equipment, and the electricity consumption is monitored and collected continuously for 24 h. After filtering by the frequency adaptive algorithm, only 108 pieces of data records are reported for 28,713 pieces of original data, and the compression ratio reaches 99.49 %. Compared with other data collection strategies, this method significantly reduces the amount of redundant data collection and the energy consumption of terminal nodes. Furthermore, this method realizes the real-time perception of line data and environmental data through current, residual current, temperature sensor and electric energy metering chip, and controls the opening and closing of wire controlled micro circuit breaker through PC817 optocoupler to protect the safety of the circuit. [ABSTRACT FROM AUTHOR]

In this paper, the most common pepper noise in grayscale image noise is investigated in depth in the median filtering algorithm, and the improved median filtering algorithm, adaptive switching median filtering algorithm, and adaptive polar median filtering algorithm are applied to the OTSU algorithm. Two improved OTSU algorithms such as the adaptive switched median filter-based OTSU algorithm and the polar adaptive median filter-based OTSU algorithm are obtained. The experimental results show that the algorithm can better cope with grayscale images contaminated by pretzel noise, and the segmented grayscale images are not only clear but also can better retain the detailed features of grayscale images. A genetic algorithm is a kind of search algorithm with high adaptive, fast operation speed, and good global space finding ability, and it will have a good effect when applied to the threshold finding of the OTSU algorithm. However, the traditional genetic algorithm will fall into the local optimal solution in different degrees when finding the optimal threshold. The advantages of the two interpolation methods proposed in this paper are that one is the edge grayscale image interpolation algorithm using OTSU threshold adaptive segmentation and the other is the edge grayscale image interpolation algorithm using local adaptive threshold segmentation, which can accurately divide the grayscale image region according to the characteristics of different grayscale images and effectively improve the loss of grayscale image edge detail information and jagged blur caused by the classical interpolation algorithm. The visual effect of grayscale images is enhanced by selecting grayscale images from the standard grayscale image test set and interpolating them with bilinear interpolation, bucolic interpolation, NEDI interpolation, and FEOI interpolation for interpolation simulation validation. The subjective evaluation and objective evaluation, as well as the running time, are compared, respectively, showing that the method of this paper can effectively improve the quality of grayscale image interpolation. [ABSTRACT FROM AUTHOR]

When aimed at minimizing both the classification error and the number of selected features, feature selection can be treated as a bi-objective optimization problem suitable for solving with multi-objective evolutionary algorithms (MOEAs). However, traditional MOEAs may encounter difficulties due to discrete optimization environments and the curse of dimensionality in the feature space, especially for high-dimensional datasets. Therefore, in this paper an interpolation-based evolutionary algorithm (termed IPEA) is proposed for tackling bi-objective feature selection in classification, where an interpolation based initialization method is designed for covering a wide range of search space and exploring the adaptively detected regions of interest. In experiments, IPEA is been compared with four state-of-the-art MOEAs in terms of two widely-used performance metrics on a list of 20 public real-world classification datasets with the dimensionality ranging from low to high. The overall empirical results suggest that IPEA generally performs the best of all tested algorithms, with significantly better search abilities and much lower computational time cost. [ABSTRACT FROM AUTHOR]

Sample entropy embeds time series into m-dimensional spaces and estimates entropy based on the distances between points in these spaces. However, when samples can be considered as missing or invalid, defining distance in the embedding space becomes problematic. Preprocessing techniques, such as deletion or interpolation, can be employed as a solution, producing time series without missing or invalid values. While deletion ignores missing values, interpolation replaces them using approximations based on neighboring points. This paper proposes a novel approach for the computation of sample entropy when values are considered as missing or invalid. The proposed algorithm accommodates points in the m-dimensional space and handles them there. A theoretical and experimental comparison of the proposed algorithm with deletion and interpolation demonstrates several advantages over these other two approaches. Notably, the deviation of the expected sample entropy value for the proposed methodology consistently proves to be lowest one. [ABSTRACT FROM AUTHOR]

Unlike uniform linear arrays (ULAs), coprime arrays require fewer physical sensors yet provide higher degrees of freedom (DOF) and larger array apertures. However, due to the existence of "holes" in the differential co-array, the target detection performance deteriorates, especially in adaptive beamforming. To address these challenges, this paper proposes an efficient and robust adaptive beamforming algorithm leveraging coprime array interpolation. The algorithm eliminates unwanted signals and uses the Gauss–Legendre quadrature method to reconstruct an Interference-plus-Noise Covariance Matrix (INCM), thereby obtaining the beamforming coefficients. Unlike previous techniques, we utilize a virtual interpolated ULA to expand the aperture, enabling the acquisition of a high-dimensional covariance matrix. Additionally, a projection matrix is constructed to eliminate unwanted signals from the received data, greatly enhancing the accuracy of INCM reconstruction. To address the high computational complexity of integral operations used in most INCM reconstruction algorithms, we propose an approximation based on the Gauss–Legendre quadrature, which reduces the computational load while maintaining accuracy. This algorithm avoids the array aperture loss caused by using only the ULA segment in the difference co-array and improves the accuracy of INCM reconstruction. Simulation and experimental results show that the performance of the proposed algorithm is superior to the compared beamformers and is closer to the optimal beamformer in various scenarios. [ABSTRACT FROM AUTHOR]

This paper presents a Kriging interpolation method for constructing a database of atmospheric refractivity in Korea. To collect as much data as possible for the interpolation, meteorological data from 120 regions of Korea, including both land and sea areas, are examined. Then, the normalized atmospheric refractivity Nn is calculated for an altitude of 0 m, because the refractivity tends to vary depending on the altitude of the observation site. In addition, the optimal variogram model to obtain the spatial correlation required for the Kriging method is investigated. The estimation accuracy of the Kriging interpolation is compared with that of the inverse distance weighting (IDW) and the bi-linear methods. The average and maximum estimation errors when using the Kriging method are 0.24 and 1.32, respectively. The result demonstrates that the Kriging method is more suitable for the interpolation of atmospheric refractivity in Korea than the conventional methods. [ABSTRACT FROM AUTHOR]

The high-speed railway subgrade compaction quality is controlled by the compaction degree (K), with the maximum dry density (ρdmax) serving as a crucial indicator for its calculation. The current mechanisms and methods for determining the ρdmax still suffer from uncertainties, inefficiencies, and lack of intelligence. These deficiencies can lead to insufficient assessments for the high-speed railway subgrade compaction quality, further impacting the operational safety of high-speed railways. In this paper, a novel method for full-section assessment of high-speed railway subgrade compaction quality based on ML-interval prediction theory is proposed. Firstly, based on indoor vibration compaction tests, a method for determining the ρdmax based on the dynamic stiffness Krb turning point is proposed. Secondly, the Pso-OptimalML-Adaboost (POA) model for predicting ρdmax is determined based on three typical machine learning (ML) algorithms, which are back propagation neural network (BPNN), support vector regression (SVR), and random forest (RF). Thirdly, the interval prediction theory is introduced to quantify the uncertainty in ρdmax prediction. Finally, based on the Bootstrap-POA-ANN interval prediction model and spatial interpolation algorithms, the interval distribution of ρdmax across the full-section can be determined, and a model for full-section assessment of compaction quality is developed based on the compaction standard (95%). Moreover, the proposed method is applied to determine the optimal compaction thicknesses (H0), within the station subgrade test section in the southwest region. The results indicate that: (1) The PSO-BPNN-AdaBoost model performs better in the accuracy and error metrics, which is selected as the POA model for predicting ρdmax. (2) The Bootstrap-POA-ANN interval prediction model for ρdmax can construct clear and reliable prediction intervals. (3) The model for full-section assessment of compaction quality can provide the full-section distribution interval for K. Comparing the H0 of 50~60 cm and 60~70 cm, the compaction quality is better with the H0 of 40~50 cm. The research findings can provide effective techniques for assessing the compaction quality of high-speed railway subgrades. [ABSTRACT FROM AUTHOR]

Carbon satellites are an important observation tool for analyzing ground carbon emission. From the perspective of the Earth's scale, the spatiotemporal sparse characteristics of raw data observed from carbon satellite requires the accurate interpolation of data, and based on only this work, people predict future carbon emission trends and formulate appropriate management and conservation strategies. The existing research work has not fully considered the close correlation between data and seasons, as well as the characteristics accumulated over a long time scale. In this paper, firstly, by employing extreme random forests and auxiliary data, we reconstruct a daily average CO2 dataset at a resolution of 0.25°, and achieve a validated determination coefficient of 0.92. Secondly, introducing technologies such as Time Convolutional Networks (TCN), Channel Attention Mechanism (CAM), and Long Short-Term Memory networks (LSTM), we conduct atmospheric CO2 concentration interpolation and predictions. When conducting predictive analysis for the Yangtze River Delta region, we train the model by using quarterly data from 2016 to 2020; the correlation coefficient in summer is 0.94, and in winter it is 0.91. These experimental data indicate that compared to other algorithms, this algorithm has a significantly better performance. [ABSTRACT FROM AUTHOR]

The article presents a research which investigates the assimilation of Ozone Monitoring Instrument Nitrogen Dioxide (OMI-NO2) column concentrations into the limited-area chemical transport model, Danish Eulerian Hemispheric Model (DEHM, version 2007.0). It describes the utilization of observational data in estimating background error covariance matrix, B. A comparison of the concentration fields with the ground-based observation of NO2 concentration is discussed.

Due to developments in science and technology, the field of plant protection and the information industry have become increasingly integrated, which has resulted in the creation of plant protection information systems. Plant protection information systems have modernized how pest levels are monitored and improved overall control capabilities. They also provide data to support crop pest monitoring and early warnings and promote the sustainable development of plant protection networks, visualization, and digitization. However, cybercriminals use technologies such as code reuse and automation to generate malware variants, resulting in continuous attacks on plant protection information terminals. Therefore, effective identification of rapidly growing malware and its variants has become critical. Recent studies have shown that malware and its variants can be effectively identified and classified using convolutional neural networks (CNNs) to analyze the similarity between malware binary images. However, the malware images generated by such schemes have the problem of image size imbalance, which affects the accuracy of malware classification. In order to solve the above problems, this paper proposes a malware identification and classification scheme based on bicubic interpolation to improve the security of a plant protection information terminal system. We used the bicubic interpolation algorithm to reconstruct the generated malware images to solve the problem of image size imbalance. We used the Cycle-GAN model for data augmentation to balance the number of samples among malware families and build an efficient malware classification model based on CNNs to improve the malware identification and classification performance of the system. Experimental results show that the system can significantly improve malware classification efficiency. The accuracy of RGB and gray images generated by the Microsoft Malware Classification Challenge Dataset (BIG2015) can reach 99.76% and 99.62%, respectively. [ABSTRACT FROM AUTHOR]

Time series data are usually characterized by having missing values, high dimensionality, and large data volume. To solve the problem of high-dimensional time series with missing values, this paper proposes an attention-based sequence-to-sequence model to imputation missing values in time series (ASSM), which is a sequence-to-sequence model based on the combination of feature learning and data computation. The model consists of two parts, encoder and decoder. The encoder part is a BIGRU recurrent neural network and incorporates a self-attentive mechanism to make the model more capable of handling long-range time series; The decoder part is a GRU recurrent neural network and incorporates a cross-attentive mechanism into associate with the encoder part. The relationship weights between the generated sequences in the decoder part and the known sequences in the encoder part are calculated to achieve the purpose of focusing on the sequences with a high degree of correlation. In this paper, we conduct comparison experiments with four evaluation metrics and six models on four real datasets. The experimental results show that the model proposed in this paper outperforms the six comparative missing value interpolation algorithms. [ABSTRACT FROM AUTHOR]

With the development of artificial intelligence technology, machine learning-based production forecasting models can achieve the rapid prediction and analysis of production. However, these models need to be built on a large dataset, and having only a small amount of data may result in a decrease in prediction accuracy. Therefore, this paper proposes a transfer learning prediction method based on the hierarchical interpolation model. It uses data from over 2000 shale gas wells in 22 blocks of the Marcellus Shale formation in Pennsylvania to train the transfer learning model. The knowledge obtained from blocks with sufficient sample data is transferred and applied to adjacent blocks with limited sample data. Compared to classical production decline models and mainstream time-series prediction models, the proposed method can achieve an accurate production decline trend prediction in blocks with limited sample data, providing new ideas and methods for studying the declining production trends in shale gas. [ABSTRACT FROM AUTHOR]

Kinematic modeling is essential for planning and controlling continuum robot motion. The traditional Denavit Hartenberg (DH) model involves complex matrix multiplication operations, resulting in computationally intensive inverse solutions and trajectory planning. Solving position and orientation changes in continuum robots using the double quaternion rule can reduce computational complexity. However, existing dual quaternion methods are direct equational transformations of DH rules and do not give a complete modeling process. They usually require more interpretability when applying continuum robot kinematic modeling. This paper uses the dual quaternion method to establish a kinematic model of a continuum robot. It uses a two-section continuum robot model to compare the advantages of dual quaternion and traditional modeling methods. In addition, this paper proposes a five-polynomial interpolation algorithm based on the dual quaternion method for trajectory planning of continuum robots. This method accurately models spatial bending and torsional motions of singularity-free continuum robots. [ABSTRACT FROM AUTHOR]

This paper studies and analyzes the approximation of one-dimensional smooth closed-form functions with compact support using a mixed Fourier series (i.e., a combination of partial Fourier series and other forms of partial series). To explore the potential of this approach, we discuss and revise its application in signal processing, especially because it allows us to control the decreasing rate of Fourier coefficients and avoids the Gibbs phenomenon. Therefore, this method improves the signal processing performance in a wide range of scenarios, such as function approximation, interpolation, increased convergence with quasi-spectral accuracy using the time domain or the frequency domain, numerical integration, and solutions of inverse problems such as ordinary differential equations. Moreover, the paper provides comprehensive examples of one-dimensional problems to showcase the advantages of this approach. [ABSTRACT FROM AUTHOR]

Eucalyptus plantation forests in southern China provide not only the economic value of producing timber, but also the ecological value service of absorbing carbon dioxide and releasing oxygen. Based on the theory of spatial colonial modeling, this paper proposes a new method for 3D reconstruction of tree terrestrial LiDAR point clouds for determining the aboveground carbon stock of eucalyptus monocotyledons, which consists of the main steps of tree branch and trunk separation, skeleton extraction and optimization, 3D reconstruction, and carbon stock calculation. The main trunk and branches of the tree point clouds are separated using a layer-by-layer judgment and clustering method, which avoids errors in judgment caused by sagging branches. By optimizing and adjusting the skeleton to remove small redundant branches, the near-parallel branches belonging to the same tree branch are fused. The missing parts of the skeleton point clouds were complemented using the cardinal curve interpolation algorithm, and finally a real 3D structural model was generated based on the complemented and smoothed tree skeleton expansion. The bidirectional Hausdoff distance, average Hausdoff distance, and F distance were used as evaluation indexes, which were reduced by 0.7453 m, 0.0028 m, and 0.0011 m, respectively, and the improved spatial colonization algorithm enhanced the accuracy of the reconstructed tree 3D structural model. To verify the accuracy of our method to determine the carbon stock and its related parameters, we cut down 41 eucalyptus trees and destructively sampled the measurement data as reference values. The R2 of the linear fit between the reconstructed single-tree aboveground carbon stock estimates and the reference values was 0.96 with a CV(RMSE) of 16.23%, the R2 of the linear fit between the trunk volume estimates and the reference values was 0.94 with a CV(RMSE) of 19.00%, and the R2 of the linear fit between the branch volume estimates and the reference values was 0.95 with a CV(RMSE) of 38.84%. In this paper, a new method for reconstructing eucalyptus carbon stocks based on TLS point clouds is proposed, which can provide decision support for forest management and administration, forest carbon sink trading, and emission reduction policy formulation. [ABSTRACT FROM AUTHOR]

The lack of high-resolution training sets for intelligent landslide recognition using high-resolution remote sensing images is a major challenge. To address this issue, this paper proposes a method for reconstructing low-resolution landslide remote sensing images based on a Super-Resolution Generative Adversarial Network (SRGAN) to fully utilize low-resolution images in the process of constructing high-resolution landslide training sets. First, this paper introduces a novel Enhanced Depth Residual Block called EDCA, which delivers stable performance compared to other models while only slightly increasing model parameters. Secondly, it incorporates coordinated attention and redesigns the feature extraction module of the network, thus boosting the learning ability of image features and the expression of high-frequency information. Finally, a residual stacking-based landslide remote sensing image reconstruction strategy was proposed using EDCA residual blocks. This strategy employs residual learning to enhance the reconstruction performance of landslide images and introduces LPIPS for evaluating the test images. The experiment was conducted using landslide data collected by drones in the field. The results show that compared with traditional interpolation algorithms and classic deep learning reconstruction algorithms, this approach performs better in terms of SSIM, PSNR, and LPIPS. Moreover, the network can effectively handle complex features in landslide scenes, which is beneficial for subsequent target recognition and disaster monitoring. [ABSTRACT FROM AUTHOR]

Introduction: The detection of smoking behavior is an emerging field faced with challenges in identifying small, frequently occluded objects like cigarette butts using existing deep learning technologies. Such challenges have led to unsatisfactory detection accuracy and poor model robustness. Methods: To overcome these issues, this paper introduces a novel smoking detection algorithm, YOLOv8-MNC, which builds on the YOLOv8 network and includes a specialized layer for small target detection. The YOLOv8-MNC algorithm employs three key strategies: (1) It utilizes NWD Loss to mitigate the effects of minor deviations in object positions on IoU, thereby enhancing training accuracy; (2) It incorporates the Multi-head Self-Attention Mechanism (MHSA) to bolster the network's global feature learning capacity; and (3) It implements the lightweight general up-sampling operator CARAFE, in place of conventional nearest-neighbor interpolation up-sampling modules, minimizing feature information loss during the up-sampling process. Results: Experimental results from a customized smoking behavior dataset demonstrate significant improvement in detection accuracy. The YOLOv8-MNC model achieved a detection accuracy of 85.887%, signifying a remarkable increase of 5.7% in the mean Average Precision (mAP@0.5) when compared to the previous algorithm. Discussion: The YOLOv8-MNC algorithm represents a valuable step forward in resolving existing problems in smoking behavior detection. Its enhanced performance in both detection accuracy and robustness indicates potential applicability in related fields, thus illustrating a meaningful advancement in the sphere of smoking behavior detection. Future efforts will focus on refining this technique and exploring its application in broader contexts. [ABSTRACT FROM AUTHOR]

When studying river hydrodynamics and water quality evolution laws on the basis of numerical simulation analysis, it is necessary to carry out topographic interpolation along the bend direction of the river on the basis of the measured river section, as this can provide accurate and reliable topographic data for river numerical modeling. In this paper, a two-step terrain simulation method based on sparse and discrete river sections is proposed by comprehensively considering the river trends and the lack of monitoring sections. On the basis of establishing a reference using the river centerline and coding the spatial relationship of the river, the linear weight method, which uses the distance and gradient change between the known sampling elevation section to realize the preliminary encryption of spatial points with any number of longitudinal sections and any horizontal distance, is carried out first. Considering the structural and anisotropic characteristics of the river, the improved inverse distance weighting (IDW) method is further used to locally interpolate the encrypted points to obtain the continuous surface of the river terrain. In order to prove the effectiveness of this method, a part of the Qinhuai River in Nanjing was taken as the research object. The experiment was carried out by setting different spacing distances for preliminary densification and by using different interpolation methods for further local terrain simulation. Root mean square error (RMSE) and mean absolute error (MAE) are used to evaluate the overall performance of different simulation methods. The experimental results show that the method proposed in this paper overcomes the obvious inaccuracy of directly using an interpolation algorithm to generate the river terrain due to sparse section data. The river terrain generated by the preliminary densification and improved IDW interpolation calculation method is more reasonable, and continuous and unobstructed, reflecting the original river terrain more accurately. [ABSTRACT FROM AUTHOR]

Power line inspection is an important means to eliminate hidden dangers of power lines. It is a difficult research problem how to solve the low accuracy of power line inspection based on deep neural network (DNN) due to the problems of multi‐view‐shape, small‐size object. In this paper, an automatic detection model based on Feature visual clustering network (FVCNet) for power line inspection is established. First, an unsupervised clustering method for power line inspection is proposed, and applied to construct a detection model which can recognize multi‐view‐shape objects and enhanced object features. Then, the bilinear interpolation method is used to Feature enhancement method, and the enhanced high‐level semantics and low‐level semantics are fused to solve the problems of small object size and single sample. In this paper, FVCNet is applied to the MS‐COCO 2017 data set and self‐made power line inspection data set, and the test accuracy is increased to 61.2% and 82.0%, respectively. Compared with other models, especially for the categories that are greatly affected by multi‐view‐shape, the test accuracy has been improved significantly. [ABSTRACT FROM AUTHOR]

Due to the continuous increase in the volume of spatially located information, the current requirements imposed on the Spatial Information System (SIS) concern increasing data mining capabilities. Modern measurement systems, based on devices which enable the automatic recording of observation results on a mass scale (LiDAR—Light Detection and Ranging, MBES—Multi Beam Echo Sounder, etc.), allow for a very large volume of information on the surface to be measured and acquired in a relatively short time. One of the methods to reduce the volume of data enabling the generation of a model surface is to convert unevenly distributed measurement points into a regular network of squares (GRID). However, the generation of a complete grid is not always possible. In the measurement spectrum, there may be areas where measurement points have not been recorded. Measurement points can also be eliminated by either filtering the erroneously recorded data or eliminating the measured vegetation or the utilities in the area. To address these problems, the current article proposes a method for complementing the missing internal nodes in a regular network of squares using polynomial interpolation algorithms. Moreover, the paper demonstrates the possibilities of using the presented method for adding additional points between the already existing nodes of the network of squares. The application of the methodology presented in this article enables the effective elimination of (or a reduction in) the gaps in the GRID structure, which, in turn, allows such a network of squares to be used to generate a more accurate Digital Terrain Model. [ABSTRACT FROM AUTHOR]

Dynamic load localization and identification technology is very important in the structural design and optimization of aircraft. This paper proposes a non-global traversal method (NTM) for the fast positioning and recognition of dynamic loads on continuous beams. This method separates the load's position and amplitude information in the modal space. Then, it constructs an interpolation function about position information, and converts load positioning to solving the zero point of the interpolation function. After determining the position of the dynamic load, the amplitude of the dynamic load is recognized. This method does not need to traverse all the position points globally, thereby greatly improving the efficiency of load positioning. Numerical simulations and experiments show that compared with the original variable separation fast positioning method (VSRPM), this method improves the calculation efficiency by more than 80% while maintaining the same recognition accuracy. NTM is a new method of great application value. [ABSTRACT FROM AUTHOR]

The goal of the present study is to find a method for improving the predictive capabilities of feedforward neural networks in cases where values distant from the input–output sample interval are predicted. This paper proposes an iterative prediction algorithm based on two assumptions. One is that predictions near the statistical sample have much lower error than those distant from the sample. The second is that a neural network can generate additional training samples and use them to train itself in order to get closer to a distant prediction point. This paper presents the results of multiple experiments with different univariate and multivariate functions and compares the predictions made by neural networks before and after their training with the proposed iterative algorithm. The results show that, having passed through the stages of the algorithm, artificial neural networks significantly improve their interpolation performance in long-term forecasting. The present study demonstrates that neural networks are capable of creating additional samples for their own training, thus increasing their approximating efficiency. [ABSTRACT FROM AUTHOR]

In view of the mutual restriction between the image encryption and information hiding process in the ciphertext domain reversible algorithm, the existing ciphertext domain image reversible image steganography algorithm can hardly take into account the performance of security and hiding capacity. This paper proposes a reversible image steganography algorithm for encrypted images based on a new interpolation image and difference histogram shift. The pixel position of the carrier image is changed through the double scrambling operation of random image block recombination and Arnold transform. The chaotic sequence generated by logistic mapping is used as the diffusion sequence of the encryption algorithm, and DNA encoding and calculation are performed respectively to obtain the final encrypted image. According to the newly proposed interpolation algorithm, the encrypted image is enlarged, determine the pixel value of the target interpolated image according to the pixel value of the encrypted image, calculate the difference between the three adjacent pixel values of the target interpolated image, and use the difference histogram translation algorithm to convert the secret Information is embedded in an interpolated image, and only one bit of the pixel value can be modified in a single embedding process, and the embedding method is simple and effective. Experimental results show that under the premise of ensuring information security and image quality, the embedding capacity has also been greatly improved, reaching 1,572,864 bits. When the embedding rate is 0.67 bpp, the PSNR can also reach 58 dB and the image quality is maintained better. [ABSTRACT FROM AUTHOR]

This study presents a path planning algorithm based on immune ant colony B spline interpolation to eliminate path duplication and corner inflection points, increase the smoothness of the agricultural robot's path trajectory, and enhance the path planning performance. Firstly, this study improves the convergence speed of the algorithm by introducing an adaptive factor that obeys the normal distribution to optimize the path heuristic function. Secondly, to strengthen the variety of the target path search, an immune algorithm was utilized to perform a global investigation of the appropriate routes and assign the initial pheromones of the ant colony. Then, the adaptive judgment factor is introduced based on the incentive degree function and the pheromone evaporation coefficient, and the update formula are adjusted to promote the algorithm's flexibility while suppressing the optimal regional problem. Finally, the pathways are processed using a cubic B spline interpolation method to remove the edges and minimize the peak inflection points. To verify the specific optimization performance of the algorithm in this paper, we have selected the same type of improved algorithm as a comparison and tested it in a raster map model. The simulation results demonstrate that the values of the proposed algorithm paths and the standard deviation of the tracks are smaller than the comparison algorithm, which indicates the higher performance of the algorithm in searching the optimal routes and more flexible and accurate search. Compared with the comparison algorithm, the average time-consuming reduction rate of the algorithm in this paper is between 38% and 45% in different grid maps, and the number of turns is reduced by 33% to 58%. It meets the requirements of the actual work on the robot. [ABSTRACT FROM AUTHOR]

The design optimization of mechanisms is promising as it results in more energy-efficient machines without compromising performance. However, machine builders do not apply state-of-the-art methods, as these algorithms require case-specific theoretical analysis. Moreover, the design synthesis approaches in the literature predominantly utilize heuristic optimizers, leading to suboptimal local minima. This paper introduces a widely applicable workflow, guaranteeing the global optimum. The constraints describing the feasible region of the possible designs are essential to find the global optimum. Therefore, kinematic analysis of the point-to-point planar four-bar mechanism is discussed. Within the feasible design space, objective value samples were generated through the CAD multi-body software. These motion simulations determine the required torque to fulfill the movement for a combination of design parameters. This replaces the cumbersome analytic derivation of the torque. This paper introduces sparse interpolation techniques to avoid brute force sampling of the design space. The advantage of this approach is that it is easily scalable to more design parameters, as the interpolation method minimizes the number of necessary samples. This paper explains the mathematical background of our developed interpolation approach. However, a step-by-step procedure is introduced to allow the employment of the interpolation technique by machine designers without the necessity to understand the underlying mathematics. Finally, the mathematical expression, obtained from the interpolation, enables applying global optimizers. In a case study of an emergency ventilator mechanism with three design parameters, 1870 CAD motion simulations allowed reducing the RMS torque of the mechanism by 67%. [ABSTRACT FROM AUTHOR]

An algorithm to improve the resolution of the frequency spectrum by detecting the number of complete cycles, removing any fractional components of the signal, signal discontinuities, and interpolating the signal for fault diagnostics of electrical machines using low-power data acquisition cards is proposed in this paper. Smart sensor-based low-power data acquisition and processing devices such as Arduino cards are becoming common due to the growing trend of the Internet of Things (IoT), cloud computation, and other Industry 4.0 standards. For predictive maintenance, the fault representing frequencies at the incipient stage are very difficult to detect due to their small amplitude and the leakage of powerful frequency components into other parts of the spectrum. For this purpose, offline advanced signal processing techniques are used that cannot be performed in small signal processing devices due to the required computational time, complexity, and memory. Hence, in this paper, an algorithm is proposed that can improve the spectrum resolution without complex advanced signal processing techniques and is suitable for low-power signal processing devices. The results both from the simulation and practical environment are presented. [ABSTRACT FROM AUTHOR]

Ground-based multiple-input multiple-output synthetic aperture radar (MIMO-SAR) is a new type of deformation monitoring sensor that has the advantages of no mechanical motion and fast echo acquisition. Ground-based MIMO-SAR can significantly improve the data rate of deformation monitoring. In this paper, a fast imaging algorithm tailored for ground-based MIMO-SAR data is proposed, which can be applied in both far-field and near-field scenarios. First, the phase center approximation error of the non-collinear array in the near field is analyzed. Then, a fast imaging algorithm based on geometric transformation for the coherent synthesis of subimages is put forward. The algorithm uses the geometric transformation to convert the subaperture imaging results into the full aperture coordinate system, which avoids the point-by-point interpolation calculation and further reduces the computational cost of the subimage coherent synthesis algorithm. Simulations and experiments show that the algorithm can achieve high-precision focusing imaging, and its operation efficiency is significantly improved compared with the algorithm based on interpolation. [ABSTRACT FROM AUTHOR]

The upcoming Nancy Grace Roman Space Telescope will carry out a wide-area survey in the near-infrared. A key science objective is the measurement of cosmic structure via weak gravitational lensing. Roman data will be undersampled, which introduces new challenges in the measurement of source galaxy shapes; a potential solution is to use linear algebra-based coaddition techniques such as imcom that combine multiple undersampled images to produce a single oversampled output mosaic with a desired 'target' point spread function (PSF). We present here an initial application of imcom to 0.64 square degrees of simulated Roman data, based on the Roman branch of the Legacy Survey of Space and Time (LSST) Dark Energy Science Collaboration (DESC) Data Challenge 2 (DC2) simulation. We show that imcom runs successfully on simulated data that includes features such as plate scale distortions, chip gaps, detector defects, and cosmic ray masks. We simultaneously propagate grids of injected sources and simulated noise fields as well as the full simulation. We quantify the residual deviations of the PSF from the target (the 'leakage'), as well as noise properties of the output images; we discuss how the overall tiling pattern as well as Moiré patterns appear in the final leakage and noise maps. We include appendices on interpolation algorithms and the interaction of undersampling with image processing operations that may be of broader applicability. The companion paper ('Paper II') explores the implications for weak lensing analyses. [ABSTRACT FROM AUTHOR]

An effective near-field to far-field transformation using a reduced number of near-field measurements collected via a spherical scan over the upper hemisphere, due to the presence of a flat metallic ground, is devised in this paper. Such a transformation relies on the non-redundant sampling representations of electromagnetic fields and exploits the image principle to properly account for the metallic ground, supposed to be of infinite extent and realised by perfectly conducting material. The sampling representation of the probe voltage over the upper hemisphere is developed by modelling the antenna under test and its image by a very adaptable convex surface, which is able to fit as much as possible the geometry of any kind of antenna, thus minimising the volumetric redundancy and, accordingly, the number of required samples as well as the measurement time. Then, the use of a two-dimensional optimal sampling interpolation algorithm allows the reconstruction of the voltage value at each sampling point of the spherical grid required by the classical near-field-to-far-field transformation developed by Hansen. Numerical examples proving the effectiveness of the developed sampling representation and related near-field-to-far-field transformation techniques are reported. [ABSTRACT FROM AUTHOR]

This paper proposes a feature selection method based on a hybrid optimization algorithm that combines the Golden Jackal Optimization (GJO) and Grey Wolf Optimizer (GWO). The primary objective of this method is to create an effective data dimensionality reduction technique for eliminating redundant, irrelevant, and noisy features within high-dimensional datasets. Drawing inspiration from the Chinese idiom "Chai Lang Hu Bao," hybrid algorithm mechanisms, and cooperative behaviors observed in natural animal populations, we amalgamate the GWO algorithm, the Lagrange interpolation method, and the GJO algorithm to propose the multi-strategy fusion GJO-GWO algorithm. In Case 1, the GJO-GWO algorithm addressed eight complex benchmark functions. In Case 2, GJO-GWO was utilized to tackle ten feature selection problems. Experimental results consistently demonstrate that under identical experimental conditions, whether solving complex benchmark functions or addressing feature selection problems, GJO-GWO exhibits smaller means, lower standard deviations, higher classification accuracy, and reduced execution times. These findings affirm the superior optimization performance, classification accuracy, and stability of the GJO-GWO algorithm. [ABSTRACT FROM AUTHOR]

Topographic variables derived from digital elevation models (DEM) are the most commonly used predictor in soil organic carbon (SOC) prediction. The predictability of these variates for the spatial heterogenity of SOC is influenced by the size of DEM resolution. This paper aimed to investigate the resolution effect of the topography at multiple DEM resolutions and select the most important predictors and the optimal resolution for SOC prediction in a large-scale and morphologically complex area. The study area, covering 15 600 km2, was located in a mountainous province in China. A total of 3901 soil samples and three machine learning algorithms including random forest, gradient boosted regression tree, and artificial neural network were used to construct the SOC predictive models at resolutions of 30, 90, 150, 210, 270, 330, and 390 m. Topographic factors were derived from the DEM with an original resolution of 30 m and were subsequently resampled to varying resolutions by using the bilinear interpolation algorithm. The importance of each variate in each predictive model was computed for the most important predictor selection, and the determination coefficient (R2) and Root Mean Square Error (RMSE) of each predictive model were computed for the accuracy evaluation. Comparative analysis on point-based topographic representation, the accuracy of predictive models, and the variable importance was conducted among different resolutions to investigate the resolution effect on the SOC prediction and to select the optimal resolution for this study area. The results showed that topography was the key factor influencing the SOC distribution in this large-scale area due to the region's mountainous nature, and the relative contribution of the topography to predict SOC distribution varied with DEM resolutions. Elevation was the most important topographic factor at all DEM resolutions. Accuracies of predictive models built on the three machine learning algorithms were all dependent on DEM resolution, indicating that DEM resolution had an important effect on SOC prediction. Overall, the random forest predictive models outperformed the other two algorithms, and its most accurate result was obtained at the 210-m resolution with an R2 of 0.25 and an RMSE of 4.77 g kg–1. In conclusion, we found that finer resolutions did not necessarily produce more accurate SOC predictions even in a large-scale and morphologically complex area. Therefore, investigating the resolution effect is suggested to select an optimal resolution for the SOC prediction in other regions characterized by similar geomorphological conditions as this study area. [ABSTRACT FROM AUTHOR]

In this paper, we propose a measurement method of micro-optical elements with parallel phase-shifting digital holographic phase imaging. This method can record four phase-shifting holograms with a phase difference of π/2 in a single shot and correct the pixel mismatch error of the polarization camera using a bilinear interpolation algorithm, thereby producing high-resolution four-step phase-shifting holograms. This method reconstructs the real phase information of the object to be measured through a four-step phase-shifting algorithm. The reproduced image eliminates the interference of zero-order images and conjugate images, overcoming the problem that traditional phase-shifting digital holography cannot be measured in real time. A simulation analysis showed that the relative error of this measurement method could reach 0.0051%. The accurate surface topography information of the object was reconstructed from an experimental measurement through a microlens array. Multiple measurements yielded a mean absolute error and a mean relative error for the vertical height of the microlens array down to 5.9500 nm and 0.0461%, respectively. [ABSTRACT FROM AUTHOR]

The gnomonic cubed‐sphere grid has excellent accuracy and uniformity, but the "kink" in the coordinates at the cube edges in the halo region can leave an imprint of the cube in the solution, and requires special edge handling. To reduce grid imprinting, we implement the novel "Duo‐Grid" within the Geophysical Fluid Dynamics Laboratory's (GFDL) Finite‐Volume Cubed‐Sphere Dynamical Core (FV3). The Duo‐Grid remaps a cube face's data from neighboring face from kinked to natural locations along great circle lines using 1D piecewise linear interpolation. A 2D interpolation algorithm is used to fill correct data at the eight corners of the cubed‐sphere needed for FV3's 2D advection scheme. The Duo‐Grid was tested in idealized tests using the 2D shallow water solver and the 3D hydrostatic and non‐hydrostatic solvers. We found that error norms are greatly reduced and grid imprinting is practically eliminated when employing the Duo‐Grid. These results indicate that FV3's accuracy and robustness have improved. Plain Language Summary: In Computational Fluid Dynamics (CFD), numerical solutions should ideally be grid‐independent, so that grid choice should have no noticeable effects on flow behavior. However, designing complex CFD codes in general and atmospheric dynamical cores in particular necessitates a series of design decisions that balance the code numerical efficiency and accuracy. In GFDL's dynamical core FV3, unphysical structures from the gnomonic cubed‐sphere grid structure, such as edges and corners, can appear in the numerical solution especially at lower resolutions and in long climate simulations. This is known as grid imprinting which is due to errors in the assumed location of grid cells on opposing sides of a cube edge. While this assumption is computationally inexpensive, it creates a grid imprinting problem especially for low resolution simulations. In this paper, we implement a new algorithm called Duo‐Grid that corrects the location of the cross‐edge data, and eliminates grid imprinting in FV3. The increase in accuracy comes at the expense of additional computational complexity. Key Points: A new cubed‐sphere grid structure, the "Duo‐Grid," is implemented in the Geophysical Fluid Dynamics Laboratory's Dynamical Core (FV3)The Duo‐Grid remaps data along cube edges and synchronizes fluxes to rectify the "kink" in the coordinatesGrid imprinting of the cubed sphere is greatly reduced in idealized tests and FV3's accuracy and robustness have improved [ABSTRACT FROM AUTHOR]

In CNC machining, G01 codes are widely used to represent the tool path. Directly interpolating these G01 codes is time-consuming and may cause discontinuities. In this paper, we propose a time-spline curve fitting method that combines tool path fitting and feedrate scheduling into a single step for five-axis CNC machining. The input for this method consists of a three-dimensional linear path of the tool tip in the workpiece coordinate system and two-dimensional tool orientations in the machine coordinate system (MCS). The output is a fitted tool path in the MCS represented by a five-dimensional smooth time-parametric B-spline curve, simply referred to as the time-spline curve. The time-spline curve provides not only position information but also kinematic information, including velocity, acceleration, and jerk for each axis, directly derived from the first, second, and third derivatives of the curve. To meet fitting error constraints and axial kinematic constraints, our objective is to find the time-spline curve that is time-optimal. We formulate the optimization problem as a nonlinear optimization model and design a recursive algorithm to solve it. The resulting time-spline curve demonstrates high accuracy and fully utilizes the machine's kinematic capabilities. Along the tool path defined by the time-spline curve, exact interpolation points can be straightforwardly obtained according to the interpolation period. Simulations and experimental results indicate that the proposed method yields a time-optimal time-spline curve with the desired precision and kinematic constraints. [ABSTRACT FROM AUTHOR]

Images play an important role in transmitting visual information in our life. It could lead to severe consequences if images are manipulated or tampered maliciously. Digital forensics is an important research area to secure multimedia information. Many forensics technologies are applied to protect our community from the abuse of digital information. In many cases, after tampering, attackers could apply operations such as resampling, JPEG compression, blurring, etc. to cover the traces of tampering. Therefore, it is necessary to detect these manipulations in image forensics before exposing forgeries. In this paper, we propose to employ the prediction error filters, ConvNeXt blocks and convolution modules to classify images with different compression quality factors and resampling rates. By tracing the inconsistencies of resampling rates and compression quality factors, it could provide supplementary information for forensics researchers to expose possible forgeries. The proposed method could achieve great classification performance regardless of the interpolation algorithms. Also, it is highly robust against JPEG compression. In addition, the proposed method can be applied for estimating quality factors of JPEG compression. [ABSTRACT FROM AUTHOR]

The mud receiving area is an important sand storage area for dredging sea sand reclamation and sand-dumping in the waterway. The sediment accumulation area generated in the process of sand dumping and sand storage has an impact on the surrounding transportation facilities and the normal use of the entire sand storage area. From 6 August 2021 to 9 May 2022, The Sentinel-1A 24-view SLC data covering the sludge area were used to monitor the safety around the seawall road by InSAR technology. Synthetic aperture radar differential interferometry (Differential InSAR, D-InSAR) technology can obtain surface micro deformation information through single-time differential interference processing, mainly used for sudden surface deformation. D-InSAR technology detected five accumulation areas with a thickness of more than 10 cm near the seawall road, earth embankment, and cofferdam, and TS-InSAR (Time series InSAR) technology was used to retrieve the deformation of the surrounding road. The road settlement is a slight settlement distributed between ±5 mm/a. This paper uses the leveling results combined with variance analysis to verify the fusion of different TS-InSAR methods while considering the area of data loss due to causes such as loss of coherence. This paper also considers the common ground continuity and uses the adjacent interpolation and bilinear interpolation algorithm to improve knowledge of the study area seawall road and the surrounding soil embankment deformation data of the road. Compared with the leveling data, the difference between the missing data and the leveling data after interpolation is stable at about 1–7 mm, which increases the risk level of part of the road which needs to be maintained. It provides a reference method to make up for the missing data caused by ground incoherence. [ABSTRACT FROM AUTHOR]