A simplified design strategy for mapping image processing algorithms on a SIMD torus

DOI10.1016/0304-3975(95)95694-FMaRDI QIDQ673769zbMATH OpenFDO

Authors Guna Seetharaman

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

SIMD algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• Image template matching on hypercube SIMD computers
• Parallel image understanding algorithms on MIMD multicomputers
• Parallel matching and reconstruction algorithms in computer vision
• Efficient parallel algorithms for image template matching on hypercube SIMD machines
• A systolic array with applications to image processing and wire-routing in VLSI circuits

Cites work

• scientific article; zbMATH DE number 4051492 (Why is no real title available?)
• scientific article; zbMATH DE number 3473182 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systems
• Orthogonal multiprocessor sharing memory with an enhanced mesh for integrated image understanding

Cited in

(2)

• The impact of grain size on the efficiency of embedded SIMD image processing architectures
• Avoiding conversion and rearrangement overhead in SIMD architectures

Describes a project that uses

Uses Software

• UNITY

This page was built for publication: A simplified design strategy for mapping image processing algorithms on a SIMD torus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673769)