Digital Trails

The digital representation of trails is a relatively new concept. Only in the last decade, with increasing adoption and accuracy of GPS technology, have large quantities of reliable data become a reality. However, the development of algorithms specific to processing digital trails has not had much attention. This dissertation presents a set of methods for collecting, improving and processing digital trails, laying the ground work for the science of trails. We first present a solution to the GPS-network problem, which determines the salient trails and structure of a trail network from a set of GPS tracklogs. This method has received significant attention from the industry and online GPS sharing sites, since it provides the basis for forming a digital library of trails from user submitted GPS tracks. A set of tracks through a GPS trail network further presents the opportunity to model and understand trail user behavior. Trail user models are useful to land managers faced with difficult management decisions. We present the K-history model, a probabilistic method for understanding and simulating trail user decisions based on GPS data. We use the K-history model to evaluate current simulation techniques and show how optimizing the number of historical decisions can lead to better predictive power. With collections of GPS trail data we can begin to learn what trails look like in aerial images. We present a statistical learning approach for automatically extracting trail data from aerial imagery, using GPS data to train our model. While the problem of recognizing relatively straight and well defined roads has been well studied in the literature, the more difficult problem of extracting trails has received no attention. We extensively test our method on a 2,500 mile trail, showing promise for obtaining digital trail data without the use of GPS. These methods present further possibilities for the study of trails and trail user behavior, resulting in increased opportunity for the outdoors lover, and more informed management of our natural areas.

[1]  Gerhard Tutz,et al.  Local principal curves , 2005, Stat. Comput..

[2]  Dewang Chen,et al.  Adaptive Constraint K-Segment Principal Curves for Intelligent Transportation Systems , 2008, IEEE Transactions on Intelligent Transportation Systems.

[3]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[4]  Vladimir N. Vapnik,et al.  The Nature of Statistical Learning Theory , 2000, Statistics for Engineering and Information Science.

[5]  Thorsten Joachims,et al.  Learning to classify text using support vector machines - methods, theory and algorithms , 2002, The Kluwer international series in engineering and computer science.

[6]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[7]  Randy Gimblett,et al.  RBSim 2: Simulating the complex interactions between human movement and the outdoor recreation environment , 2003 .

[8]  Donald Geman,et al.  An Active Testing Model for Tracking Roads in Satellite Images , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  T. Hastie Principal Curves and Surfaces , 1984 .

[10]  Robert Wilensky,et al.  TilePic: a file format for tiled hierarchical data , 2001, JCDL '01.

[11]  Scott Morris,et al.  Finding trails , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[12]  Robert E. Manning,et al.  Visitor Experience and Resource Protection: A Framework for Managing the Carrying Capacity of National Parks , 2001 .

[13]  P. Forer Serial Experiences : Monitoring, Modelling and Visualising the Free Independent Traveller in New Zealand at Multiple Scales with GIS , 2002 .

[14]  Jitendra Malik,et al.  A computational model of texture segmentation , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[16]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[17]  Demetri Terzopoulos,et al.  Snakes: Active contour models , 2004, International Journal of Computer Vision.

[18]  I. Jolliffe Principal Component Analysis , 2002 .

[19]  Jim Gray,et al.  Microsoft TerraServer , 1998, SIGMOD 2000.

[20]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[21]  Pat Langley,et al.  An Analysis of Bayesian Classifiers , 1992, AAAI.

[22]  Josef Hoschek,et al.  Intrinsic parametrization for approximation , 1988, Comput. Aided Geom. Des..

[23]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  L. Rabiner,et al.  An introduction to hidden Markov models , 1986, IEEE ASSP Magazine.

[25]  David A. Forsyth,et al.  Matching Words and Pictures , 2003, J. Mach. Learn. Res..

[26]  H. R. Gimblett,et al.  RBSim: geographic simulation of wilderness recreation behavior. , 2001 .