With the advent of ubiquitous computing, we can easily acquire the locations of moving objects. This paper studies the clustering problem for trajectory data which are constrained by the road network. While many trajectory clustering algorithms have been proposed, they do not consider the spatial proximity over the road network. For such trajectory data, we propose a new distance measure that r...

vi Εκτεταμένη Περίληψη viii

BACKGROUND Pedestrian injuries among older people tend to occur near their residence. However, knowledge regarding whether distance travelled from home to the injury site or road environmental/socioeconomic factors affect injury severity remains limited. METHODS A cross-sectional study was performed using injury registry data from the Kurume City Fire Department, Japan. Distance travelled fro...

INTRODUCTION Access to radiation therapy (RT) underlies optimal care for prostate and breast cancer patients. This study investigates the impact of opening a new RT clinic on distance and road travel time to RT, and overall utilisation for prostate and breast cancer patients over a 3-year period in North Queensland (NQ), Australia. METHODS The study used retrospective audit of two radiotherap...

Traffic load and transported quantity due to forest management were analysed on the forest roads in the forest district Dragatu{, SE Slovenia. On the basis of timber gravitating to particular sections, the traffic load and transported quantity were calculated for each of seven forest road sections. The cumulative traffic load is the highest on the section connected to the public road and the lo...

In this paper, we propose a method for recognition of road markings from in-vehicle camera images. A road marking in in-vehicle camera images has a variety of appearance due to the change of position and distance between the camera and the road marking, blur effect, and so on. Therefore, accurate recognition of road markings becomes difficult in real environment. Our method generates numerous l...

Computing shortest distances is one of the fundamental problems on graphs, and remains a challenging task today. Distance landmarks have been recently studied for shortest distance queries with an auxiliary data structure, referred to as landmark covers. This paper studies how to apply distance landmarks for fast exact shortest distance query answering on large road graphs. However, the direct ...

Cluster analysis is a fundamental challenge in trajectory mining. However, existing trajectory clustering algorithms are not well suited to large numbers of trajectories in a city road network because of inadequate distance measures between two trajectories. In this paper we propose a novel Dijkstra based Dynamic Time Warping (DTW) distance measure, trajDTW between two trajectories, which is su...

This paper describes a navigation method based on road detection using both a laser scanner and a vision sensor. The method is to classify the surface in front of the robot into traversable segments (road) and obstacles using the laser scanner, this classifies the area just in front of the robot (2.5m). The front looking camera is used to classify the road from this distance and forward, taking...