Evaluation of Outlier Filtering Algorithms for Accurate Travel Time Measurement Incorporating Lane-Splitting Situations

Malaysia has a high percentage of motorcycles. Due to lane-splitting, travel times of motorcycles are less than passenger cars at congestion. Because of this, collecting travel times using the media access control (MAC) address is not straightforward. Many outlier filtering algorithms for travel time datasets have not been evaluated for their capability to filter lane-splitting observations. This study aims to identify the best travel time filtering algorithms for the data containing lane-splitting observations and how to use the best algorithm. Two stages were adopted to achieve the objective of the study. The first stage validates the performance of the previous algorithms, and the second stage checks the sensitivity of the algorithm parameters for different days. The analysis uses the travel time data for three routes in Kuala Lumpur collected by Wi-Fi detectors in May 2018. The results show that the Jang algorithm has the best performance for two of the three routes, and the TransGuide algorithm is the best algorithm for one route. However, the parameters of Jang and TransGuide algorithms are sensitive for different days, and the parameters require daily calibration to obtain acceptable results. Using proper calibration of the algorithm parameters, the Jang and TransGuide algorithms produced the most accurate filtered travel time datasets compared to other algorithms

Diffusion Generalized MCC with a Variable Center Algorithm for Robust Distributed Estimation

Classical adaptive filtering algorithms with a diffusion strategy under the mean square error (MSE) criterion can face difficulties in distributed estimation (DE) over networks in a complex noise environment, such as non-zero mean non-Gaussian noise, with the object of ensuring a robust performance. In order to overcome such limitations, this paper proposes a novel robust diffusion adaptive filtering algorithm, which is developed by using a variable center generalized maximum Correntropy criterion (GMCC-VC). Generalized Correntropy with a variable center is first defined by introducing a non-zero center to the original generalized Correntropy, which can be used as robust cost function, called GMCC-VC, for adaptive filtering algorithms. In order to improve the robustness of the traditional MSE-based DE algorithms, the GMCC-VC is used in a diffusion adaptive filter to design a novel robust DE method with the adapt-then-combine strategy. This can achieve outstanding steady-state performance under non-Gaussian noise environments because the GMCC-VC can match the distribution of the noise with that of non-zero mean non-Gaussian noise. The simulation results for distributed estimation under non-zero mean non-Gaussian noise cases demonstrate that the proposed diffusion GMCC-VC approach produces a more robustness and stable performance than some other comparable DE methods.

Measure of nonlinearity for underwater target tracking using hull-mounted sensor

PurposeDoppler-Bearing Tracking (DBT) is commonly used in target tracking applications for the underwater environment using the Hull-Mounted Sensor (HMS). It is an important and challenging problem in an underwater environment.Design/methodology/approachThe system nonlinearity in an underwater environment increases due to several reasons such as the type of measurements taken, the speeds of target and observer, environmental conditions, number of sensors considered for measurements and so on. Degrees of nonlinearity (DoNL) for these problems are analyzed using a proposed measure of nonlinearity (MoNL) for state estimation.FindingsIn this research, the authors analyzed MoNL for state estimation and computed the conditional MoNL (normalized) using different filtering algorithms where measurements are obtained from a single sensor array (i.e. HMS). MoNL is implemented to find out the system nonlinearity for different filtering algorithms and identified how much nonlinear the system is, that is, to measure nonlinearity of a problem.Originality/valueAlgorithms are evaluated for various scenarios with different angles on the target bow (ATB) in Monte-Carlo simulation. Computation of root mean squared (RMS) errors in position and velocity is carried out to assess the state estimation accuracy using MATLAB.

Research on Robustness of Geometric Algebra Based Adaptive Filtering Algorithms In Non-Gaussian Environment

In this paper, two new geometric algebra (GA) based adaptive filtering algorithms in non-Gaussian environment are proposed, which are deduced from the robust algorithms based on the minimum error entropy (MEE) criterion and the joint criterion of the MEE and the mean square error (MSE) with the help of GA theory. Some experiments validate the effectiveness and superiority of the GA-MEE and GA-MSEMEE algorithms in α-stable noise environment. At the same time, the GA-MSEMEE algorithm has faster convergence speed compared with the GA-MEE.

Robust adaptive filtering algorithms based on (inverse)hyperbolic sine function

Recently, adaptive filtering algorithms were designed using hyperbolic functions, such as hyperbolic cosine and tangent function. However, most of those algorithms have few parameters that need to be set, and the adaptive estimation accuracy and convergence performance can be improved further. More importantly, the hyperbolic sine function has not been discussed. In this paper, a family of adaptive filtering algorithms is proposed using hyperbolic sine function (HSF) and inverse hyperbolic sine function (IHSF) function. Specifically, development of a robust adaptive filtering algorithm based on HSF, and extend the HSF algorithm to another novel adaptive filtering algorithm based on IHSF; then continue to analyze the computational complexity for HSF and IHSF; finally, validation of the analyses and superiority of the proposed algorithm via simulations. The HSF and IHSF algorithms can attain superior steady-state performance and stronger robustness in impulsive interference than several existing algorithms for different system identification scenarios, under Gaussian noise and impulsive interference, demonstrate the superior performance achieved by HSF and IHSF over existing adaptive filtering algorithms with different hyperbolic functions.

Collaborative Filtering Technical Comparison in Implicit Data

Recommendation systems have become a necessity due to the mass of information accumulated for each site. For this purpose, there are several methods including collaborative filtering and content-based filtering. For each approach there is a vast list of procedural choices. The work studies the different methods and algorithms in the field of collaborative filtering recommendation. The objective of the work is to implement these algorithms in order to compare the different performances of each one; the tests were carried out in two datasets, book crossing and Movieslens. The use of a data set benchmark is crucial for the proper evaluation of collaborative filtering algorithms in order to draw a conclusion on the performance of the algorithms.