Skip to main content
EURASIP Journal on Image and Video Processing

Table 2 Mapping after transformation

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

a*i = g (ai)

Value of a*

Hash value(fj : X∗ → {m1. . m})

a * 1

X1X2X3X4X5X6X7X8X9

f 1 ( a * 1 ), f 2 ( a * 1 ), …,f j ( a * 1 ),... ,f d ( a * 1 )

a * 2

Y1Y2Y3Y4Y5Y6Y7Y8Y9

f 1 ( a * 2 ), f 2 ( a * 2 ), …,f j ( a * 2 ),... ,f d ( a * 2 )

a * 3

Z1Z2Z3Z4Z5Z6Z7Z8Z9

f 1 ( a * 3 ), f 2 ( a * 3 ), …,f j ( a * 3 ),... ,f d ( a * 3 )

a * 4

U1U2U3U4U5U6U7U8U9

f 1 ( a * 4 ), f 2 ( a * 4 ), …,f j ( a * 4 ),... ,f d ( a * 4 )

a * 5

V1V2V3V4V5V6V7V8V9

f 1 ( a * 5 ), f 2 ( a * 5 ), …,f j ( a * 5 ),... ,f d ( a * 5 )

...

...

...

  1. The value of a* is obtained by g(a). Use the d hash functions {f1, f2, ......, fd} to obtain d bits stored inc {m1 .. m} in the appropriate location
Back to article page