Data Matrix Code Location Based on Finder Pattern Detection and Bar Code Border Fitting

Algorithm 1

For each 𝑙_𝑖(𝑖=1∶𝑛)

  If 𝑙_𝑖 is not marked

    Search in 𝐷_𝑝𝑖1 and 𝐷_𝑝𝑖2 to find 𝑙_𝑗; // 𝐷_𝑝𝑖1 and 𝐷_𝑝𝑖2 are Neighborhoods of 𝑝_𝑖1 and 𝑝_𝑖2.

    If 𝑙_𝑗 is not marked && 60^∘<angle(𝑙_𝑖,𝑙_𝑗)<120^∘

     && max{len(𝑙_𝑖),len(𝑙_𝑗)}/min{len(𝑙_𝑖),len(𝑙_𝑗)}<5 // len(𝑙_𝑖) and len(𝑙_𝑗) are the

lengths of 𝑙_𝑖 and 𝑙_𝑗

     Combine 𝑙_𝑖 and 𝑙_𝑗 into an “L”;

     Mark 𝑙_𝑖 and 𝑙_𝑗;

    End

  End

End