𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel shape coding on a SIMD architecture

✍ Scribed by Zbigniew Wójcik

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
769 KB
Volume
3
Category
Article
ISSN
0952-1976

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a parallel shape analysis by simultaneous merging of elementary features detected through calculation of the number of objects within neighbouring windows. The parallel algorithm can be embedded on a SIMD mesh architecture. Elementary image features are detected inside partly overlapping windows fixed in the image plane. Each window's contents are processed by a ~separate processing element (PE). Two neighbouring dementary feature elements are merged by adjacent PEs, and the joined feature chunks are merged in the next step by every 22th PE possessing the same feature. Feature ends are propagated across N = 2" PEs in each nth parallel step toward opposite edges of the mesh array of PEs. The shape coding is completed if all the feature limits (e.g. edges) meet i together on one PE. The approach has the property of mapping an image fragment directly into words and phrases.

📜 SIMILAR VOLUMES

Real-time visual attention on a massivel
Real-time visual attention on a massively parallel SIMD architecture
✍ Nabil Ouerhani; Heinz Hügli 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Visual attention is the ability to rapidly detect the visually salient parts of a given scene on which higher level vision tasks, such as object recognition, can focus. Found in biological vision, this mechanism represents a fundamental tool for computer vision. This paper reports the first real-tim

Parallel shape recognition and its imple
Parallel shape recognition and its implementation on a fixed-size VLSI architecture
✍ H.D. Cheng; X. Cheng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 928 KB

Shape recognition is an important research area in pattern recognition. It also has wide practical applications in many fields. An attribute grammar approach to shape recognition combines both advantages of syntactic and statistical methods and makes shape recognition more accurate and efficient. Ho

Development of a parallel molecular dyna
Development of a parallel molecular dynamics code on SIMD computers: Algorithm for use of pair list criterion
✍ Roccatano, D.; Bizzarri, R.; Chillemi, G.; Sanna, N.; Di Nola, A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 3 views

In recent years several implementations of molecular dynamics Ž . Ž . MD codes have been reported on multiple instruction multiple data MIMD machines. However, very few implementations of MD codes on single instruction Ž . multiple data SIMD machines have been reported. The difficulty in using pair

Ordinary linear model estimation on a ma
Ordinary linear model estimation on a massively parallel SIMD computer
✍ Kontoghiorghes, Erricos John 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 2 views

Dedicated to the late M. R. B. Clarke SUMMARY Efficient algorithms for estimating the coefficient parameters of the ordinary linear model on a massively parallel SIMD computer are presented. The numerical stability of the algorithms is ensured by using orthogonal transformations in the form of House