one stage

Recognition 1. 不知道有幾個字

2. 不知道 ( 答案 ) 是那些字

考慮所有情況 (411+1+1)

bre

sil

syll

syll

.

.

.

syll ........

bre

sil

syll

bre

sil

syll

Intra-syllable

Inter-syllable

bre

sil ....

bre

syll

....

bre

syll

....

bre

sil

syll

....

bre

sil

syll

State 的情形

.

.

.

.

.

.

.

.

.

.

.

frame

model

. . . . .

start end

.

.

.

.

.

.

frame 對 model 的所有情況

One-stage 的方法 :

對所有的 states(411*8+1+3) 做三件事 :

(1) 找出最佳路徑

(2) 記錄最佳路徑 (backtrace)

(3) 累加 likehood

1. 第一個 state 從 (411+1+1) 條路徑中選最好的 (top_one search)

2. 其他 state 就自已、前一個

Begin

Allocate• L, LL(likelihood)• BK, BBK(for back trace)• D, DD(state duration)

Initialization (t=0)• observation prob(t=0)• disable all models (D=0)• enable first state of all syllable and silence , breath• top_likelihood • Top_model• FM[0] = MODEL-2(for back trace )• FF[0] = -1(for time )

Switch buffer• L,LL• BK,BBK• D,DD

Disable all models• D = 0

Top_one_search• for 411 syllable , silence ,breath

• update top_likelihood• update top_model

t

1

1

t>Nframe

1

1

2

2

Find optimal path• back trace to find recognized text and segment position

end

411 model

411 model Initial • state 0(first)self

top_model

• other statesself

last state

411 model final• state 3self

last state of initial

• other statesself

last state

411 modelBreathe model• state 0self

top_model

• other statesself

last state

silence model• state 0self

top_mode

One_stage的程式流程