
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
J.H. Chang, O.H. Ibarra, T.C. Pong, S.M. Sohn, "TwoDimensional Convolution on a Pyramid Computer," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 590593, July, 1988.  
BibTex  x  
@article{ 10.1109/34.3920, author = {J.H. Chang and O.H. Ibarra and T.C. Pong and S.M. Sohn}, title = {TwoDimensional Convolution on a Pyramid Computer}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {10}, number = {4}, issn = {01628828}, year = {1988}, pages = {590593}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.3920}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  TwoDimensional Convolution on a Pyramid Computer IS  4 SN  01628828 SP590 EP593 EPD  590593 A1  J.H. Chang, A1  O.H. Ibarra, A1  T.C. Pong, A1  S.M. Sohn, PY  1988 KW  2D convolution; computerised picture processing; computational complexity; pyramid computer; window; image matrix; finite state; Boolean operations; Boolean functions; computational complexity; computerised picture processing; matrix algebra; parallel architectures VL  10 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
An algorithm for convolving a k*k window of weighting coefficients with an n*n image matrix on a pyramid computer of O(n/sup 2/) processors in time O(logn+k/sup 2/), excluding the time to load the image matrix, is presented. If k= Omega ( square root log n), which is typical in practice, the algorithm has a processortime product O(n/sup 2/ k/sup 2/) which is optimal with respect to the usual sequential algorithm. A feature of the algorithm is that the mechanism for controlling the transmission and distribution of data in each processor is finite state, independent of the values of n and k. Thus, for convolving two (0, 1)valued matrices using Boolean operations rather than the typical sum and product operations, the processors of the pyramid computer are finitestate.
[1] H. T. Kung and S. W. Song, "A systolic 2D convolution chip," inProc. IEEE Comput. Soc. Workshop Comput. Arch. Pattern Anal. Image Database Man., Nov. 1981, pp. 159160.
[2] M. Maresca and H. Li, "Morphological operations on mesh connected architecture: A generalized convolution algorithm," inProc. 1986 IEEE Comput. Soc. Conf. Comput. Vision Pattern Recognition, 1986, pp. 299304.
[3] S.Y. Lee and J. K. Aggarwal, "Parallel 2D convolution on a mesh connected array processor,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI9, pp. 590594, July 1987.
[4] Z. Fang, X. Li, and L. Ni, "Parallel algorithms for 2D convolution," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 262 269.
[5] V. Cantoni and S. Levialdi, Eds.,Pyramidal Systems for Computer Vision. Berlin: SpringerVerlag, 1986.
[6] L. Uhr,Multicomputer Architectures for Artificial Intelligence. New York: WileyInterscience, 1987.
[7] N. Ahuja and S. Swamy, "Multiprocessor pyramid architectures for bottomup image analysis,"IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI6, pp. 463475, July 1984.
[8] S. L. Tanimoto, "Sorting, histogramming and other statistical operations on a pyramid machine," inMultiresolution Image Processing and Analysis, A. Rosenfeld, Ed. New York: SpringerVerlag, 1984, pp. 136145.
[9] Q. F. Stout, "Drawing straight lines with a pyramid cellular automaton,"Inform. Processing Lett., vol. 15, pp. 233237, 1982.
[10] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 3860, 1987.
[11] A. P. Reeves, "Parallel computer architectures for image processing,"Comput. Vision, Graphics, Image Processing, vol. 25, pp. 68 88, 1984.