Arrow Research search

Author name cluster

John Krumm

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers
2 author rows

Possible papers

4

ICML Conference 2025 Conference Paper

Poly2Vec: Polymorphic Fourier-Based Encoding of Geospatial Objects for GeoAI Applications

  • Maria Despoina Siampou
  • Jialiang Li 0004
  • John Krumm
  • Cyrus Shahabi
  • Hua Lu 0001

Encoding geospatial objects is fundamental for geospatial artificial intelligence (GeoAI) applications, which leverage machine learning (ML) models to analyze spatial information. Common approaches transform each object into known formats, like image and text, for compatibility with ML models. However, this process often discards crucial spatial information, such as the object’s position relative to the entire space, reducing downstream task effectiveness. Alternative encoding methods that preserve some spatial properties are often devised for specific data objects (e. g. , point encoders), making them unsuitable for tasks that involve different data types (i. e. , points, polylines, and polygons). To this end, we propose Poly2Vec, a polymorphic Fourier-based encoding approach that unifies the representation of geospatial objects, while preserving the essential spatial properties. Poly2Vec incorporates a learned fusion module that adaptively integrates the magnitude and phase of the Fourier transform for different tasks and geometries. We evaluate Poly2Vec on five diverse tasks, organized into two categories. The first empirically demonstrates that Poly2Vec consistently outperforms object-specific baselines in preserving three key spatial relationships: topology, direction, and distance. The second shows that integrating Poly2Vec into a state-of-the-art GeoAI workflow improves the performance in two popular tasks: population prediction and land use inference.

AAAI Conference 2019 Conference Paper

Traffic Updates: Saying a Lot While Revealing a Little

  • John Krumm
  • Eric Horvitz

Taking speed reports from vehicles is a proven, inexpensive way to infer traffic conditions. However, due to concerns about privacy and bandwidth, not every vehicle occupant may want to transmit data about their location and speed in real time. We show how to drastically reduce the number of transmissions in two ways, both based on a Markov random field for modeling traffic speed and flow. First, we show that a only a small number of vehicles need to report from each location. We give a simple, probabilistic method that lets a group of vehicles decide on which subset will transmit a report, preserving privacy by coordinating without any communication. The second approach computes the potential value of any location’s speed report, emphasizing those reports that will most affect the overall speed inferences, and omitting those that contribute little value. Both methods significantly reduce the amount of communication necessary for accurate speed inferences on a road network.

AAAI Conference 2012 Conference Paper

Far Out: Predicting Long-Term Human Mobility

  • Adam Sadilek
  • John Krumm

Much work has been done on predicting where is one going to be in the immediate future, typically within the next hour. By contrast, we address the open problem of predicting human mobility far into the future, a scale of months and years. We propose an efficient nonparametric method that extracts significant and robust patterns in location data, learns their associations with contextual features (such as day of week), and subsequently leverages this information to predict the most likely location at any given time in the future. The entire process is formulated in a principled way as an eigendecomposition problem. Evaluation on a massive dataset with more than 32, 000 days worth of GPS data across 703 diverse subjects shows that our model predicts the correct location with high accuracy, even years into the future. This result opens a number of interesting avenues for future research and applications.

ICRA Conference 1997 Conference Paper

Vector quantized binary features for visual pose measurement

  • John Krumm

Visual pose measurement computes the translation and orientation of an object based on an image. The problem is made difficult by background clutter, partial occlusions, and illumination variations. This paper presents a solution to these problems with a new algorithm for planar, visual pose measurement based on compressed, binary subtemplates. For a given object, we take a sequence of training images as the object rotates. On each training image, we detect binary edges and pick binary edge subtemplates as features to model the object. These features are compressed using the Lloyd algorithm, a conventional image compression technique. We detect the object in an image using a Hough transform. We demonstrate the algorithm on images with background clutter, partial occlusions, and illumination variations.

v2026.09.13