Scalable data parallel algorithms for geometric hashing are presented. Implementations of the proposed algorithms are performed on MasPar MP-1/MP-2. New parallel algorithms are designed and mapped onto MP-1/MP-2. These techniques significantly improve upon the number of processors employed while achieving superior time performance. The authors' implementations run on a P processor machine, such that 1/spl les/P/spl les/S, where S is the number of feature points in the scene. The results show that a probe of the recognition phase for a scene consisting of 1024 feature points takes less than 50 ms on a 1-K processor MP-1/MP-2.<>
Scalable geometric hashing on MasPar machines
1993-01-01
174301 byte
Conference paper
Electronic Resource
English
Geometric Hashing with Attributed Features
British Library Conference Proceedings | 1994
|Geometric hashing with attributed features
IEEE | 1994
|On the sensitivity of geometric hashing
IEEE | 1990
|New developments on geometric hashing for curve matching
IEEE | 1993
|Semi-supervised multi-graph hashing for scalable similarity search
British Library Online Contents | 2014
|