Hypercube algorithms : with applications to image processing and pattern recognition

著者

書誌事項

Hypercube algorithms : with applications to image processing and pattern recognition

Sanjay Ranka, Sartaj Sahni

（Bilkent University lecture series）

Springer, c1990

  • : us

大学図書館所蔵 件 / 全14件

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

巻冊次

: us ISBN 9780387973227

内容説明

Fundamentals algorithms for SIMD and MIMD hypercubes are developed. These include algorithms for such problems as data broadcasting, data sum, prefix sum, shift, data circulation, data accumulation, sorting, random access reads and writes and data permutation. The fundamental algorithms are then used to obtain efficient hypercube algorithms for matrix multiplication, image processing problems such as convolution, template matching, hough transform, clustering and image processing transformation, and string editing. Most of the algorithms in this book are for hypercubes with the number of processors being a function of problems size. However, for image processing problems, the book also includes algorithms for and MIMD hypercube with a small number of processes. Experimental results on an NCUBE/77 MIMD hypercube are also presented. The book is suitable for use in a one-semester or one-quarter course on hypercube algorithms. For students with no prior exposure to parallel algorithms, it is recommended that one week will be spent on the material in chapter 1, about six weeks on chapter 2 and one week on chapter 3. The remainder of the term can be spent covering topics from the rest of the book.
巻冊次

ISBN 9783540973225

内容説明

Fundamental algorithms for SIMD and MIMD hypercubes are developed in this text. These include algorithms for such problems as data broadcasting, data sum, prefix sum, shift, data circulation, data accumulation, sorting, random access reads and writes and data permutation. The fundamental algorithms are then used to obtain efficient hypercube algorithms for matrix multiplication, image processing problems such as convolution, template matching, Hough transform, clustering and image processing transformation, and string editing. Most of the algorithms in this book are for hypercubes with the number of processors being a function of problem size. However, for image processing problems, the book also includes algorithms for, and MIMD hypercubes with, a small number of processes. Experimental results on an NCUBE/77 MIMD hypercubes are also presented. The book is suitable for use in a one-term or one-quarter course on hypercube algorithms. For students with no prior exposure to parallel algorithms, it is recommended that one week will be spent on the material in chapter 1, about six weeks on chapter 2 and one week on chapter 3. The remainder of the term can be spent covering topics from the rest of the book.

目次

  • Fundamental operations
  • SIMD matrix multiplication
  • one dimensional convolution
  • template matching
  • Hough transform
  • clustering
  • image transformations
  • SIMD string editing.

「Nielsen BookData」 より

関連文献： 1件中  1-1を表示

詳細情報

ページトップへ