An intersection‐based trajectory‐region movement study

In order to better understand the movement of an object with respect to a region, we propose a formal model of the evolving spatial relationships that transition between local topologies with respect to a trajectory and a region as well as develop a querying mechanism to analyze movement patterns. We summarize 12 types of local topologies built on trajectory‐region intersections, and derive their transition graph; then we capture and model evolving local topologies with two types of trajectory‐region strings, a movement string and a stop‐move string. The stop‐move string encodes the stop information further during a trajectory than the movement string. Such a string‐format expression of trajectory‐region movement, although conceptually simple, carries unprecedented information for effectively interpreting how trajectories move with respect to regions. We also design the corresponding Finite State Automations for a movement string as well as a stop‐move string, which are used not only to recognize the language of trajectory‐region strings, but also to deal effectively with trajectory‐region pattern queries. When annotated with the time information of stops and intersections, a trajectory‐region movement snapshot and its evolution during a time interval can be inferred, and even the relationships among trajectories with respect to the same region can be explored.     

A reliable traffic prediction approach for bike‐sharing system by exploiting rich information with temporal link prediction strategy

Bike‐sharing systems have been widely used in major cities across the world. As bike borrowing and return at different stations in different periods are not balanced, the bikes in a bike‐sharing system need to be redistributed frequently to rebalance the system. Therefore, traffic flow forecasting of the bike‐sharing system is an important issue, as this is conducive to achieving rebalancing of the bike system. In this article, we present a new traffic flow prediction approach based on the temporal links in dynamic traffic flow networks. A station clustering algorithm is first introduced to cluster stations into groups. A temporal link prediction method based on the dynamic traffic flow network method (STW+M) is then proposed to predict the traffic flow between stations. In our method, the non‐negative tensor decomposition and time‐series analysis model capture the rich information (temporal variabilities, spatial characteristics, and weather information) of the across‐clusters transition. Then, a temporal link prediction strategy is used to forecast potential links and weights in the traffic flow network by investigating both the network structure and the results of tensor computations. In order to assess the methods proposed in this article, we have used the data of bike‐sharing systems in New York and Washington, DC to conduct bike traffic prediction and the experimental results have shown that our method produces the lowest root mean square error (RMSE) and mean square error (MSE). Compared to four prediction methods from the literature, our RMSE and MSE of the two datasets have been lowered by an average of 2.55 (Washington, DC) and 2.41 (New York) and 3.35 (Washington, DC) and 2.96 (New York), respectively. The results show that the proposed approach improves predictions of traffic flow.     

Building Agent‐Based Walking Models by Machine‐Learning on Diverse Databases of Space‐Time Trajectory Samples

We introduce a novel scheme for automatically deriving synthetic walking (locomotion) and movement (steering and avoidance) behavior in simulation from simple trajectory samples. We use a combination of observed and recorded real‐world movement trajectory samples in conjunction with synthetic, agent‐generated, movement as inputs to a machine‐learning scheme. This scheme produces movement behavior for non‐sampled scenarios in simulation, for applications that can differ widely from the original collection settings. It does this by benchmarking a simulated pedestrian's relative behavioral geography, local physical environment, and neighboring agent‐pedestrians; using spatial analysis, spatial data access, classification, and clustering. The scheme then weights, trains, and tunes likely synthetic movement behavior, per‐agent, per‐location, per‐time‐step, and per‐scenario. To prove its usefulness, we demonstrate the task of generating synthetic, non‐sampled, agent‐based pedestrian movement in simulated urban environments, where the scheme proves to be a useful substitute for traditional transition‐driven methods for determining agent behavior. The potential broader applications of the scheme are numerous and include the design and delivery of location‐based services, evaluation of architectures for mobile communications technologies, what‐if experimentation in agent‐based models with hypotheses that are informed or translated from data, and the construction of algorithms for extracting and annotating space‐time paths in massive data‐sets.     

Identifying stops from mobile phone location data by introducing uncertain segments

Identifying stops is a primary step in acquiring activity‐related information from mobile phone location data to understand the activity patterns of individuals. However, signal jumps in mobile phone location data may create “fake moves,” which will generate fake activity patterns of “stops‐and‐moves.” These “fake moves” share similar spatiotemporal features with real short‐distance moves, and the stops and moves of trajectories (SMoT), which is the most extensively used stop identification model, often fails to distinguish them when the dataset has coarse temporal resolution. This study proposes the stops, moves, and uncertainties of trajectories (SMUoT) model to address this issue by introducing uncertain segment analysis to distinguish “fake moves” and real short‐distance moves. A real mobile phone location dataset collected in Shenzhen, China is used to evaluate the performance of SMUoT. We find that SMUoT improves the performance (i.e., 15 and 19% increase in accuracy and recall rate for a one‐hour temporal resolution dataset, respectively) of stop identification and exhibits high robustness to parameter settings. With a better reliability of “stops‐and‐moves” pattern identification, the proposed SMUoT can benefit various individual activity‐related research based on mobile phone location data for many fields, such as urban planning, traffic analysis, and emergency management.     

Enhancing data privacy with semantic trajectories: A raster‐based framework for GPS stop/move management

Tracking facilities on smartphones generate enormous amounts of GPS trajectories, which provide new opportunities to study movement patterns and improve transportation planning. Converting GPS trajectories into semantically meaningful trips is attracting increasing research effort with respect to the development of algorithms, frameworks, and software tools. There are, however, few works focused on designing new semantic enrichment functionalities taking privacy into account. This article presents a raster‐based framework which not only detects significant stop locations, segments GPS records into stop/move structures, and brings semantic insights to trips, but also provides possibilities to anonymize users’ movements and sensitive stay/move locations into raster cells/regions so that a multi‐level data sharing structure is achieved for a variety of data sharing purposes.     

A time‐geographic approach to quantifying wildlife–road interactions

Recent advances in time geography offer new perspectives for studying animal movements and interactions in an environmental context. In particular, the ability to estimate an animal's spatial location probabilistically at temporal sampling intervals between known fix locations allows researchers to quantify how individuals interact with one another and their environment on finer temporal and spatial scales than previously explored. This article extends methods from time geography, specifically probabilistic space–time prisms, to quantify and summarize animal–road interactions toward understanding related diurnal movement behaviors, including road avoidance. The approach is demonstrated using tracking data for fishers (Martes pennanti) in New York State, where the total probability of interaction with roadways is calculated for individuals over the duration tracked. Additionally, a summarization method visualizing daily interaction probabilities at 60 s intervals is developed to assist in the examination of temporal patterns associated with fishers’ movement behavior with respect to roadways. The results identify spatial and temporal patterns of fisher–roadway interaction by time of day. Overall, the methodologies discussed offer an intuitive means to assess moving object location probabilities in the context of environmental factors. Implications for movement ecology and related conservation planning efforts are also discussed.     

车载组合导航数据处理方法研究

在运用组合导航技术进行车辆定位导航过程中,由于环境、导航设备等因素的干扰,导航数据中会包含有较大误差的野值数据,使得导航结果与实际车辆的行驶轨迹发生较大偏差,从而给人们的日常生活带来不便。一方面,错误的导航信息会给用户增加不必要的麻烦,影响智能交通系统的发展;另一方面也影响组合导航技术的应用和推广。为此,本文提出了对车辆低速和车辆停止时的定位数据进行剔除,利用粗差剔除和多项式拟合等方法对定位数据进行分析处理,提高导航定位的准确性。跑车试验证明该方法可以有效地提高定位精度,满足车载导航的需求。     

Detection of clusters in traffic networks based on spatio‐temporal flow modeling

Spatio‐temporal clustering is a highly active research topic and a challenging issue in spatio‐temporal data mining. Many spatio‐temporal clustering methods have been designed for geo‐referenced time series. Under some special circumstances, such as monitoring traffic flow on roads, existing methods cannot handle the temporally dynamic and spatially heterogeneous correlations among road segments when detecting clusters. Therefore, this article develops a spatio‐temporal flow‐based approach to detect clusters in traffic networks. First, a spatio‐temporal flow process is modeled by combining network topology relations with real‐time traffic status. On this basis, spatio‐temporal neighborhoods are captured by considering traffic time‐series similarity in spatio‐temporal flows. Spatio‐temporal clusters are further formed by successive connection of spatio‐temporal neighbors. Experiments on traffic time series of central London's road network on both weekdays and weekends are performed to demonstrate the effectiveness and practicality of the proposed method.     

Improved Priority‐Flood method for depression filling by redundant calculation optimization in local micro‐relief areas

Depression filling is a critical step in distributed hydrological modeling using digital elevation models (DEMs). The traditional Priority‐Flood (PF) approach is widely used due to its relatively high efficiency when dealing with a small‐sized DEM. However, it seems inadequate and inefficient when dealing with large high‐resolution DEMs. In this work, we examined the relationship between the PF algorithm calculation process and the topographical characteristics of depressions, and found significant redundant calculations in the local micro‐relief areas in the conventional PF algorithm. As such calculations require more time when dealing with large DEMs, we thus propose a new variant of the PF algorithm, wherein redundant points and calculations are recognized and eliminated based on the local micro‐relief water‐flow characteristics of the depression‐filling process. In addition, depressions and flatlands were optimally processed by a quick queue to improve the efficiency of the process. The proposed method was applied and validated in eight case areas using the Shuttle Radar Topography Mission digital elevation model (SRTM‐DEM) with 1 arc‐second resolution. These selected areas have different data sizes. A comparative analysis among the proposed method, the Wang and Liu‐based PF, the improved Barnes‐based PF, the improved Zhou‐based PF, and the Planchon and Darboux (P&D) algorithms was conducted to evaluate the accuracy and efficiency of the proposed algorithm. The results showed that the proposed algorithm is 43.2% (maximum) faster than Wang and Liu's variant of the PF method, with an average of 31.8%. In addition, the proposed algorithm achieved similar performance to the improved Zhou‐based PF algorithm, though our algorithm has the advantage of being simpler. The optimal strategies using the proposed algorithm can be employed in various landforms with high efficiency. The proposed method can also achieve good depression filling, even with large amounts of DEM data.     

Scale-oriented temporal analysis of movement data: A series-based approach

The ubiquity of movement data has led to new research interest in aspects of temporal scale. Few of the approaches analyzing movement data have been developed specifically for scale-oriented temporal analysis. To overcome this limitation, this article proposes a series-based approach to perform scale-oriented temporal analysis of movement data. Key to the proposed approach is the construction of four types of series (one type of identical-scale series and three types of cross-scale series) based on the continuous triangular model (CTM). Two distinct research goals are derived from this: to investigate the changes in motion attributes of moving individuals across different temporal scales, and to detect the time intervals during which active events might have occurred. The results based on real football movement data show that finer changes in motion attributes can be found and more accurate time intervals can be detected through the proposed approach.     

Polygonal Clustering Analysis Using Multilevel Graph‐Partition

Existing methods of spatial data clustering have focused on point data, whose similarity can be easily defined. Due to the complex shapes and alignments of polygons, the similarity between non‐overlapping polygons is important to cluster polygons. This study attempts to present an efficient method to discover clustering patterns of polygons by incorporating spatial cognition principles and multilevel graph partition. Based on spatial cognition on spatial similarity of polygons, four new similarity criteria (i.e. the distance, connectivity, size and shape) are developed to measure the similarity between polygons, and used to visually distinguish those polygons belonging to the same clusters from those to different clusters. The clustering method with multilevel graph‐partition first coarsens the graph of polygons at multiple levels, using the four defined similarities to find clusters with maximum similarity among polygons in the same clusters, then refines the obtained clusters by keeping minimum similarity between different clusters. The presented method is a general algorithm for discovering clustering patterns of polygons and can satisfy various demands by changing the weights of distance, connectivity, size and shape in spatial similarity. The presented method is tested by clustering residential areas and buildings, and the results demonstrate its usefulness and universality.     

Mapping hourly dynamics of urban population using trajectories reconstructed from mobile phone records

Understanding the spatiotemporal dynamics of urban population is crucial for addressing a wide range of urban planning and management issues. Aggregated geospatial big data have been widely used to quantitatively estimate population distribution at fine spatial scales over a given time period. However, it is still a challenge to estimate population density at a fine temporal resolution over a large geographical space, mainly due to the temporal asynchrony of population movement and the challenges to acquiring a complete individual movement record. In this article, we propose a method to estimate hourly population density by examining the time‐series individual trajectories, which were reconstructed from call detail records using BP neural networks. We first used BP neural networks to predict the positions of mobile phone users at an hourly interval and then estimated the hourly population density using log‐linear regression at the cell tower level. The estimated population density is linearly correlated with population census data at the sub‐district level. Trajectory clustering results show five distinct diurnal dynamic patterns of population movement in the study area, revealing spatially explicit characteristics of the diurnal commuting flows, though the driving forces of the flows need further investigation.     

Exploring Mobility Indoors: an Application of Sensor‐based and GIS Systems

The popularization of tracking devices, such as GPS, accelerometers and smartphones, have made it possible to detect, record, and analyze new patterns of human movement and behavior. However, employing GPS alone for indoor localization is not always possible due to the system's inability to determine location inside buildings or in places of signal occlusion. In this context, the application of local wireless networks for determining position is a promising alternative solution, although they still suffer from a number of limitations due to energy and IT‐resources. Our research outlines the potential for employing indoor wireless network positioning and sensor‐based systems to improve the collection of tracking data indoors. By applying various methods of GIScience we developed a methodology that can be applicable for diverse human indoor mobility analysis. To show the advantage of the proposed method, we present the result of an experiment that included mobility analysis of 37 participants. We tracked their movements on a university campus over the course of 41 days and demonstrated that their movement behavior can be successfully studied with our proposed method.     

Web‐based real‐time visualization of large‐scale weather radar data using 3D tiles

Weather radar data play an important role in meteorological analysis and forecasting. In particular, web‐based real‐time 3D visualization will enable and enhance various meteorological applications by avoiding the dissemination of a large amount of data over the internet. Despite that, most existing studies are either limited to 2D or small‐scale data analytics due to methodological limitations. This article proposes a new framework to enable web‐based real‐time 3D visualization of large‐scale weather radar data using 3D tiles and WebGIS technology. The 3D tiles technology is an open specification for online streaming massive heterogeneous 3D geospatial datasets, which is designed to improve rendering performance and reduce memory consumption. First, the weather radar data from multiple single‐radar sites across a large coverage area are organized into a spliced grid data (i.e., weather radar composing data, WRCD). Next, the WRCD is converted into a widely used 3D tile data structure in four steps: data preprocessing, data indexing, data transformation, and 3D tile generation. Last, to validate the feasibility of the proposed strategy, a prototype, namely Meteo3D at https://202.195.237.252:82 , is implemented to accommodate the WRCD collected from all the weather radar sites over the whole of China. The results show that near real‐time and accurate visualization for the monitoring and early warning of strong convective weather can be achieved.     

Remote Sensing Image On‐Demand Computing Schema for the China ZY‐3 Satellite Private Cloud‐Computing Platform

Time is a crucial factor for many remote sensing applications such as emergency response. The traditional approach requires users to spend a lot of time downloading, processing, and viewing satellite images with specialized software. Realizing interactive real‐time processing and visualization of satellite images online is our focus. This article presents an On‐Demand computing schema for remote sensing images. A processing chain model is proposed for satellite images on a private cloud computing platform designed for the China Centre for Resources Satellite Data and Application (CCRSDA). The architecture, processing flow, optimization method, fault tolerance, and user interface are described in detail. To test the efficiency and scalability of the platform, 11 processing chains were created and three load balance experiments were executed. The results from these experiments show the validity of the proposed methods and architecture.     

Time‐geographic Derivation of Feasible Co‐presence Opportunities from Network‐constrained Episodic Movement Data

Certain datasets on moving objects are episodic in nature – that is, the data is characterized by time gaps during which the position of the object is unknown. In this article, a model is developed to study the sparsely sampled network‐constrained movement of several objects by calculating both potential and feasible (i.e. more likely) co‐presence opportunities over time. The approach is applied to the context of a static sensor network, where the location of an object is only registered when passing a sensor location along a road network. Feasibility is incorporated based on the deviation from the shortest path. As an illustration, the model is applied to a large Bluetooth tracking dataset gathered at a mass event. The model output consists of maps showing the temporal evolution of the distribution of feasible co‐presence opportunities of tracked visitors over the network (i.e. the number of visitors that could have been present together). We demonstrate the model's usefulness in studying the movement and distribution of a crowd over a study area with relatively few sampling locations. Finally, we discuss the results with a special emphasis on the distinction between feasible and actual presence, the need for further validation and calibration, and the performance of the implementation.     

A Multi‐granularity Parallel Model for Unified Remote Sensing Image Processing WebServices

The growth of the Web has resulted in the Web‐based sharing of distributed geospatial data and computational resources. The Geospatial Processing Web (GeoPW) described here is a set of services that provide a wide array of geo‐processing utilities over the Web and make geo‐processing functionalities easily accessible to users. High‐performance remote sensing image processing is an important component of the GeoPW. The design and implementation of high‐performance image processing are, at present, an actively pursued research topic. Researchers have proposed various parallel strategies for single image processing algorithm, based on a computer science approach to parallel processing. This article proposes a multi‐granularity parallel model for various remote sensing image processing algorithms. This model has four hierarchical interfaces that are labeled the Region of Interest oriented (ROI‐oriented), Decompose/Merge, Hierarchical Task Chain and Dynamic Task interfaces or sub‐models. In addition, interfaces, definitions, parallel task scheduling and fault‐tolerance mechanisms are described in detail. Based on the model and methods, we propose an open‐source online platform named OpenRS‐Cloud. A number of parallel algorithms were uniformly and efficiently developed, thus certifying the validity of the multi‐granularity parallel model for unified remote sensing image processing web services.     

Quality of hybrid location data drawn from GPS‐enabled mobile phones: Does it matter?

Despite their increasing popularity in human mobility studies, few studies have investigated the geo‐spatial quality of GPS‐enabled mobile phone data in which phone location is determined by special queries designed to collect location data with predetermined sampling intervals (hereafter “active mobile phone data”). We focus on two key issues in active mobile phone data—systematic gaps in tracking records and positioning uncertainty—and investigate their effects on human mobility pattern analyses. To address gaps in records, we develop an imputation strategy that utilizes local environment information, such as parcel boundaries, and recording time intervals. We evaluate the performance of the proposed imputation strategy by comparing raw versus imputed data with participants’ online survey responses. The results indicate that imputed data are superior to raw data in identifying individuals’ frequently visited places on a weekly basis. To assess the location accuracy of active mobile phone data, we investigate the spatial and temporal patterns of the positional uncertainty of each record and examine via Monte Carlo simulation how inaccurate location information might affect human mobility pattern indicators. Results suggest that the level of uncertainty varies as a function of time of day and the type of land use at which the position was determined, both of which are closely related to the location technology used to determine the location. Our study highlights the importance of understanding and addressing limitations of mobile phone derived positioning data prior to their use in human mobility studies.