Skip to main content
Fig. 1 | EURASIP Journal on Image and Video Processing

Fig. 1

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

Fig. 1

The false positive rate corresponding to the number of hash functions. The curve shows the relationship between the number of hash functions and the false positive rate. The Bloom filter is 32 bits per item (m/n = 32). Initially, the false positive rate decreases as the number of hash functions increases. After reaching the threshold value (22), the number of hash functions increased, while the false positive rate increased slightly

Back to article page