Skip to main content

Table 1 Bar code mapping and differential amplification transformation

From: An improved algorithm based on Bloom filter and its application in bar code recognition and processing

a

Value of a

Hash value(hi : X → {1. . m1})

a 1

x1x2x3x4x5x6x7x8x9

h 1 (a 1 ), h 2 (a 1 ), …,h j (a 1 ),... ,h k (a 1 )

a 2

y1y2y3y4y5y6y7y8y9

h 1 (a 2 ), h 2 (a 2 ), …,h j (a 2 ),... ,h k (a 2 )

a 3

z1z2z3z4z5z6z7z8z9

h 1 (a 3 ), h 2 (a 3 ), …,h j (a 3 ),... ,h k (a 3 )

a 4

u1u2u3u4u5u6u7u8u9

h 1 (a 4 ), h 2 (a 4 ), …,h j (a 4 ),... ,h k (a 4 )

a 5

v1v2v3v4v5v6v7v8v9

h 1 (a 5 ), h 2 (a 5 ), …,h j (a 5 ),... ,h k (a 5 )

  1. Element value is the bar code. A certain rule can be followed to amplify the differences between elements.By the k hash functions {h1, h2, ……, hk} to obtain the k bits are stored in {1 .. m1} the corresponding position