▁:= ▁mark ▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁ ▁ ▁end ▁while ▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁▁ ▁ ▁mark ▁:= ▁mark ▁+ ▁difference ▁▁▁▁▁▁▁▁▁▁▁▁▁ ▁end ▁if ▁▁▁▁▁▁▁▁ ▁end ▁for ▁▁▁▁ ▁end ▁for ▁ ▁The ▁run ▁time ▁of ▁the ▁algorithm ▁depends ▁on ▁the ▁size ▁of ▁the ▁image ▁and ▁the ▁amount ▁of ▁for eground . ▁The ▁time ▁complexity ▁is ▁compar able ▁to ▁the ▁two ▁pass ▁algorithm ▁if ▁the ▁for eground ▁covers ▁a ▁significant ▁part ▁of ▁the ▁image . ▁Otherwise ▁the ▁time ▁complexity ▁is ▁lower . ▁However , ▁memory ▁access ▁is ▁less ▁struct ured ▁than ▁for ▁the ▁two - pass ▁algorithm , ▁which ▁tends ▁to ▁increase ▁the ▁run ▁time ▁in ▁practice . ▁ ▁Performance ▁evaluation ▁In ▁the ▁last ▁two ▁dec ades ▁many ▁novel ▁approaches ▁on ▁connected - component ▁label ing ▁have ▁been ▁proposed ▁and ▁almost ▁none ▁of ▁them ▁was ▁compared ▁on ▁the ▁same ▁data . ▁Y AC CL AB ▁ ▁( ac ron ym ▁for ▁Yet ▁Another ▁Con ne cted ▁Com ponents ▁Label ing ▁Ben chmark ) ▁is ▁an ▁example ▁of ▁C ++ ▁open ▁source ▁framework ▁which ▁collect s , ▁runs , ▁and ▁tests ▁connected - component ▁label ing ▁algorithms . ▁ ▁Hard ware ▁architect ures ▁The ▁emer gence ▁of ▁F PG As ▁with ▁enough ▁capacity ▁to ▁perform ▁complex ▁image ▁processing ▁tasks ▁also ▁led ▁to ▁high - per formance ▁architect ures ▁for ▁connected - component ▁label ing . ▁Most ▁of ▁these ▁architect ures ▁util ize ▁the ▁single ▁pass ▁variant ▁of ▁this ▁algorithm , ▁because ▁of ▁the ▁limited ▁memory ▁resources ▁available ▁on ▁an ▁F P GA . ▁These ▁types ▁of ▁connected ▁component ▁label ing ▁architect ures ▁are