Explore the vast range of titles available.

The vehicle detection method plays an important role in the driver assistance system. Therefore, it is very important to improve the real-time performance of the detection algorithm. Nowadays, the most popular method is the scanning method based on sliding window search, which detects the vehicle from the image to be detected. However, the existing sliding window detection algorithm has many drawbacks, such as large calculation amount and poor real-time performance, and it is impossible to detect the target vehicle in real time during the motion process. Therefore, this paper proposes an improved hierarchical sliding window detection algorithm to detect moving vehicles in real time. By extracting the region of interest, the region of interest is layered, the maximum and minimum values of the detection window in each layer are set, the flashing frame generated by the layering is eliminated by the delay processing method, and a method suitable for the motion is obtained: the real-time detection algorithm of the vehicle, that is, the hierarchical sliding window detection algorithm. The experiments show that the more layers are divided, the more time is needed, and when the number of detection layers is greater than 7, the time change rate increases significantly. As the number of layers decreases, the detection accuracy rate also decreases, resulting in the phenomenon of a false positive. Therefore, it is determined to meet the requirements of real time and accuracy when the image is divided into 7 layers. It can be seen from the experiment that when the images to be detected are divided into 7 layers and the maximum and minimum values of detection windows are 30 × 30 and 250 × 250, respectively, the number of sub-windows generated is one thirty-seventh of the original sliding window detection algorithm, and the execution time is only one-third of the original sliding window detection algorithm. This shows that the hierarchical sliding window detection algorithm has better real-time performance than the original sliding window detection algorithm.

Reanalysis products have been applied to calculate the tropospheric delay for Global Navigation Satellite System (GNSS) positioning purposes widely. It is necessary to obtain high-precision tropospheric delay information from GNSS users with a high-precision tropospheric vertical stratification model because the height of the grids of the atmospheric reanalysis data is inconsistent with that of GNSS users, especially in regions with high terrains. In addition, the variation of the tropospheric delay in the vertical direction is much higher than that in the horizontal direction. The zenith total delay (ZTD) vertical stratification model is also key to the development of real-time and high-precision ZTD models. A new approach, the sliding window algorithm, is proposed to develop a ZTD vertical stratification model. In this work, a ZTD vertical stratification model considering spatiotemporal factors is developed based on the second Modern-Era Retrospective analysis for Research and Applications (MERRA-2) data, which is named the GZTD-H model. Radiosonde and International GNSS Service (IGS) data are treated as reference values to evaluate the performance of the GZTD-H model, which is compared to the model GPT2w. The results show that the GZTD-H model realizes the highest performance in ZTD layered vertical interpolation against ZTD layered profiles obtained at radiosonde sites, which achieves an improvement of 10% over the model GPT2w. Compared to model GPT2w, the GZTD-H model attains a spatial interpolation improvement of 8% for the Global Geodetic Observing System (GGOS) Atmosphere gridded ZTD over the surface ZTD calculated from radiosonde profiles. Furthermore, compared to model GPT2w, the model GZTD-H also attains improvements of 11% over the precise ZTD products acquired at IGS sites. In terms of model parameters, the GZTD-H model is greatly reduced and optimized over model GPT2w. Hence, the applicability of this model is enhanced in terms of GNSS atmospheric sounding and precise GNSS positioning.

Large volumes of automatic identification system (AIS) data provide new ideas and methods for ship data mining and navigation behavior pattern analysis. However, large volumes of big data have low unit values, resulting in the need for large-scale computing, storage, and display. Learning efficiency is low and learning direction is blind and untargeted. Therefore, key feature point (KFP) extraction from the ship trajectory plays an important role in fields such as ship navigation behavior analysis and big data mining. In this paper, we propose a ship spatiotemporal KFP online extraction algorithm that is applied to AIS trajectory data. The sliding window algorithm is modified for application to ship navigation angle deviation, position deviation, and the spatiotemporal characteristics of AIS data. Next, in order to facilitate the subsequent use of the algorithm, a recommended threshold range for the corresponding two parameters is discussed. Finally, the performance of the proposed method is compared with that of the Douglas–Peucker (DP) algorithm to assess its feature extraction accuracy and operational efficiency. The results show that the proposed improved sliding window algorithm can be applied to rapidly and easily extract the KFPs from AIS trajectory data. This ability provides significant benefits for ship traffic flow and navigational behavior learning.

Accurate modeling of zenith tropospheric delay (ZTD) is beneficial for high-precision navigation and positioning. Many models with good performance have been developed for calibrating ZTD, such as the GPT3 model, which is recognized as an excellent global model and is widely used. However, certain limitations still remain in current models, such as the adoption of only single gridded data for modeling, and the model parameters need to be further optimized. In our previous research, a new approach based on the sliding window algorithm was proposed and applied to develop the GZTD-H model to address some of these limitations. However, this model is only suitable for the vertical adjustment of ZTD, not for estimating ZTD directly. In this study, an improved global grid ZTD model considering height scale factor (GGZTD-H) is derived from the initial GZTD-H model for estimating ZTD. The RMSs of the GGZTD-H model are 4.11 cm and 3.29 cm as validated by radiosonde data and IGS data, respectively. Compared with the UNB3m model and the canonical GPT3 model, the new model exhibits better performance. Moreover, three resolutions of the GGZTD-H model have been developed to reduce the quantity of gridded data delivered to users and optimize the ZTD computation process. Compared with the GPT3 model, the GGZTD-H model shows better performance with lower resolution and requires fewer model parameters for ZTD estimation, greatly optimizing ZTD computation. Users may select the best model that meets their needs in terms of the balance between resolution and accuracy. The high-precision GGZTD-H model could be used as a ZTD vertical stratification model for the vertical adjustment of atmospheric data and as an empirical model for ZTD estimation, which has potential applications in GNSS precise positioning, such as for the establishment and maintenance of the global terrestrial reference frame.

Diversity maximization is a fundamental problem with broad applications in data summarization, web search, and recommender systems. Given a set X of n elements, the problem asks for a subset S of k≪n elements with maximum diversity, as quantified by the dissimilarities among the elements in S. In this paper, we study diversity maximization with fairness constraints in streaming and sliding-window models. Specifically, we focus on the max–min diversity maximization problem, which selects a subset S that maximizes the minimum distance (dissimilarity) between any pair of distinct elements within it. Assuming that the set X is partitioned into m disjoint groups by a specific sensitive attribute, e.g., sex or race, ensuring fairness requires that the selected subset S contains ki elements from each group i∈[m]. Although diversity maximization has been extensively studied, existing algorithms for fair max–min diversity maximization are inefficient for data streams. To address the problem, we first design efficient approximation algorithms for this problem in the (insert-only) streaming model, where data arrive one element at a time, and a solution should be computed based on the elements observed in one pass. Furthermore, we propose approximation algorithms for this problem in the sliding-window model, where only the latest w elements in the stream are considered for computation to capture the recency of the data. Experimental results on real-world and synthetic datasets show that our algorithms provide solutions of comparable quality to the state-of-the-art offline algorithms while running several orders of magnitude faster in the streaming and sliding-window settings.

Laser scanning systems are modern measurement techniques generating large datasets. Observations, usually collected as a point cloud, present the general results that can be visualized using specialized software. While the final effect might be impressive from a visualization point of view, it is inconvenient formodeling or extracting detailed information about, for example, terrain, buildings, engineering structures, and deformations. Therefore, data from laser scanning systems require post-processing using several methods reflecting different purposes or data processing stages: data segmentation, modeling, and filtration. Msplit estimation is one of the methods that has proved its effectiveness in laser scanning data processing and determination of terrain profiles, deformation, or building shapes. Processing the complete datasets tends to only yield often inadequate results when high-class computers are used, and it is time-consuming. Therefore, datasets tend to remain segmented. This paper explores a range of several types of segmentation methods that can be used in Msplit estimation. It presents profile determination when data cut out from the original point cloud are divided into intervals of the same length, or the sliding window algorithm is applied. In comparison, the given examples show that the latter approach can providemore reliable results. The application of the sliding window algorithm entails having to make assumptions concerning estimation parameters. The paper offers valuable guidance about both the width of the window and the slide size.

The increasing complexity of modern control systems highlights the need for reliable and robust fault detection, isolation, and identification (FDII) methods, particularly in safety-critical and industrial applications. The study focuses on the FDII of multiplicative faults in a DC motor and its electronic amplifier. To simulate such scenarios, a complete laboratory platform was developed for real-time FDII, using relay-based switching and custom LabVIEW software 2009. This platform enables real-time experimentation and represents an important component of the study. Two estimation-based fault detection (FD) algorithms were implemented: the Sliding Window Algorithm (SWA) for discrete-time models and a modified Sliding Integral Algorithm (SIA) for continuous-time models. The modification introduced to the SIA limits the data length used in least squares estimation, thereby reducing the impact of transient effects on parameter accuracy. Both algorithms achieved high model output-to-measured signal agreement, up to 98.6% under nominal conditions and above 95% during almost all fault scenarios. Moreover, the proposed fault isolation and identification methods, including a decision algorithm and an indirect estimation approach, successfully isolated and identified faults in key components such as amplifier resistors (R1, R9, R12), capacitor (C8), and motor parameters, including armature resistance (Ra), inertia (J), and friction coefficient (B). The decision algorithm, based on continuous-time model coefficients, demonstrated reliable fault isolation and identification, while the reduced Jacobian-based approach in the discrete model enhanced fault magnitude estimation, with deviations typically below 10%. Additionally, the platform supports remote experimentation, offering a valuable resource for advancing model-based FDII research and engineering education.

The outbreak of COVID-19 has brought unprecedented challenges not only in China but also in the whole world. Thousands of people have lost their lives, and the social operating system has been affected seriously. Thus, it is urgent to study the determinants of the virus and the health conditions in specific populations and to reveal the strategies and measures in preventing the epidemic spread. In this study, we first adopt the long short-term memory algorithm to predict the infected population in China. However, it gives no interpretation of the dynamics of the spread process. Also the long-term prediction error is too large to be accepted. Thus, we introduce the susceptible-exposed-infected-removed (SEIR) model and further the metapopulation SEIR (mSEIR) model to capture the spread process of COVID-19. By using a sliding window algorithm, we suggest that the parameter estimation and the prediction of the SEIR populations are well performed. In addition, we conduct extensive numerical experiments to show the trend of the infected population for several provinces. The results may provide some insight into the research of epidemics and the understanding of the spread of the current COVID-19.

A configurable process Change Mining approach can detect changes from a collection of event logs and provide details on the unexpected behavior of all process variants of a configurable process. The strength of Change Mining lies in its ability to serve both conformance checking and enhancement purposes; users can simultaneously detect changes and ensure process conformance using a single, integrated framework. In prior research, a configurable process Change Mining algorithm has been introduced. Combined with our proposed preprocessing and change log generation methods, this algorithm forms a complete framework for detecting and recording changes in a collection of event logs. Testing the framework on synthetic data revealed limitations in detecting changes in different types of variable fragments. Consequently, it is recommended that the preprocessing approach be enhanced by applying a filtering algorithm based on sliding and adaptive windows. Our improved approach has been tested on various types of variable fragments to demonstrate its efficacy in enhancing Change Mining performance.

Pressure, water vapor pressure, temperature, and weighted mean temperature (Tm) are tropospheric parameters that play an important role in high-precision global navigation satellite system navigation (GNSS). As accurate tropospheric parameters are obligatory in GNSS navigation and GNSS water vapor detection, high-precision modeling of tropospheric parameters has gained widespread attention in recent years. A new approach is introduced to develop an empirical tropospheric delay model named the China Tropospheric (CTrop) model, providing meteorological parameters based on the sliding window algorithm. The radiosonde data in 2017 are treated as reference values to validate the performance of the CTrop model, which is compared to the canonical Global Pressure and Temperature 3 (GPT3) model. The accuracy of the CTrop model in regards to pressure, water vapor pressure, temperature, and weighted mean temperature are 5.51 hPa, 2.60 hPa, 3.09 K, and 3.35 K, respectively, achieving an improvement of 6%, 9%, 10%, and 13%, respectively, when compared to the GPT3 model. Moreover, three different resolutions of the CTrop model based on the sliding window algorithm are also developed to reduce the amount of gridded data provided to the users, as well as to speed up the troposphere delay computation process, for which users can access model parameters of different resolutions for their requirements. With better accuracy of estimating the tropospheric parameters than that of the GPT3 model, the CTrop model is recommended to improve the performance of GNSS positioning and navigation.