Towards trajectory anonymization: a generalization-based approach

Trajectory datasets are becoming popular due to the massive usage of GPS and locationbased services. In this paper, we address privacy issues regarding the identification of individuals in static trajectory datasets. We first adopt the notion of k-anonymity to trajectories and propose a novel generalization-based approach for anonymization of trajectories. We further show that releasing anonymized trajectories may still have some privacy leaks. Therefore we propose a randomization based reconstruction algorithm for releasing anonymized trajectory data and also present how the underlying techniques can be adapted to other anonymity standards. The experimental results on real and synthetic trajectory datasets show the effectiveness of the proposed techniques

Time indeterminacy and spatio-temporal building transformations: an approach for architectural heritage understanding

Nowadays most digital reconstructions in architecture and archeology describe buildings heritage as awhole of static and unchangeable entities. However, historical sites can have a rich and complex history, sometimes full of evolutions, sometimes only partially known by means of documentary sources. Various aspects condition the analysis and the interpretation of cultural heritage. First of all, buildings are not inexorably constant in time: creation, destruction, union, division, annexation, partial demolition and change of function are the transformations that buildings can undergo over time. Moreover, other factors sometimes contradictory can condition the knowledge about an historical site, such as historical sources and uncertainty. On one hand, historical documentation concerning past states can be heterogeneous, dubious, incomplete and even contradictory. On the other hand, uncertainty is prevalent in cultural heritage in various forms: sometimes it is impossible to define the dating period, sometimes the building original shape or yet its spatial position. This paper proposes amodeling approach of the geometrical representation of buildings, taking into account the kind of transformations and the notion of temporal indetermination

Efficient MaxCount and threshold operators of moving objects

Calculating operators of continuously moving objects presents some unique challenges, especially when the operators involve aggregation or the concept of congestion, which happens when the number of moving objects in a changing or dynamic query space exceeds some threshold value. This paper presents the following six d-dimensional moving object operators: (1) MaxCount (or MinCount), which finds the Maximum (or Minimum) number of moving objects simultaneously present in the dynamic query space at any time during the query time interval. (2) CountRange, which finds a count of point objects whose trajectories intersect the dynamic query space during the query time interval. (3) ThresholdRange, which finds the set of time intervals during which the dynamic query space is congested. (4) ThresholdSum, which finds the total length of all the time intervals during which the dynamic query space is congested. (5) ThresholdCount, which finds the number of disjoint time intervals during which the dynamic query space is congested. And (6) ThresholdAverage, which finds the average length of time of all the time intervals when the dynamic query space is congested. For these operators separate algorithms are given to find only estimate or only precise values. Experimental results from more than 7,500 queries indicate that the estimation algorithms produce fast, efficient results with error under 5%