scholarly journals Next Location Prediction Based on an Adaboost-Markov Model of Mobile Users

Sensors ◽  
2019 ◽  
Vol 19 (6) ◽  
pp. 1475 ◽  
Author(s):  
Hongjun Wang ◽  
Zhen Yang ◽  
Yingchun Shi
Keyword(s):  
Markov Model ◽  
Clustering Algorithm ◽  
Smart Cities ◽  
Prediction Performance ◽  
Mobile Users ◽  
Feature Points ◽  
Trajectory Data ◽  
Adaboost Algorithm ◽  
Target User ◽  
Better Than

As an emerging class of spatial trajectory data, mobile user trajectory data can be used to analyze individual or group behavioral characteristics, hobbies and interests. Besides, the information extracted from original trajectory data is widely used in smart cities, transportation planning, and anti-terrorism maintenance. In order to identify the important locations of the target user from his trajectory data, a novel division method for preprocessing trajectory data is proposed, the feature points of original trajectory are extracted according to the change of trajectory structural, and then important locations are extracted by clustering the feature points, using an improved density peak clustering algorithm. Finally, in order to predict next location of mobile users, a multi-order fusion Markov model based on the Adaboost algorithm is proposed, the model order k is adaptively determined, and the weight coefficients of the 1~k-order models are given by the Adaboost algorithm according to the importance of various order models, a multi-order fusion Markov model is generated to predict next important location of the user. The experimental results on the real user trajectory dataset Geo-life show that the prediction performance of Adaboost-Markov model is better than the multi-order fusion Markov model with equal coefficient, and the universality and prediction performance of Adaboost-Markov model is better than the first to third order Markov models.

scholarly journals Developing Models for Managing Drones in the Transportation System in Smart Cities

2019 ◽  
Vol 15 (2) ◽  
pp. 71-78 ◽  
Author(s):  
Nguyen Dinh Dung
Keyword(s):  
Markov Model ◽  
Smart Cities ◽  
Traffic Surveillance ◽  
Safe Distance ◽  
Simulation Techniques ◽  
Distance Model ◽  
Initial Idea ◽  
Improved Model ◽  
Better Than ◽  
Sd Model

AbstractUnmanned aerial vehicles (UAVs), especially drones, have advantages of having applications in different areas, including agriculture, transportation, such as land use surveys and traffic surveillance, and weather research. Many network protocols are architected for the communication between multiple drones. The present study proposes drone-following models for managing drones in the transportation management system in smart cities. These models are based on the initial idea that drones flight towards a leading drone in the traffic flow. Such models are described by the relative distance and velocity functions. Two types of drone-following models are presented in the study. The first model is a safe distance model (SD model), in which a safe distance between a drone and its ahead is maintained. By applying the stochastic diffusion process, an improved model, called Markov model, is deduced. These drone-following models are simulated in a 2D environment using numerical simulation techniques. With the simulation results, it could be noted that: i) there is no accident and no unrealistic deceleration; ii) the velocity of the followed drone is changed according to the speed of the drone ahead; iii) the followed drones keep a safe distance to drone ahead even the velocities are changed; iv) the performance of the Markov model is better than that of the SD model.

scholarly journals Important Location Identification and Personal Location Inference Based on Mobile Subscriber Location Data Preparation of Camera-Ready Contributions to SCITEPRESS Proceedings

2018 ◽  
Vol 173 ◽  
pp. 03086 ◽  
Author(s):  
Zhen Yang ◽  
Wang Hong-jun
Keyword(s):  
Language Processing ◽  
Clustering Algorithm ◽  
Smart Cities ◽  
Mobile Terminal ◽  
Trajectory Data ◽  
Density Peak ◽  
Data Set ◽  
Location Data ◽  
Or Groups ◽  
Density Peak Clustering

As an emerging spatial trajectory data, mobile terminal location data can be widely used to analyze the behavior characteristics and interests of individuals or groups in smart cities, transportation planning and other civil fields. It can also be used to track suspects in anti-terrorism security and public opinion management. Aiming at the problem that it is difficult to determine suitable input parameters of clustering caused by different subscriber location data size and distribution difference, an improved density peak clustering algorithm is proposed and the performance of the improved algorithm is verified on the UCI data set. Firstly the important location is identified by the proposed algorithm, and the personal location is further inferred by the algorithm based on the subscriber's schedule and maximum cluster. Then, the algorithm adopts Google's inverse geocoding technology to obtain the semantic names corresponding to the coordinate points, and introduces the natural language processing technology to achieve word frequency statistics and keyword extraction. The simulation results based on the Geolife data set show that the algorithm is feasible for identifying important locations and inferring personal locations.

scholarly journals Automatic measurement of traditional Chinese costume from its silhouette through Fuzzy c-means clustering method

2020 ◽  
Vol 15 ◽  
pp. 155892502097832
Author(s):  
Jiaqin Zhang ◽  
Jingan Wang ◽  
Le Xing ◽  
Hui’e Liang
Keyword(s):  
Industrial Application ◽  
Clustering Algorithm ◽  
Color Space ◽  
Automatic Measurement ◽  
Feature Point ◽  
Feature Points ◽  
Point Location ◽  
Fuzzy C Means ◽  
Fuzzy C Means Clustering ◽  
Environmental Robustness

As the precious cultural heritage of the Chinese nation, traditional costumes are in urgent need of scientific research and protection. In particular, there are scanty studies on costume silhouettes, due to the reasons of the need for cultural relic protection, and the strong subjectivity of manual measurement, which limit the accuracy of quantitative research. This paper presents an automatic measurement method for traditional Chinese costume dimensions based on fuzzy C-means clustering and silhouette feature point location. The method is consisted of six steps: (1) costume image acquisition; (2) costume image preprocessing; (3) color space transformation; (4) object clustering segmentation; (5) costume silhouette feature point location; and (6) costume measurement. First, the relative total variation model was used to obtain the environmental robustness and costume color adaptability. Second, the FCM clustering algorithm was used to implement image segmentation to extract the outer silhouette of the costume. Finally, automatic measurement of costume silhouette was achieved by locating its feature points. The experimental results demonstrated that the proposed method could effectively segment the outer silhouette of a costume image and locate the feature points of the silhouette. The measurement accuracy could meet the requirements of industrial application, thus providing the dual value of costume culture research and industrial application.

scholarly journals The Application of Baum-Welch Algorithm in Multistep Attack

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yanxue Zhang ◽  
Dongmei Zhao ◽  
Jinxing Liu
Keyword(s):  
Markov Model ◽  
Hidden Markov Model ◽  
Hidden Markov Models ◽  
Viterbi Algorithm ◽  
Markov Models ◽  
Hidden Markov ◽  
Simulation Experiments ◽  
Forward Algorithm ◽  
Better Than

The biggest difficulty of hidden Markov model applied to multistep attack is the determination of observations. Now the research of the determination of observations is still lacking, and it shows a certain degree of subjectivity. In this regard, we integrate the attack intentions and hidden Markov model (HMM) and support a method to forecasting multistep attack based on hidden Markov model. Firstly, we train the existing hidden Markov model(s) by the Baum-Welch algorithm of HMM. Then we recognize the alert belonging to attack scenarios with the Forward algorithm of HMM. Finally, we forecast the next possible attack sequence with the Viterbi algorithm of HMM. The results of simulation experiments show that the hidden Markov models which have been trained are better than the untrained in recognition and prediction.

Optimal Dispatching of Electrical Sensors for Automatic Control

2013 ◽  
Vol 676 ◽  
pp. 246-250 ◽  
Author(s):  
Jian Liang Liu ◽  
Jian Yang ◽  
Wei Yi Liu
Keyword(s):  
Automatic Control ◽  
Control Systems ◽  
Prediction Performance ◽  
Prediction Algorithm ◽  
Bayesian Decision ◽  
Discrete State ◽  
Automatic Control Systems ◽  
Continuous State ◽  
Dispatching Algorithm ◽  
Better Than

In this paper, we consider an electrical sensor dispatching problem for automatic control systems(ACS). We propose an algorithm which selects one (or a group of) electrical sensor at each time from a set of electrical sensors. Then, the automatic control prediction algorithm computes the estimates of the continuous state and the discrete state of the ACS based on the observation from the selected electrical sensors. As the electrical sensor dispatching algorithm is designed such that the Bayesian decision risk is minimized, the true discrete state can be better identified. At the same time, the continuous state prediction performance of the proposed algorithm is better than that of automatic control prediction algorithms using only predetermined electrical sensors. Finally, our algorithm is validated though an illustrative target tracking example.

scholarly journals Intelligent Prediction of Sieving Efficiency in Vibrating Screens

2016 ◽  
Vol 2016 ◽  
pp. 1-7 ◽  
Author(s):  
Bin Zhang ◽  
Jinke Gong ◽  
Wenhua Yuan ◽  
Jun Fu ◽  
Yi Huang
Keyword(s):  
Support Vector Machine ◽  
Cross Validation ◽  
Prediction Performance ◽  
Least Square ◽  
Support Vector ◽  
Adaptive Genetic Algorithm ◽  
Screen Length ◽  
Vibrating Screen ◽  
Working Parameters ◽  
Better Than

In order to effectively predict the sieving efficiency of a vibrating screen, experiments to investigate the sieving efficiency were carried out. Relation between sieving efficiency and other working parameters in a vibrating screen such as mesh aperture size, screen length, inclination angle, vibration amplitude, and vibration frequency was analyzed. Based on the experiments, least square support vector machine (LS-SVM) was established to predict the sieving efficiency, and adaptive genetic algorithm and cross-validation algorithm were used to optimize the parameters in LS-SVM. By the examination of testing points, the prediction performance of least square support vector machine is better than that of the existing formula and neural network, and its average relative error is only 4.2%.

scholarly journals STUDY ON THE WATER BODY EXTRACTION USING GF-1 DATA BASED ON ADABOOST INTEGRATED LEARNING ALGORITHM

2020 ◽  
Vol XLII-3/W10 ◽  
pp. 641-648
Author(s):  
J. Y. Sun ◽  
G. Z. Wang ◽  
G. J. He ◽  
D. C. Pu ◽  
W. Jiang ◽  
...  
Keyword(s):  
Surface Water ◽  
Water Body ◽  
Rapid Development ◽  
Kappa Coefficient ◽  
Water Bodies ◽  
Integrated Learning ◽  
Visual Interpretation ◽  
Adaboost Algorithm ◽  
Classification Time ◽  
Better Than

Abstract. Surface water system is an important part of global ecosystem, and the changes in surface water may lead to disasters, such as drought, waterlog, and water-borne diseases. The rapid development of remote sensing technology has supplied better strategies for water bodies extraction and further monitoring. In this study, AdaBoost and Random Forest (RF), two typical algorithms in integrated learning, were applied to extract water bodies in Chaozhou area (mainly located in Guangzhou Province, China) based on GF-1 data, and the Decision Tree (DT) was used for comparative tests to comprehensively evaluate the performance of classification algorithms listed above for surface water body extraction. The results showed that: (1) Compared with visual interpretation, AdaBoost performed better than RF in the extraction of several typical water bodies, such as rivers, lakes and ponds Moreover, the water extraction results of the strong classifiers using AdaBoost or RF were better than the weak basic classifiers. (2) For the quantitative accuracy statistics, the overall accuracy (96.5%) and kappa coefficient (93%) using AdaBoost exceeded those using RF (5.3% and 10.6%), respectively. The classification time of AdaBoost increased by 403 seconds and 918 seconds relative to RF and DT methods. However, in terms of visual interpretation, quantitative statistical accuracy and classification time, AdaBoost algorithm was more suitable for the water body extraction. (3) For the sample proportion comparison experiment of AdaBoost, four sampling proportions (0.1%, 0.2%, 1% and 2%) were chosen and 0.1% sampling proportion reached the optimum classification accuracy (93.9%) and kappa coefficient (87.8%).

scholarly journals Charuco Board-Based Omnidirectional Camera Calibration Method

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 421 ◽  
Author(s):  
Gwon An ◽  
Siyeong Lee ◽  
Min-Woo Seo ◽  
Kugjin Yun ◽  
Won-Sik Cheong ◽  
...  
Keyword(s):  
Camera Calibration ◽  
Mean Absolute Error ◽  
Three Dimensional ◽  
Absolute Error ◽  
Calibration Method ◽  
Feature Points ◽  
Omnidirectional Camera ◽  
Reprojection Error ◽  
Conventional Methods ◽  
Better Than

In this paper, we propose a Charuco board-based omnidirectional camera calibration method to solve the problem of conventional methods requiring overly complicated calibration procedures. Specifically, the proposed method can easily and precisely provide two-dimensional and three-dimensional coordinates of patterned feature points by arranging the omnidirectional camera in the Charuco board-based cube structure. Then, using the coordinate information of the feature points, an intrinsic calibration of each camera constituting the omnidirectional camera can be performed by estimating the perspective projection matrix. Furthermore, without an additional calibration structure, an extrinsic calibration of each camera can be performed, even though only part of the calibration structure is included in the captured image. Compared to conventional methods, the proposed method exhibits increased reliability, because it does not require additional adjustments to the mirror angle or the positions of several pattern boards. Moreover, the proposed method calibrates independently, regardless of the number of cameras comprising the omnidirectional camera or the camera rig structure. In the experimental results, for the intrinsic parameters, the proposed method yielded an average reprojection error of 0.37 pixels, which was better than that of conventional methods. For the extrinsic parameters, the proposed method had a mean absolute error of 0.90° for rotation displacement and a mean absolute error of 1.32 mm for translation displacement.

Vehicle Seat Detection Based on Improved RANSAC-SURF Algorithm

2020 ◽  
pp. 2155004
Author(s):  
Xiaoguang Li ◽  
Juan Zhu ◽  
Yiming Ruan
Keyword(s):  
Median Filter ◽  
Perspective Transformation ◽  
Feature Points ◽  
Matching Algorithm ◽  
Absolute Value ◽  
Mean Filter ◽  
Intersection Points ◽  
The Mean ◽  
Vehicle Seat ◽  
Better Than

In order to detect the type of vehicle seat and the missing part of the spring hook, this paper proposes an improved RANSAC-SURF method. First, the image is filtered by a Gauss filter. Second, an improved RANSAC-SURF algorithm is used to detect the types of vehicle seats. Extract the feature points of vehicle seats. The feature points are matched according to the improved RANSAC-SURF algorithm. Third, the image distortion of the vehicle seat is corrected by the method of perspective transformation. Determine whether the seat’s spring hook is missing or not according to the absolute value of the gray difference between the image collected by the camera and the image of the normal installation. The experimental results show that the MSE of the Gauss filter under a 5 [Formula: see text] 5 template is 19.0753, and the PSNR is 35.3261, which is better than that of the mean filter and the median filter. The total matching logarithm of feature points and the number of intersection points are 188 and 18, respectively, in the improved RANSAC-SURF matching algorithm.

scholarly journals Endmember Learning with K-Means through SCD Model in Hyperspectral Scene Reconstructions

2019 ◽  
Vol 5 (11) ◽  
pp. 85 ◽  
Author(s):  
Ayan Chatterjee ◽  
Peter W. T. Yuen
Keyword(s):  
Dictionary Learning ◽  
Sparse Coding ◽  
Clustering Algorithm ◽  
Matching Pursuit ◽  
Orthogonal Matching Pursuit ◽  
Scene Reconstruction ◽  
Data Sets ◽  
Practical Applications ◽  
Input Dataset ◽  
Better Than

This paper proposes a simple yet effective method for improving the efficiency of sparse coding dictionary learning (DL) with an implication of enhancing the ultimate usefulness of compressive sensing (CS) technology for practical applications, such as in hyperspectral imaging (HSI) scene reconstruction. CS is the technique which allows sparse signals to be decomposed into a sparse representation “a” of a dictionary D u . The goodness of the learnt dictionary has direct impacts on the quality of the end results, e.g., in the HSI scene reconstructions. This paper proposes the construction of a concise and comprehensive dictionary by using the cluster centres of the input dataset, and then a greedy approach is adopted to learn all elements within this dictionary. The proposed method consists of an unsupervised clustering algorithm (K-Means), and it is then coupled with an advanced sparse coding dictionary (SCD) method such as the basis pursuit algorithm (orthogonal matching pursuit, OMP) for the dictionary learning. The effectiveness of the proposed K-Means Sparse Coding Dictionary (KMSCD) is illustrated through the reconstructions of several publicly available HSI scenes. The results have shown that the proposed KMSCD achieves ~40% greater accuracy, 5 times faster convergence and is twice as robust as that of the classic Spare Coding Dictionary (C-SCD) method that adopts random sampling of data for the dictionary learning. Over the five data sets that have been employed in this study, it is seen that the proposed KMSCD is capable of reconstructing these scenes with mean accuracies of approximately 20–500% better than all competing algorithms adopted in this work. Furthermore, the reconstruction efficiency of trace materials in the scene has been assessed: it is shown that the KMSCD is capable of recovering ~12% better than that of the C-SCD. These results suggest that the proposed DL using a simple clustering method for the construction of the dictionary has been shown to enhance the scene reconstruction substantially. When the proposed KMSCD is incorporated with the Fast non-negative orthogonal matching pursuit (FNNOMP) to constrain the maximum number of materials to coexist in a pixel to four, experiments have shown that it achieves approximately ten times better than that constrained by using the widely employed TMM algorithm. This may suggest that the proposed DL method using KMSCD and together with the FNNOMP will be more suitable to be the material allocation module of HSI scene simulators like the CameoSim package.

Sign in / Sign up

Export Citation Format

Share Document