Bart Kuijpers

Prof. Dr. Bart Kuijpers

Hasselt University, Data Science Institute and Database and Theoretical Computer Science Group, Agoralaan, Gebouw D, 3590 Diepenbeek, Belgium
orcid

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 March 2008
Verified
Conference Paper
Open access
APAndrey Tietbohl Palma
Andrey Tietbohl Palma
VBVania Bogorny
Vania Bogorny
BKBart Kuijpers
Bart Kuijpers
LALuis Otavio Alvares
Luis Otavio Alvares

7 November 2007
Verified
Conference Paper
Open access
PDF file
LALuis Otavio Alvares
Luis Otavio Alvares
VBVania Bogorny
Vania Bogorny
BKBart Kuijpers
Bart Kuijpers
JMJose Antonio Fernandes de Macedo
Jose Antonio Fernandes de Macedo
BMBart Moelans
Bart Moelans
AVAlejandro Vaisman
Alejandro Vaisman

7 September 2009 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
BKBart Kuijpers
Bart Kuijpers
WOWalied Othman
Walied Othman
Moving objects produce trajectories, which are typically observed in a finite sample of time‐stamped locations. Between sample points, we are uncertain about the moving objects's location. When we assume extra information about an object, for instance, a (possibly location‐dependent) speed limit, we can use space–time prisms to model the uncertainty of an object's location. Until now, space–time prisms have been studied for unconstrained movement in the 2D plane. In this paper, we study space–time prisms for objects that are constrained to travel on a road network. Movement on a road network can be viewed as essentially one‐dimensional. We describe the geometry of a space–time prism on a road network and give an algorithm to compute and visualize space–time prisms. For experiments and illustration, we have implemented this algorithm in MATHEMATICA. Furthermore, we study the alibi query, which asks whether two moving objects could have possibly met or not. This comes down to deciding if the chains of space–time prisms produced by these moving objects intersect. We give an efficient algorithm to answer the alibi query for moving objects on a road network. This algorithm also determines where and when two moving objects may have met.

16 June 2010 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
BKBart Kuijpers
Bart Kuijpers
HMHarvey J. Miller
Harvey J. Miller
TNTijs Neutens
Tijs Neutens
WOWalied Othman
Walied Othman
Space-time prisms capture all possible locations of a moving person or object between two known locations and times given the maximum travel velocities in the environment. These known locations or ‘anchor points’ can represent observed locations or mandatory locations because of scheduling constraints. The classic space-time prism as well as more recent analytical and computational versions in planar space and networks assume that these anchor points are perfectly known or fixed. In reality, observations of anchor points can have error, or the scheduling constraints may have some degree of pliability. This article generalizes the concept of anchor points to anchor regions: these are bounded, possibly disconnected, subsets of space-time containing all possible locations for the anchor points, with each location labelled with an anchor probability. We develop two algorithms for calculating network-based space-time prisms based on these probabilistic anchor regions. The first algorithm calculates the envelope of all space-time prisms having an anchor point within a particular anchor region. The second algorithm calculates, for any space-time point, the probability that a space-time prism with given anchor regions contains that particular point. Both algorithms are implemented in Mathematica to visualize travel possibilities in case the anchor points of a space-time prism are uncertain. We also discuss the complexity of the procedures, their use in analysing uncertainty or flexibility in network-based prisms and future research directions.

23 September 2009 in International Journal of Geographical Information Science
Verified
Journal Article
Closed access
VBVania Bogorny
Vania Bogorny
BKBart Kuijpers
Bart Kuijpers
LALuis Otavio Alvares
Luis Otavio Alvares
Mobile devices are becoming very popular in recent years, and large amounts of trajectory data are generated by these devices. Trajectories left behind cars, humans, birds or other objects are a new kind of data which can be very useful in the decision making process in several application domains. These data, however, are normally available as sample points, and therefore have very little or no semantics. The analysis and knowledge extraction from trajectory sample points is very difficult from the user's point of view, and there is an emerging need for new data models, manipulation techniques, and tools to extract meaningful patterns from these data. In this paper we propose a new methodology for knowledge discovery from trajectories. We propose through a semantic trajectory data mining query language several functionalities to select, preprocess, and transform trajectory sample points into semantic trajectories at higher abstraction levels, in order to allow the user to extract meaningful, understandable, and useful patterns from trajectories. We claim that meaningful patterns can only be extracted from trajectories if the background geographical information is considered. Therefore we build the proposed methodology considering both moving object data and geographic information. The proposed language has been implemented in a toolkit in order to provide a first software prototype for trajectory knowledge discovery.

1 November 2010 in Journal of Computer and System Sciences
Verified
Journal Article
Closed access
BKBart Kuijpers
Bart Kuijpers
WOWalied Othman
Walied Othman