𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Computation of Variant Templates for Parallel Image Processing

✍ Scribed by Yuning Dong

Book ID
111589717
Publisher
Springer US
Year
2004
Tongue
English
Weight
153 KB
Volume
20
Category
Article
ISSN
0924-9907

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Adaptive Multiresolution Structures for
Adaptive Multiresolution Structures for Image Processing on Parallel Computers
✍ S.G. Ziavras; P. Meer πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 886 KB

This paper presents a solution to the problem of creating region adjacency graph (RAG) pyramids on parallel computers comprising the hypercube topology. RAG pyramids represent hierarchies of irregular tesselations, with each tesselation generated in parallel by independent stochastic processes, and

The GIOTTO System: a Parallel Computer f
The GIOTTO System: a Parallel Computer for Image Processing
✍ Rita Cucchiara; Luigi Di Stefano; Massimo Piccardi; Tullio Salmon Cinotti πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 206 KB

his paper presents the GIOTTO system, a parallel computer based on a scalable single instruction, multiple data (SIMD) array of processors specially conceived for image Tpr ocessing. The system is characterized by a reduced-size array and a novel organization of the memory subsystem, designed to sup

A fast BNM (Best Neighborhood Matching):
A fast BNM (Best Neighborhood Matching): Algorithm and parallel processing for image restoration
✍ Wen Li; David Zhang; Zhiyong Liu; Xiangzhen Qiao πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 744 KB

## Abstract Best Neighborhood Matching (BNM) algorithm is a good approach of error concealment in terms of restored image quality. However, this kind of error concealment algorithm is commonly computation‐intensive, which restricts their real applications on large‐scale image or video sequence rest