483,435 research outputs found
Transformer-based Map Matching Model with Limited Ground-Truth Data using Transfer-Learning Approach
In many spatial trajectory-based applications, it is necessary to map raw
trajectory data points onto road networks in digital maps, which is commonly
referred to as a map-matching process. While most previous map-matching methods
have focused on using rule-based algorithms to deal with the map-matching
problems, in this paper, we consider the map-matching task from the data-driven
perspective, proposing a deep learning-based map-matching model. We build a
Transformer-based map-matching model with a transfer learning approach. We
generate trajectory data to pre-train the Transformer model and then fine-tune
the model with a limited number of ground-truth data to minimize the model
development cost and reduce the real-to-virtual gap. Three metrics (Average
Hamming Distance, F-score, and BLEU) at two levels (point and segment level)
are used to evaluate the model performance. The results indicate that the
proposed model outperforms existing models. Furthermore, we use the attention
weights of the Transformer to plot the map-matching process and find how the
model matches the road segments correctly.Comment: 25 pages, 9 figures, 4 table
3D Simulation with virtual stereo rig for optimizing centrifugal fertilizer spreading
Stereovision can be used to characterize of the fertilizer centrifugal spreading process and to control the spreading fertilizer distribution pattern on the ground reference. Fertilizer grains, however, resemble each other and the grain images contain little information on texture. Therefore, the accuracy of stereo matching algorithms in literature cannot be used as a reference for stereo images of fertilizer grains.
In order to evaluate stereo matching algorithms applied to images of grains a generator of synthetic stereo particle images is presented in this paper. The particle stereo image generator consists of two main parts: the particle 3D position generator and the virtual stereo rig. The particle 3D position generator uses a simple ballistic flight model and the disc characteristics to simulate the ejection and the displacement of grains. The virtual stereo rig simUlates the stereo acquisition system and generates stereo images, a disparity map and an occlusion map. The results are satisfying and present an accurate reference to evaluate stereo particles matching algorithms
Bayesian graph edit distance
This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate matches using MAP label updates. We compare the resulting graph-matching algorithm with that recently reported by Wilson and Hancock. The use of edit-distance offers an elegant alternative to the exhaustive compilation of label dictionaries. Moreover, the method is polynomial rather than exponential in its worst-case complexity. We support our approach with an experimental study on synthetic data and illustrate its effectiveness on an uncalibrated stereo correspondence problem. This demonstrates experimentally that the gain in efficiency is not at the expense of quality of match
Interpretable and Generalizable Person Re-Identification with Query-Adaptive Convolution and Temporal Lifting
For person re-identification, existing deep networks often focus on
representation learning. However, without transfer learning, the learned model
is fixed as is, which is not adaptable for handling various unseen scenarios.
In this paper, beyond representation learning, we consider how to formulate
person image matching directly in deep feature maps. We treat image matching as
finding local correspondences in feature maps, and construct query-adaptive
convolution kernels on the fly to achieve local matching. In this way, the
matching process and results are interpretable, and this explicit matching is
more generalizable than representation features to unseen scenarios, such as
unknown misalignments, pose or viewpoint changes. To facilitate end-to-end
training of this architecture, we further build a class memory module to cache
feature maps of the most recent samples of each class, so as to compute image
matching losses for metric learning. Through direct cross-dataset evaluation,
the proposed Query-Adaptive Convolution (QAConv) method gains large
improvements over popular learning methods (about 10%+ mAP), and achieves
comparable results to many transfer learning methods. Besides, a model-free
temporal cooccurrence based score weighting method called TLift is proposed,
which improves the performance to a further extent, achieving state-of-the-art
results in cross-dataset person re-identification. Code is available at
https://github.com/ShengcaiLiao/QAConv.Comment: This is the ECCV 2020 version, including the appendi
The path inference filter: model-based low-latency map matching of probe vehicle data
We consider the problem of reconstructing vehicle trajectories from sparse
sequences of GPS points, for which the sampling interval is between 10 seconds
and 2 minutes. We introduce a new class of algorithms, called altogether path
inference filter (PIF), that maps GPS data in real time, for a variety of
trade-offs and scenarios, and with a high throughput. Numerous prior approaches
in map-matching can be shown to be special cases of the path inference filter
presented in this article. We present an efficient procedure for automatically
training the filter on new data, with or without ground truth observations. The
framework is evaluated on a large San Francisco taxi dataset and is shown to
improve upon the current state of the art. This filter also provides insights
about driving patterns of drivers. The path inference filter has been deployed
at an industrial scale inside the Mobile Millennium traffic information system,
and is used to map fleets of data in San Francisco, Sacramento, Stockholm and
Porto.Comment: Preprint, 23 pages and 23 figure
- …