Space multiplexing of waveguides in optically interconnected multiprocessor systems
The Computer Journal - Special issue on object-oriented programming
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing
Parallel computation: models and methods
Parallel computation: models and methods
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Linear array with a reconfigurable pipelined bus system—concepts and applications
Information Sciences: an International Journal - special issue on parallel and distributed processing
Journal of Parallel and Distributed Computing
Time-Division Optical Communications in Multiprocessor Arrays
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
A fast algorithm for 1-norm vector median filtering
IEEE Transactions on Image Processing
Parallel Algorithms for Median Filtering on Arrays with Reconfigurable Optical Buses
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
In spite of their good filtering characteristics for vector-valued image processing, the usability of vector median filters is limited by their high computational complexity. Given an N\times N image and a W\times W window, the computational complexity of vector median filter is O(W^{4} N^{2}). In this paper, we design three fast and efficient parallel algorithms for vector median filtering based on the 2\hbox{-}{\rm{norm}} (L_2) on the arrays with reconfigurable optical buses (AROB). For 1\leq p\leq W\leq q \leq N, our algorithms run in O(W^{4}\log W/p^{4}), O({\frac{W^{4}N^{2}}{p^{4}q^{2}}}\log W) and O(1) times using p^{4}N^{2}/\log W, p^{4}q^{2}/\log W, and W^{4}N^{2}\log N$ processors, respectively. In the sense of the product of time and the number of processors used, the first two results are cost optimal and the last one is time optimal.