Expand description
Log-space Viterbi algorithm for HMM-based map matching
Implements the Viterbi algorithm (Newson & Krumm, 2009) to decode the most probable sequence of netelements given a sequence of GNSS observations and per-position candidate sets with emission probabilities.
The algorithm operates in log-space to avoid numerical underflow on long sequences.
Structs§
- GapFill
- Record of a gap-fill action between two consecutive segments after sanity validation.
- Sanity
Decision - Decision record for a single consecutive-segment pair during sanity validation.
- Viterbi
Result - Result of the Viterbi decoding.
- Viterbi
Subsequence - A single unbroken Viterbi sub-sequence.
Functions§
- build_
path_ from_ viterbi - Convert Viterbi output into a sequence of
AssociatedNetElementsegments. - fill_
path_ gaps - Fill gaps left in the path after sanity validation.
- validate_
path_ navigability - Post-Viterbi navigability validation.
- viterbi_
decode - Decode the most probable netelement sequence using the Viterbi algorithm.