949 resultados para map-matching gps gps-traces openstreetmap past-choice-modeling
Resumo:
An object based image analysis approach (OBIA) was used to create a habitat map of the Lizard Reef. Briefly, georeferenced dive and snorkel photo-transect surveys were conducted at different locations surrounding Lizard Island, Australia. For the surveys, a snorkeler or diver swam over the bottom at a depth of 1-2m in the lagoon, One Tree Beach and Research Station areas, and 7m depth in Watson's Bay, while taking photos of the benthos at a set height using a standard digital camera and towing a surface float GPS which was logging its track every five seconds. The camera lens provided a 1.0 m x 1.0 m footprint, at 0.5 m height above the benthos. Horizontal distance between photos was estimated by fin kicks, and corresponded to a surface distance of approximately 2.0 - 4.0 m. Approximation of coordinates of each benthic photo was done based on the photo timestamp and GPS coordinate time stamp, using GPS Photo Link Software (www.geospatialexperts.com). Coordinates of each photo were interpolated by finding the gps coordinates that were logged at a set time before and after the photo was captured. Dominant benthic or substrate cover type was assigned to each photo by placing 24 points random over each image using the Coral Point Count excel program (Kohler and Gill, 2006). Each point was then assigned a dominant cover type using a benthic cover type classification scheme containing nine first-level categories - seagrass high (>=70%), seagrass moderate (40-70%), seagrass low (<= 30%), coral, reef matrix, algae, rubble, rock and sand. Benthic cover composition summaries of each photo were generated automatically in CPCe. The resulting benthic cover data for each photo was linked to GPS coordinates, saved as an ArcMap point shapefile, and projected to Universal Transverse Mercator WGS84 Zone 56 South. The OBIA class assignment followed a hierarchical assignment based on membership rules with levels for "reef", "geomorphic zone" and "benthic community" (above).
Resumo:
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Resumo:
This paper details a method of determining the uncertainty of dimensional measurement for a three dimensional coordinate measurement machine. An experimental procedure was developed to compare three dimensional coordinate measurements with calibrated reference points. The reference standard used to calibrate these reference points was a fringe counting interferometer with the multilateration technique employed to establish three dimensional coordinates. This is an extension of the established technique of comparing measured lengths with calibrated lengths. Specifically a distributed coordinate measurement device was tested which consisted of a network of Rotary-Laser Automatic Theodolites (R-LATs), this system is known commercially as indoor GPS (iGPS). The method was found to be practical and able to establish that the expanded uncertainty of the basic iGPS system was approximately 1 mm at a 95% confidence level. © Springer-Verlag Berlin Heidelberg 2010.
Resumo:
With the popularization of GPS-enabled devices such as mobile phones, location data are becoming available at an unprecedented scale. The locations may be collected from many different sources such as vehicles moving around a city, user check-ins in social networks, and geo-tagged micro-blogging photos or messages. Besides the longitude and latitude, each location record may also have a timestamp and additional information such as the name of the location. Time-ordered sequences of these locations form trajectories, which together contain useful high-level information about people's movement patterns.
The first part of this thesis focuses on a few geometric problems motivated by the matching and clustering of trajectories. We first give a new algorithm for computing a matching between a pair of curves under existing models such as dynamic time warping (DTW). The algorithm is more efficient than standard dynamic programming algorithms both theoretically and practically. We then propose a new matching model for trajectories that avoids the drawbacks of existing models. For trajectory clustering, we present an algorithm that computes clusters of subtrajectories, which correspond to common movement patterns. We also consider trajectories of check-ins, and propose a statistical generative model, which identifies check-in clusters as well as the transition patterns between the clusters.
The second part of the thesis considers the problem of covering shortest paths in a road network, motivated by an EV charging station placement problem. More specifically, a subset of vertices in the road network are selected to place charging stations so that every shortest path contains enough charging stations and can be traveled by an EV without draining the battery. We first introduce a general technique for the geometric set cover problem. This technique leads to near-linear-time approximation algorithms, which are the state-of-the-art algorithms for this problem in either running time or approximation ratio. We then use this technique to develop a near-linear-time algorithm for this
shortest-path cover problem.
Resumo:
Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Resumo:
En el siguiente artículo se evidenciaran las distancias totales recorridas por jugadores de rugby, las cuales se desprenden de datos empíricos (cuantificación de las mismas a través de GPS) de un total de veintiún (N=21)jugadores pertenecientes al grupo I de la URBA. Los datos recogidos nos indican que, independientemente de su puesto dentro de la cancha, los jugadores recorren en promedio 5115 metros por partido. Sin embargo, los datos de mayor importancia, como se verán, son los valores registrados específicamente por cada puesto de juego, ya queel mínimo valor de desplazamiento requerido para un jugadoren este deporte, es el que registran los pilares, de 4092 mts y el mayor valor alcanzado, se da para los puestos de loswings y el full back, donde recorren 5856 mts. El GPS además, nos da la posibilidad de contabilizar las distancias registradas a velocidades de desplazamiento >a los 18 km/h, donde aquí también cada puesto mostrara distintos valores, como se veráen diferentes cuadros. Debido a que ?los requerimientos físicos del rugby son bien diferentes y variados para cada jugador? (Delovo, 2013: 4) ¿resulta necesario diferenciar los entrenamientos para cada puesto específico de este deporte?
Resumo:
En el siguiente artículo se evidenciaran las distancias totales recorridas por jugadores de rugby, las cuales se desprenden de datos empíricos (cuantificación de las mismas a través de GPS) de un total de veintiún (N=21)jugadores pertenecientes al grupo I de la URBA. Los datos recogidos nos indican que, independientemente de su puesto dentro de la cancha, los jugadores recorren en promedio 5115 metros por partido. Sin embargo, los datos de mayor importancia, como se verán, son los valores registrados específicamente por cada puesto de juego, ya queel mínimo valor de desplazamiento requerido para un jugadoren este deporte, es el que registran los pilares, de 4092 mts y el mayor valor alcanzado, se da para los puestos de loswings y el full back, donde recorren 5856 mts. El GPS además, nos da la posibilidad de contabilizar las distancias registradas a velocidades de desplazamiento >a los 18 km/h, donde aquí también cada puesto mostrara distintos valores, como se veráen diferentes cuadros. Debido a que ?los requerimientos físicos del rugby son bien diferentes y variados para cada jugador? (Delovo, 2013: 4) ¿resulta necesario diferenciar los entrenamientos para cada puesto específico de este deporte?