Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,133,146 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.
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
Highly Cited
2006
Highly Cited
2006
Support Vector Machines for continuous speech recognition
Jaume Padrell-Sendra
,
Darío Martín-Iglesias
,
F. Díaz-de-María
European Signal Processing Conference
2006
Corpus ID: 11082657
Although Support Vector Machines (SVMs) have been proved to be very powerful classifiers, they still have some problems which…
Expand
2006
2006
F0 Estimation Method for Singing Voice in Polyphonic Audio Signal Based on Statistical Vocal Model and Viterbi Search
Hiromasa Fujihara
,
Tetsuro Kitahara
,
Masataka Goto
,
Kazunori Komatani
,
T. Ogata
,
HIroshi G. Okuno
IEEE International Conference on Acoustics Speech…
2006
Corpus ID: 6350643
This paper describes a method for estimating F0s of vocal from polyphonic audio signals. Because melody is sung by a singer in…
Expand
Highly Cited
2004
Highly Cited
2004
A Stochastic Approach to Tracking Objects Across Multiple Cameras
A. Dick
,
M. Brooks
Australian Conference on Artificial Intelligence
2004
Corpus ID: 16031535
This paper is about tracking people in real-time as they move through the non-overlapping fields of view of multiple video…
Expand
2003
2003
HMM-based channel error mitigation and its application to distributed speech recognition
A. Peinado
,
V. Sánchez
,
J. L. Pérez-Córdoba
,
Á. D. L. Torre
Speech Communication
2003
Corpus ID: 2833796
Highly Cited
1999
Highly Cited
1999
Machine Vision and Applications c ○ Springer-Verlag 2001 A model-based hand gesture recognition system
1999
Corpus ID: 15714523
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
Highly Cited
1997
Highly Cited
1997
Reduced-complexity detection and phase synchronization of CPM signals
G. Colavolpe
,
R. Raheli
International Conference on Communications
1997
Corpus ID: 3116776
Based on an extension of Laurent (1986) decomposition of continuous phase modulation (CPM) signals into a sum of linearly…
Expand
Highly Cited
1993
Highly Cited
1993
Word spotting in scanned images using hidden Markov models
Francine R. Chen
,
L. Wilcox
,
D. Bloomberg
IEEE International Conference on Acoustics…
1993
Corpus ID: 57575108
A hidden-Markov-model (HMM)-based system for font-independent spotting of user-specified keywords in a scanned image is described…
Expand
1988
1988
Extended Viterbi algorithm for second order hidden Markov process
Yang He
[ Proceedings] 9th International Conference on…
1988
Corpus ID: 29381465
An extended Viterbi algorithm is presented that gives a maximum a posteriori estimation of the second-order hidden Markov process…
Expand
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)
ACCEPT & CONTINUE