| Algorithm 3 The Proposed Algorithm |
Begin
1. Provisional label = 1;
2. for(y = 0; y<=H; y+=2) // begin the first-scan method
3. for(x = 0; x<=W; x+=2) {
4. Procedure1;
5. while(keepinprocedure2==true&&x+2<W) {
6. x+=2;
7. Procedure2;
8. }
9. }
10. Update provisional labels to representative labels in the second-scan method;
end
|