Skip to search formSkip to main contentSkip to account menu

Viterbi algorithm

Known as: Viterbi path, Vitterbi algorithm, Viterbi search 
The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
ARC (processor)AlgorithmBaum–Welch algorithmBayesian programming

Broader (2)

Dynamic programmingError detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Robust multimedia watermarking: Hidden Markov model approach for video sequences
Because of the large amount of frames, similarity between frames and temporal attacks (frame dropping, frame averaging, frame… 
Highly Cited
2006
Highly Cited
2006
Automatic Synchronization between Lyrics and Music CD Recordings Based on Viterbi Alignment of Segregated Vocal Signals
This paper describes a system that can automatically synchronize between polyphonic musical audio signals and corresponding… 
2003
2003
Maximum likelihood endpoint detection with time-domain features
In this paper we propose an effective, robust and computationally low-cost HMM-based start-endpoint detector for speech… 
2001
2001
Forward error correction codes to reduce intercarrier interference in OFDM
Orthogonal Frequency Division Multiplexing (OFDM) is sensitive to the carrier frequency offset (CFO), which destroys… 
Highly Cited
1999
Highly Cited
1999
Iterative Posterior-Based Keyword Spotting Without Filler Models
Keywords: speech Reference EPFL-CONF-82544 Record created on 2006-03-10, modified on 2017-05-12 
1999
1999
INDEPENDENT AUTOMATIC SEGMENTATION OF SPEECH BY PRONUNCIATION MODELING
In this paper we present an iterative automatic segmentation system which does not require any domain dependent training data… 
1995
1995
A lower-complexity Viterbi algorithm
In continuous speech recognition, when using statistical language models (e.g. bigrams) a significant amount of time is used… 
1991
1991
Two extensions of the Viterbi algorithm
The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM… 
1989
1989
Speaker-independent recognition of connected utterances using recurrent and non-recurrent neural networks
Connectionist learning procedures are applied to the task of speaker-independent continuous speech recognition, creating a system… 
1980
1980
Asymptotically catastrophic convolutional codes
The minimum distance growth rate of unmerged codewords in a convolutional code is shown to depend upon the minimum average weight… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)