Parallel Algorithms for Median Filtering on Arrays with Reconfigurable Optical Buses

Authors:
Chin-Hsiung Wu;Shi-Jinn Horng;Yi Pan
Affiliations:
-;-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 10
Cited 0

Pipelined communications in optically interconnected arrays

Journal of Parallel and Distributed Computing
The power of reconfiguration

Journal of Parallel and Distributed Computing
Fast computer vision algorithms for reconfigurable meshes

Image and Vision Computing
Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System

IEEE Transactions on Parallel and Distributed Systems
Efficient parallel algorithms for hierarchical clustering on arrays with reconfigurable optical buses

Journal of Parallel and Distributed Computing
L_2 Vector Median Filters on Arrays with Reconfigurable Optical Buses

IEEE Transactions on Parallel and Distributed Systems
Computing 2-D Min, Median, and Max Filters

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Parallel Selection on the Linear Array with Reconfigurable Pipelined Bus System

FRONTIERS '99 Proceedings of the The 7th Symposium on the Frontiers of Massively Parallel Computation
Linear array with a reconfigurable pipelined bus system - Concepts and applications

Information Sciences: an International Journal
Fast median filtering algorithms for mesh computers

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main contributions of this paper are in designing fast and scalable parallel algorithms for selection and median filtering. Based on the radix-驴 representation and the power of pipelined optical buses, we first design a constant time selection algorithm on the arrays with reconfigurable optical buses (AROB). Then, given an N 脳 N image and a W 脳 W window, based on the proposed selection algorithm, several scalable median filtering algorithms are developed on the AROB model with various number of processors. In the sense of the product of time and the number of processors used, the proposed algorithms are time or cost optimal. Compared to the previous known results, ours are fast and flexible.