
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
C.H. Wu, S.J. Horng, "L_2 Vector Median Filters on Arrays with Reconfigurable Optical Buses," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 12, pp. 12811292, December, 2001.  
BibTex  x  
@article{ 10.1109/71.970563, author = {C.H. Wu and S.J. Horng}, title = {L_2 Vector Median Filters on Arrays with Reconfigurable Optical Buses}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {12}, issn = {10459219}, year = {2001}, pages = {12811292}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.970563}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  L_2 Vector Median Filters on Arrays with Reconfigurable Optical Buses IS  12 SN  10459219 SP1281 EP1292 EPD  12811292 A1  C.H. Wu, A1  S.J. Horng, PY  2001 KW  Parallel algorithm KW  scalable algorithm KW  vector median filter KW  nonlinear filter KW  image (signal) processing KW  reconfigurable optical bus system VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
In spite of their good filtering characteristics for vectorvalued 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.
[1] S.G. Akl, Parallel Computation: Models and Methods. Upper Saddle River, N.J.: Prentice Hall, 1997.
[2] G. Angelopoulos and I. Pitas, “TwoDimensional Vector Median Filters on Mesh Connected Computers,” Proc. Int'l Conf. Image Processing, pp. 650653, 1994.
[3] J. Astola, P. Haavisto, and Y. Neuvo, Vector Median Filters Proc. IEEE, vol. 78, no. 4, pp. 678689, 1990.
[4] M. Barni, V. Cappellini, and A. Mecocci, “The Use of Different Metrics in Vector Median Filtering: Application to Fine Arts and Paintings,” Proc. Sixth Int'l Conf. Signal Processing, Theories, and Applications, pp. 14851488, 1992.
[5] M. Barni, V. Cappellini, and A. Mecocci, “Fast Vector Median Filter Based on Euclidean Norm Approximation,” IEEE Signal Processing Letters, vol. 1, pp. 9294, 1994.
[6] M. Barni, F. Bartolini, and V. Cappellini, “Optimum Linear Approximation of the Euclidean Norm to Speed up Vector Median Filtering,” Proc. Int'l Conf. Image Processing, vol. 1, pp. 362 365 1995.
[7] M. Barni, “A Fast Algorithm for$1\hbox{}{\rm{norm}}$Vector Median Filter,” IEEE Trans. Image Processing, vol. 6, no. 10, pp. 583586, 1997.
[8] K.E. Batcher, “Design of a Massively Parallel Processor,” IEEE Trans. Computers, vol. 29, pp. 836840, 1980.
[9] Y. BenAsher,D. Peleg,R. Ramaswami,, and A. Schuster,“The power of reconfiguration,” J. of Parallel and Distributed Computing, vol. 13, no. 2, pp. 139153, Oct. 1991.
[10] V. Caselles, G. Sapiri, and D.H. Chung, “Vector Median Filters, Morphology, and PDE's: Theorectical Conceptions,” Proc. Int'l Conf. Image Processing, vol. 1, pp. 177 181, 1999.
[11] Z. Guo, R. Melhem, R. Hall, D. Chiarulli, and S. Levitan, “Pipelined Communication in Optically Interconnected Arrays,” J. Parallel and Distributed Computing, vol. 12, no. 3, pp. 269282, 1991.
[12] S.P. Levitan, D.M. Chiarulli, and R.G. Melhem, “Coincident Pulse Technique for Multiprocessor Interconnection Structures,” Applied Optics, vol. 29, no. 14, pp. 20242033, 1990.
[13] K. Li, Y. Pan, and S.Q. Zheng, “Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array with Reconfigurable Pipelined Bus System,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 8, pp. 705720, Aug. 1998.
[14] L. Lucat and P. Siohan, “VectorMedian Type Filters and Fastcomputation algorithms,” Proc. Int'l Symp. Circuits and Systems, pp. 24692472, 1997.
[15] R. Melhem, D. Chiarulli, and S. Levitan, “Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems,” The Computer J., vol. 32, no. 4, pp. 362369, 1989.
[16] R. Miller, V.K. Prasanna Kumar, D. Reisis, and Q.F. Stout, "Image Computations on Reconfigurable Mesh," Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), pp. 925930, 1988.
[17] Y. Pan and M. Hamdi, “Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System,” Proc. IEEE Int'l Symp. Parallel Architectures, Algorithms, and Networks, pp. 313319, 1996.
[18] Y. Pan and K. Li, “Linear Array with a Reconfigurable Pipelined Bus System—Concepts and Applications,” Information Sciences, vol. 106, no. 3/4, pp. 237258, May 1998.
[19] S. Pavel and S.G. Akl, “On the Power of Arrays with Reconfigurable Optical Bus,” Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications, pp. 14431454, 1996.
[20] S. Pavel and S.G. Akl, “Matrix Operations Using Arrays with Reconfigurable Optical Buses,” Parallel Algorithms and Applications, vol. 8, pp. 223242, 1996.
[21] S. Pavel and S.G. Akl, “Integer Sorting and Routing in Arrays with Reconfigurable Optical Buses,” Int'l J. Foundations of Computer Science, vol. 9, no. 1, pp. 99120 1998.
[22] C. Qiao and R. Melhem, "TimeDivision Optical Communications in Multiprocessor Arrays," IEEE Trans. Computers, vol. 42, no. 5, pp. 577590, May 1993.
[23] S. Rajasekaran and S. Sahni, “Sorting, Selection and Routing on the Arrays with Reconfigurable Optical Buses,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 11, pp. 11231132 Nov. 1997.
[24] B. F. Wang and G. H. Chen,“Constant time algorithms for the transitive closure problem and some related graph problems on processor arrays with reconfigurable bus systems,” IEEE Trans. on Parallel and Distributed Systems, vol. 1, no. 4, pp. 500507, 1991.
[25] C.H. Wu, S.J. Horng, and H.R. Tsai, “Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses,” J. Parallel and Distributed Computing, vol. 60, pp. 11371153, 2000.
[26] J. Zheng, K.P. Valavaris, and J.M. Gaugh, “Noise Removal from Color Images,” J. Intelligent Robotic Systems, vol. 7, pp. 257285, 1993.