Sciweavers

1262 search results - page 11 / 253
» Fast Robust Hashing
Sort
View
DAGM
2004
Springer
14 years 1 months ago
Using Pattern Recognition for Self-Localization in Semiconductor Manufacturing Systems
In this paper we present a new method for self-localization on wafers using geometric hashing. The proposed technique is robust to image changes induced by process variations, as o...
Michael Lifshits, Roman Goldenberg, Ehud Rivlin, M...
ICIP
2004
IEEE
14 years 10 months ago
Robust perceptual image hashing via matrix invariants
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
Mehmet Kivanç Mihçak, Ramarathnam Ve...
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
14 years 3 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...
CVPR
2012
IEEE
11 years 11 months ago
Fast search in Hamming space with multi-index hashing
There has been growing interest in mapping image data onto compact binary codes for fast near neighbor search in vision applications. Although binary codes are motivated by their ...
Mohammad Emtiyaz Norouzi, Ali Punjani, David J. Fl...
EUROCRYPT
2007
Springer
14 years 2 months ago
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...
Krzysztof Pietrzak