✦ LIBER ✦

Efficient parallel algorithms for image template matching on hypercube SIMD machines

✍ Scribed by Prasanna, K.V.K.; Krishnan, V.

Book ID: 117873007
Publisher: IEEE
Year: 1989
Tongue: English
Weight: 582 KB
Volume: 11
Category: Article
ISSN: 0162-8828
DOI: 10.1109/34.24802

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Image template matching on hypercube SIM

Image template matching on hypercube SIMD computers

✍ E.L. Zapata; J.I. Benavides; O.G. Plata; F.F. Rivera; J.M. Carazo 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 800 KB

Efficient Algorithms for Image Template

Efficient Algorithms for Image Template and Dictionary Matching

✍ Sung-Hyuk Cha 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 206 KB

Algorithms for Fractal Image Compression

Algorithms for Fractal Image Compression on Massively Parallel SIMD Arrays

✍ Christian Hufnagl; Andreas Uhl 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 601 KB

Algorithms for Fractal Image Compression on Massively Parallel SIMD Arrays I n this work we introduce and analyse algorithms for fractal image compression on massively parallel SIMD arrays. The dierent algorithms discussed dier signi®cantly in terms of their communication and computation structure.

A randomized parallel algorithm for stri

A randomized parallel algorithm for string matching on hypercube

✍ Kuo-Liang Chung 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 301 KB

[Lecture Notes in Computer Science] Para

[Lecture Notes in Computer Science] Parallel Image Analysis Volume 654 || Optimal parallel algorithms for multidimensional image template matching and pattern matching

✍ Nakamura, Akira; Nivat, Maurice; Saoudi, Ahmed; Wang, Patrick S. P.; Inoue, Kats 📂 Article 📅 1992 🏛 Springer Berlin Heidelberg ⚖ 330 KB

Nearly Logarithmic-Time Parallel Algorit

Nearly Logarithmic-Time Parallel Algorithms for the Class of ±2b ASCEND Computations on a SIMD Hypercube

✍ D. Nassimi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 979 KB