Binary Vision

More documents

Recommendations

Info

5.3 Counting objects -- method 2Recursive_connected_components (B, LB) {LB := negate (B);Label := 0;Find_components (LB, label);Print (LB);}Find_components (LB, label) {for L:= 0 to MaxRow - 1for P:= 0 to MaxCol - 1if LB[L,P] == -1 then {label := label + 1;search (LB, label, L, P);}}search (LB, label, L, P) {LB[L,P] := label;Nset := neighbors (L, P);For each [L’, P’] in Nset {If LB[L’, P’] == -1 then search (LB, label, L’, P’);}}1 0 0 0 0 0 0 0 0 0 01 1 0 0 0 1 1 1 0 0 00 0 0 0 0 1 0 1 0 1 10 0 0 0 0 1 0 1 0 0 00 0 1 1 0 1 1 1 0 0 00 1 0 1 0 1 0 1 0 0 00 0 0 1 0 0 0 0 0 0 00 0 0 0 0 0 0 0 0 1 0
5.3 Counting objects -- method 2Recursive_connected_components (B, LB) {LB := negate (B);Label := 0;Find_components (LB, label);Print (LB);}-1 0 0 0 0 0 0 0 0 0 0-1 -1 0 0 0 -1 -1 -1 0 0 0Find_components (LB, label) {0 0 0 0 0 -1 0 -1 0 -1 -1for L:= 0 to MaxRow - 1for P:= 0 to MaxCol - 10 0 0 0 0 -1 0 -1 0 0 0if LB[L,P] == -1 then {label := label + 1;0 0 -1 -1 0 -1 -1 -1 0 0 0search (LB, label, L, P);}}search (LB, label, L, P) {LB[L,P] := label;Nset := neighbors (L, P);For each [L’, P’] in Nset {000-100000-1-10000-100000-10000000-1000If LB[L’, P’] == -1 then search (LB, label, L’, P’);}}
Page 1: Chapter 5 Binary Vision5.1 Binary I
Page 4 and 5: 5.2 MaskApplying a mask to an image
Page 6 and 7: 5.3 Counting objectsApplications: E
Page 8 and 9: 5.3 Counting objects -- method 1Com
Page 10 and 11: 5.3 Counting objects -- method 2Con
Page 12 and 13: 5.3 Counting objects -- method 2A R
Page 16 and 17: 5.3 Counting objects -- method 2Rec
Page 22 and 23: 5.3 Counting objects -- method 3Cla
Page 34 and 35: 5.4 Binary MorphologyFunction: Extr

Binary Vision

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?