scholarly journals Road Congestion Detection Based on Trajectory Stay-Place Clustering

2019 ◽  
Vol 8 (6) ◽  
pp. 264 ◽  
Author(s):  
Qingying Yu ◽  
Yonglong Luo ◽  
Chuanming Chen ◽  
Xiaoyao Zheng
Keyword(s):  
Traffic Management ◽  
Moving Objects ◽  
Real Life ◽  
Equivalence Classes ◽  
Trajectory Data ◽  
Road Congestion ◽  
Trajectory Mining ◽  
Congestion Detection ◽  
Rational Planning ◽  
Novel Approach

The results of road congestion detection can be used for the rational planning of travel routes and as guidance for traffic management. The trajectory data of moving objects can record their positions at each moment and reflect their moving features. Utilizing trajectory mining technology to effectively identify road congestion locations is of great importance and has practical value in the fields of traffic and urban planning. This paper addresses the issue by proposing a novel approach to detect road congestion locations based on trajectory stay-place clustering. First, this approach estimates the speed status of each time-stamped location in each trajectory. Then, it extracts the stay places of the trajectory, each of which is denoted as a seven-tuple containing information such as starting and ending time, central coordinate, average direction difference, and so on. Third, the time-stamped locations included in stay places are partitioned into different stay-place equivalence classes according to the timestamps. Finally, stay places in each equivalence class are clustered to mine the congestion locations of multiple trajectories at a certain period of time. Visual representation and experimental results on real-life cab trajectory datasets show that the proposed approach is suitable for the detection of congestion locations at different timestamps.

scholarly journals Extracting Stops from Spatio-Temporal Trajectories within Dynamic Contextual Features

2021 ◽  
Vol 13 (2) ◽  
pp. 690
Author(s):  
Tao Wu ◽  
Huiqing Shen ◽  
Jianxin Qin ◽  
Longgang Xiang
Keyword(s):  
Moving Objects ◽  
Major Effect ◽  
Location Based Services ◽  
Trajectory Data ◽  
The Road ◽  
Contextual Features ◽  
Novel Approach ◽  
Gps Trajectories ◽  
Time Distance ◽  
Spatio Temporal

Identifying stops from GPS trajectories is one of the main concerns in the study of moving objects and has a major effect on a wide variety of location-based services and applications. Although the spatial and non-spatial characteristics of trajectories have been widely investigated for the identification of stops, few studies have concentrated on the impacts of the contextual features, which are also connected to the road network and nearby Points of Interest (POIs). In order to obtain more precise stop information from moving objects, this paper proposes and implements a novel approach that represents a spatio-temproal dynamics relationship between stopping behaviors and geospatial elements to detect stops. The relationship between the candidate stops based on the standard time–distance threshold approach and the surrounding environmental elements are integrated in a complex way (the mobility context cube) to extract stop features and precisely derive stops using the classifier classification. The methodology presented is designed to reduce the error rate of detection of stops in the work of trajectory data mining. It turns out that 26 features can contribute to recognizing stop behaviors from trajectory data. Additionally, experiments on a real-world trajectory dataset further demonstrate the effectiveness of the proposed approach in improving the accuracy of identifying stops from trajectories.

A Novel Approach for Mining Time and Space Proximity-based Frequent Sequential Patterns from Trajectory Data

2020 ◽  
Vol 19 (04) ◽  
pp. 2050040
Author(s):  
Rayanoothala Praneetha Sree ◽  
D. V. L. N. Somayajulu ◽  
S. Ravichandra
Keyword(s):  
Moving Objects ◽  
Sequential Patterns ◽  
Computational Time ◽  
Manhattan Distance ◽  
Trajectory Data ◽  
Space Partitioning ◽  
Novel Approach ◽  
Time Stamps ◽  
Text Length ◽  
Hidden Patterns

Trajectory Data have been considered as a treasure for various hidden patterns which provide deeper understanding of the underlying moving objects. Several studies are focused to extract repetitive, frequent and group patterns. Conventional algorithms defined for Sequential Patterns Mining problems are not directly applicable for trajectory data. Space Partitioning strategies were proposed to capture space proximity first and then time proximity to discover the knowledge in the data. Our proposal addresses time proximity first by identifying trajectories which meet at a minimum of [Formula: see text] time stamps in sequence. A novel tree structure is proposed to ease the process. Our method investigates space proximity using Mahalanobis distance (MD). We have used the Manhattan distance to form prior knowledge that helps the supervised learning-based MD to derive the clusters of trajectories along the true spreads of the objects. With the help of minsup threshold, clusters of frequent trajectories are found and then in sequence they form [Formula: see text] length Sequential Patterns. Illustrative examples are provided to compare the MD metric with Euclidean distance metric, Synthetic dataset is generated and results are presented considering the various parameters such as number of objects, minsup, [Formula: see text] value, number of hops in any trajectory and computational time. Experiments are done on available real-time dataset, taxi dataset, too. Sequential Patterns are proved to be worthy of knowledge to understand dynamics of the moving objects and to recommend the movements in constrained networks.

scholarly journals Massively Parallel Discovery of Loosely Moving Congestion Patterns from Trajectory Data

2021 ◽  
Vol 10 (11) ◽  
pp. 787
Author(s):  
Chunchun Hu ◽  
Si Chen
Keyword(s):  
Traffic Management ◽  
Graphics Processing Units ◽  
Large Scale ◽  
Moving Objects ◽  
Urban Traffic ◽  
Trajectory Data ◽  
Significant Group ◽  
Study Results ◽  
Movement Tendency ◽  
Graphics Processing

The efficient discovery of significant group patterns from large-scale spatiotemporal trajectory data is a primary challenge, particularly in the context of urban traffic management. Existing studies on group pattern discovery mainly focus on the spatial gathering and moving continuity of vehicles or animals; these studies either set too many limitations in the shape of the cluster and time continuity or only focus on the characteristic of the gathering. Meanwhile, little attention has been paid to the equidirectional movement of the aggregated objects and their loose coherence moving. In this study, we propose the concept of loosely moving congestion patterns that represent a group of moving objects together with similar movement tendency and loose coherence moving, which exhibit a potential congestion characteristic. Meanwhile, we also develop an accelerated algorithm called parallel equidirectional cluster-recombinant (PDCLUR) that runs on graphics processing units (GPUs) to detect congestion patterns from large-scale raw taxi-trajectory data. The case study results demonstrate the performance of our approach and its applicability to large trajectory dataset, and we can discover some significant loosely moving congesting patterns and when and where the most congested road segments are observed. The developed algorithm PDCLUR performs satisfactorily, affording an acceleration ratio of over 65 relative to the traditional sequential algorithms.

scholarly journals A Survey and Experimental Study on Privacy-Preserving Trajectory Data Publishing

2021 ◽  
Author(s):  
Fengmei Jin ◽  
Wen Hua ◽  
Matteo Francia ◽  
Pingfu Chao ◽  
Maria Orlowska ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Traffic Management ◽  
Real Life ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Data Publishing ◽  
Sensitive Information ◽  
Mobility Patterns ◽  
Trajectory Data ◽  
The Right

<div>Trajectory data has become ubiquitous nowadays, which can benefit various real-world applications such as traffic management and location-based services. However, trajectories may disclose highly sensitive information of an individual including mobility patterns, personal profiles and gazetteers, social relationships, etc, making it indispensable to consider privacy protection when releasing trajectory data. Ensuring privacy on trajectories demands more than hiding single locations, since trajectories are intrinsically sparse and high-dimensional, and require to protect multi-scale correlations. To this end, extensive research has been conducted to design effective techniques for privacy-preserving trajectory data publishing. Furthermore, protecting privacy requires carefully balance two metrics: privacy and utility. In other words, it needs to protect as much privacy as possible and meanwhile guarantee the usefulness of the released trajectories for data analysis. In this survey, we provide a comprehensive study and systematic summarization of existing protection models, privacy and utility metrics for trajectories developed in the literature. We also conduct extensive experiments on a real-life public trajectory dataset to evaluate the performance of several representative privacy protection models, demonstrate the trade-off between privacy and utility, and guide the choice of the right privacy model for trajectory publishing given certain privacy and utility desiderata.</div>

scholarly journals A Survey and Experimental Study on Privacy-Preserving Trajectory Data Publishing

2021 ◽  
Author(s):  
Fengmei Jin ◽  
Wen Hua ◽  
Matteo Francia ◽  
Pingfu Chao ◽  
Maria Orlowska ◽  
...  
Keyword(s):  
Privacy Protection ◽  
Traffic Management ◽  
Real Life ◽  
Privacy Preserving ◽  
Location Based Services ◽  
Data Publishing ◽  
Sensitive Information ◽  
Mobility Patterns ◽  
Trajectory Data ◽  
The Right

<div>Trajectory data has become ubiquitous nowadays, which can benefit various real-world applications such as traffic management and location-based services. However, trajectories may disclose highly sensitive information of an individual including mobility patterns, personal profiles and gazetteers, social relationships, etc, making it indispensable to consider privacy protection when releasing trajectory data. Ensuring privacy on trajectories demands more than hiding single locations, since trajectories are intrinsically sparse and high-dimensional, and require to protect multi-scale correlations. To this end, extensive research has been conducted to design effective techniques for privacy-preserving trajectory data publishing. Furthermore, protecting privacy requires carefully balance two metrics: privacy and utility. In other words, it needs to protect as much privacy as possible and meanwhile guarantee the usefulness of the released trajectories for data analysis. In this survey, we provide a comprehensive study and systematic summarization of existing protection models, privacy and utility metrics for trajectories developed in the literature. We also conduct extensive experiments on a real-life public trajectory dataset to evaluate the performance of several representative privacy protection models, demonstrate the trade-off between privacy and utility, and guide the choice of the right privacy model for trajectory publishing given certain privacy and utility desiderata.</div>

scholarly journals New fractional approaches for n-polynomial P-convexity with applications in special function theory

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Shu-Bo Chen ◽  
Saima Rashid ◽  
Muhammad Aslam Noor ◽  
Zakia Hammouch ◽  
Yu-Ming Chu
Keyword(s):  
Fractional Calculus ◽  
Convex Functions ◽  
Special Functions ◽  
Real Life ◽  
Fractional Integrals ◽  
Digamma Function ◽  
Novel Approach ◽  
Inequality Theory ◽  
New Strategy ◽  
Significant Mechanism

Abstract Inequality theory provides a significant mechanism for managing symmetrical aspects in real-life circumstances. The renowned distinguishing feature of integral inequalities and fractional calculus has a solid possibility to regulate continuous issues with high proficiency. This manuscript contributes to a captivating association of fractional calculus, special functions and convex functions. The authors develop a novel approach for investigating a new class of convex functions which is known as an n-polynomial $\mathcal{P}$ P -convex function. Meanwhile, considering two identities via generalized fractional integrals, provide several generalizations of the Hermite–Hadamard and Ostrowski type inequalities by employing the better approaches of Hölder and power-mean inequalities. By this new strategy, using the concept of n-polynomial $\mathcal{P}$ P -convexity we can evaluate several other classes of n-polynomial harmonically convex, n-polynomial convex, classical harmonically convex and classical convex functions as particular cases. In order to investigate the efficiency and supremacy of the suggested scheme regarding the fractional calculus, special functions and n-polynomial $\mathcal{P}$ P -convexity, we present two applications for the modified Bessel function and $\mathfrak{q}$ q -digamma function. Finally, these outcomes can evaluate the possible symmetric roles of the criterion that express the real phenomena of the problem.

New Multi-View Classification Method with Uncertain Data

2021 ◽  
Vol 16 (1) ◽  
pp. 1-23
Author(s):  
Bo Liu ◽  
Haowen Zhong ◽  
Yanshan Xiao
Keyword(s):  
Learning Strategy ◽  
State Of The Art ◽  
Uncertain Data ◽  
Real Life ◽  
Support Vector ◽  
Classification Methods ◽  
Complementary Information ◽  
Novel Approach ◽  
Svm Model ◽  
Iterative Framework

Multi-view classification aims at designing a multi-view learning strategy to train a classifier from multi-view data, which are easily collected in practice. Most of the existing works focus on multi-view classification by assuming the multi-view data are collected with precise information. However, we always collect the uncertain multi-view data due to the collection process is corrupted with noise in real-life application. In this case, this article proposes a novel approach, called uncertain multi-view learning with support vector machine (UMV-SVM) to cope with the problem of multi-view learning with uncertain data. The method first enforces the agreement among all the views to seek complementary information of multi-view data and takes the uncertainty of the multi-view data into consideration by modeling reachability area of the noise. Then it proposes an iterative framework to solve the proposed UMV-SVM model such that we can obtain the multi-view classifier for prediction. Extensive experiments on real-life datasets have shown that the proposed UMV-SVM can achieve a better performance for uncertain multi-view classification in comparison to the state-of-the-art multi-view classification methods.

scholarly journals Hybrid Mamdani Fuzzy Rules and Convolutional Neural Networks for Analysis and Identification of Animal Images

Computation ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 35
Author(s):  
Hind R. Mohammed ◽  
Zahir M. Hussain
Keyword(s):  
Neural Networks ◽  
Convolutional Neural Networks ◽  
High Speed ◽  
Moving Objects ◽  
Real Life ◽  
Fuzzy Rules ◽  
High Rate ◽  
Moving Images ◽  
Animal Images

Accurate, fast, and automatic detection and classification of animal images is challenging, but it is much needed for many real-life applications. This paper presents a hybrid model of Mamdani Type-2 fuzzy rules and convolutional neural networks (CNNs) applied to identify and distinguish various animals using different datasets consisting of about 27,307 images. The proposed system utilizes fuzzy rules to detect the image and then apply the CNN model for the object’s predicate category. The CNN model was trained and tested based on more than 21,846 pictures of animals. The experiments’ results of the proposed method offered high speed and efficiency, which could be a prominent aspect in designing image-processing systems based on Type 2 fuzzy rules characterization for identifying fixed and moving images. The proposed fuzzy method obtained an accuracy rate for identifying and recognizing moving objects of 98% and a mean square error of 0.1183464 less than other studies. It also achieved a very high rate of correctly predicting malicious objects equal to recall = 0.98121 and a precision rate of 1. The test’s accuracy was evaluated using the F1 Score, which obtained a high percentage of 0.99052.

scholarly journals Sensor Fusion-Based Approach to Eliminating Moving Objects for SLAM in Dynamic Environments

Sensors ◽  
2021 ◽  
Vol 21 (1) ◽  
pp. 230
Author(s):  
Xiangwei Dang ◽  
Zheng Rong ◽  
Xingdong Liang
Keyword(s):  
State Estimation ◽  
Autonomous Navigation ◽  
Moving Objects ◽  
Physical Simulation ◽  
Point Clouds ◽  
Dynamic Environments ◽  
Accurate Localization ◽  
Novel Approach ◽  
Localization And Mapping ◽  
Real World Datasets

Accurate localization and reliable mapping is essential for autonomous navigation of robots. As one of the core technologies for autonomous navigation, Simultaneous Localization and Mapping (SLAM) has attracted widespread attention in recent decades. Based on vision or LiDAR sensors, great efforts have been devoted to achieving real-time SLAM that can support a robot’s state estimation. However, most of the mature SLAM methods generally work under the assumption that the environment is static, while in dynamic environments they will yield degenerate performance or even fail. In this paper, first we quantitatively evaluate the performance of the state-of-the-art LiDAR-based SLAMs taking into account different pattens of moving objects in the environment. Through semi-physical simulation, we observed that the shape, size, and distribution of moving objects all can impact the performance of SLAM significantly, and obtained instructive investigation results by quantitative comparison between LOAM and LeGO-LOAM. Secondly, based on the above investigation, a novel approach named EMO to eliminating the moving objects for SLAM fusing LiDAR and mmW-radar is proposed, towards improving the accuracy and robustness of state estimation. The method fully uses the advantages of different characteristics of two sensors to realize the fusion of sensor information with two different resolutions. The moving objects can be efficiently detected based on Doppler effect by radar, accurately segmented and localized by LiDAR, then filtered out from the point clouds through data association and accurate synchronized in time and space. Finally, the point clouds representing the static environment are used as the input of SLAM. The proposed approach is evaluated through experiments using both semi-physical simulation and real-world datasets. The results demonstrate the effectiveness of the method at improving SLAM performance in accuracy (decrease by 30% at least in absolute position error) and robustness in dynamic environments.

MDTP

2021 ◽  
Vol 14 (8) ◽  
pp. 1289-1297
Author(s):  
Ziquan Fang ◽  
Lu Pan ◽  
Lu Chen ◽  
Yuntao Du ◽  
Yunjun Gao
Keyword(s):  
Neural Network ◽  
Short Term Memory ◽  
Temporal Dynamics ◽  
Real Life ◽  
Feature Modeling ◽  
Traffic Prediction ◽  
Interactive System ◽  
Trajectory Data ◽  
Spatio Temporal ◽  
Prediction Approach

Traffic prediction has drawn increasing attention for its ubiquitous real-life applications in traffic management, urban computing, public safety, and so on. Recently, the availability of massive trajectory data and the success of deep learning motivate a plethora of deep traffic prediction studies. However, the existing neural-network-based approaches tend to ignore the correlations between multiple types of moving objects located in the same spatio-temporal traffic area, which is suboptimal for traffic prediction analytics. In this paper, we propose a multi-source deep traffic prediction framework over spatio-temporal trajectory data, termed as MDTP. The framework includes two phases: spatio-temporal feature modeling and multi-source bridging. We present an enhanced graph convolutional network (GCN) model combined with long short-term memory network (LSTM) to capture the spatial dependencies and temporal dynamics of traffic in the feature modeling phase. In the multi-source bridging phase, we propose two methods, Sum and Concat, to connect the learned features from different trajectory data sources. Extensive experiments on two real-life datasets show that MDTP i) has superior efficiency, compared with classical time-series methods, machine learning methods, and state-of-the-art neural-network-based approaches; ii) offers a significant performance improvement over the single-source traffic prediction approach; and iii) performs traffic predictions in seconds even on tens of millions of trajectory data. we develop MDTP + , a user-friendly interactive system to demonstrate traffic prediction analysis.

Sign in / Sign up

Export Citation Format

Share Document