ML Anthology

Scalable Geometric Hashing on MasPar Machines

Ashfaq A. Khokhar, Viktor K. Prasanna, Hyoung Joong Kim
CVPR 1993 pp. 594-595
doi:10.1109/CVPR.1993.341069 /cvpr/1993/khokhar1993cvpr-scalable/

Abstract

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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

CVPR Semantic Scholar

Cite

Text

Khokhar et al. "Scalable Geometric Hashing on MasPar Machines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993. doi:10.1109/CVPR.1993.341069

Markdown

[Khokhar et al. "Scalable Geometric Hashing on MasPar Machines." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993.](https://mlanthology.org/cvpr/1993/khokhar1993cvpr-scalable/) doi:10.1109/CVPR.1993.341069

BibTeX

@inproceedings{khokhar1993cvpr-scalable,
  title     = {{Scalable Geometric Hashing on MasPar Machines}},
  author    = {Khokhar, Ashfaq A. and Prasanna, Viktor K. and Kim, Hyoung Joong},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1993},
  pages     = {594-595},
  doi       = {10.1109/CVPR.1993.341069},
  url       = {https://mlanthology.org/cvpr/1993/khokhar1993cvpr-scalable/}
}