Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,830,548 papers from all fields of science
Search
Sign In
Create Free Account
Viterbi algorithm
Known as:
Viterbi path
, Vitterbi algorithm
, Viterbi search
Expand
The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
ARC (processor)
Algorithm
Baum–Welch algorithm
Bayesian programming
Expand
Broader (2)
Dynamic programming
Error 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
E. Elbasi
Turkish Journal of Electrical Engineering and…
2010
Corpus ID: 5869609
Because of the large amount of frames, similarity between frames and temporal attacks (frame dropping, frame averaging, frame…
Expand
Highly Cited
2006
Highly Cited
2006
Automatic Synchronization between Lyrics and Music CD Recordings Based on Viterbi Alignment of Segregated Vocal Signals
Hiromasa Fujihara
,
Masataka Goto
,
J. Ogata
,
Kazunori Komatani
,
T. Ogata
,
Hiroshi G. Okuno
IEEE International Symposium on Multimedia
2006
Corpus ID: 17445483
This paper describes a system that can automatically synchronize between polyphonic musical audio signals and corresponding…
Expand
2003
2003
Maximum likelihood endpoint detection with time-domain features
M. Orlandi
,
A. Santarelli
,
D. Falavigna
Interspeech
2003
Corpus ID: 14083964
In this paper we propose an effective, robust and computationally low-cost HMM-based start-endpoint detector for speech…
Expand
2001
2001
Forward error correction codes to reduce intercarrier interference in OFDM
K. Sathananthan
,
C. Tellambura
ISCAS . The IEEE International Symposium on…
2001
Corpus ID: 12552129
Orthogonal Frequency Division Multiplexing (OFDM) is sensitive to the carrier frequency offset (CFO), which destroys…
Expand
Highly Cited
1999
Highly Cited
1999
Iterative Posterior-Based Keyword Spotting Without Filler Models
M. Silaghi
,
H. Bourlard
1999
Corpus ID: 13948911
Keywords: speech Reference EPFL-CONF-82544 Record created on 2006-03-10, modified on 2017-05-12
1996
1996
Comparison Between the Inside-Outside Algorithm and the Viterbi Algorithm for Stochastic Context-Free Grammars
Joan Andreu Sánchez
,
J. Benedí
,
F. Casacuberta
SSPR
1996
Corpus ID: 14923465
The most popular algorithms for the estimation of the probabilities of a context-free grammar are the Inside-Outside algorithm…
Expand
1995
1995
On the performance of sequential and Viterbi decoders for high-rate punctured convolutional codes
K. Muhammad
,
K. Letaief
IEEE Transactions on Communications
1995
Corpus ID: 837815
This paper presents new computationally efficient and accurate techniques for estimating the performance of specific high-rate…
Expand
1995
1995
A lower-complexity Viterbi algorithm
Sarvar Patel
IEEE International Conference on Acoustics…
1995
Corpus ID: 5396141
In continuous speech recognition, when using statistical language models (e.g. bigrams) a significant amount of time is used…
Expand
1991
1991
Two extensions of the Viterbi algorithm
A. Bouloutas
,
G. Hart
,
M. Schwartz
IEEE Transactions on Information Theory
1991
Corpus ID: 29207980
The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM…
Expand
1980
1980
Asymptotically catastrophic convolutional codes
F. Hemmati
,
D. Costello
IEEE Transactions on Information Theory
1980
Corpus ID: 7540248
The minimum distance growth rate of unmerged codewords in a convolutional code is shown to depend upon the minimum average weight…
Expand