Number of terms in maximization step for computing viterbi and posterior decoding?
up vote
0
down vote
favorite
I've been reading about viterbi and posterior decoding. And I understand that viterbi decoding is looking for an overall most likely explanation of the observed sequence:
whereas posterior tells us about the most likely state in some n-th step:
What I fail to understand is how many terms are there in the maximization for computing the viterbi decoding z^*. Are these k^2*N? And how many terms are there in the maximization for computing z_n^* i.e. the n-th state in a posterior decoding.
viterbi
add a comment |
up vote
0
down vote
favorite
I've been reading about viterbi and posterior decoding. And I understand that viterbi decoding is looking for an overall most likely explanation of the observed sequence:
whereas posterior tells us about the most likely state in some n-th step:
What I fail to understand is how many terms are there in the maximization for computing the viterbi decoding z^*. Are these k^2*N? And how many terms are there in the maximization for computing z_n^* i.e. the n-th state in a posterior decoding.
viterbi
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I've been reading about viterbi and posterior decoding. And I understand that viterbi decoding is looking for an overall most likely explanation of the observed sequence:
whereas posterior tells us about the most likely state in some n-th step:
What I fail to understand is how many terms are there in the maximization for computing the viterbi decoding z^*. Are these k^2*N? And how many terms are there in the maximization for computing z_n^* i.e. the n-th state in a posterior decoding.
viterbi
I've been reading about viterbi and posterior decoding. And I understand that viterbi decoding is looking for an overall most likely explanation of the observed sequence:
whereas posterior tells us about the most likely state in some n-th step:
What I fail to understand is how many terms are there in the maximization for computing the viterbi decoding z^*. Are these k^2*N? And how many terms are there in the maximization for computing z_n^* i.e. the n-th state in a posterior decoding.
viterbi
viterbi
asked Nov 10 at 23:24
Shafa Haider
468
468
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53244401%2fnumber-of-terms-in-maximization-step-for-computing-viterbi-and-posterior-decodin%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown