
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
R. Miller, Q.F. Stout, "Simulating Essential Pyramids," IEEE Transactions on Computers, vol. 37, no. 12, pp. 16421648, December, 1988.  
BibTex  x  
@article{ 10.1109/12.9741, author = {R. Miller and Q.F. Stout}, title = {Simulating Essential Pyramids}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {12}, issn = {00189340}, year = {1988}, pages = {16421648}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.9741}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Simulating Essential Pyramids IS  12 SN  00189340 SP1642 EP1648 EPD  16421648 A1  R. Miller, A1  Q.F. Stout, PY  1988 KW  simulation; essential pyramids; pyramid algorithms; image processing; optimal algorithms; hypercube; meshoftrees; mesh; mesh with row and column buses; mesh with reconfigurable buses; PRAM; pyramid computer; computerised picture processing; parallel processing; virtual machines. VL  37 JA  IEEE Transactions on Computers ER   
[1] P. J. Burt, "Hierarchically derived piecewise polynomial approximations to waveforms and images," TR838, Comput. Vision Lab., Univ. Maryland, 1979.
[2] P. J. Burt, C. H. Anderson, J. O. Sinniger, and G. van der Wal, "A pipelined pyramid machine," inPyramidal Systems for Computer Vision, NATO ASI Series F: Computer and System Sciences, Vol. 25. New York: SpringerVerlag, 1986, pp. 133152.
[3] V. Cantoni and S. Levialdi, Eds.,Pyramidal Systems for Computer Vision. Berlin: SpringerVerlag, 1986.
[4] V. Cantoni and S. Levialdi, "PAPIA: A case history," inParallel Computer Vision(L. Uhr, Ed.). New York, NY: Academic, 1987.
[5] D. M. Champion and J. Rothstein, "Immediate parallel solution of the longest common subsequence problem," inProc. 1987 Int. Conf. Parallel Processing, pp. 7077.
[6] R. Cole, "Parallel merge sort," inProc. 27th Symp. Foundations Comput. Sci., 1986, pp. 511516.
[7] G. Fritsch, "General purpose pyramidal architectures," inPyramidal Systems for Computer Vision, NATO ASI Series F: Computer and System Sciences, vol. 25, New York: SpringerVerlag, 1986, pp. 4158.
[8] M. T. Heath, Ed.,Hypercube Multiprocessors 1986. Philadelphia, PA, SIAM, 1986.
[9] M. T. Heath, Ed.,Hypercube Multiprocessors 1987. Philadelphia, PA, SIAM, 1987.
[10] M.D. A. Huang, "Solving some graph problems with optimal or nearoptimal speedup on meshoftrees networks,"inProc. 26th Symp. Foundations Comput. Sci., 1985, pp. 232240.
[11] F. T. Leighton, "New lower bound techniques for VLSI," inProc. 22nd Symp. on Foundations Comput. Sci., 1981, pp. 8598.
[12] F. T. Leighton, "Parallel computation using meshes of trees," inProc. 1983 Int. Conf. Graph Theoret. Concepts Comput. Sci.
[13] H. Li and M. Maresca, "Polymorphictorus network,"inProc. 1987 Int. Conf. Parallel Processing, pp. 411414.
[14] A. Merigot, P. Clermont, J. Mehat, F. Devos, and B. Zavidovique, "A pyramidal system for image processing," inPyramidal Systems for Computer Vision, NATO ASI Series F: Computer and System Sciences, vol. 25, New York: SpringerVerlag, 1986, pp. 109124.
[15] R. Miller, "Pyramid computer algorithms," Ph.D. dissertation, State Univ. New York, Binghamton, 1985.
[16] R. Miller, V. K. Prasanna Kumar, D. Reisis, and Q. F. Stout, "Meshes with reconfigurable buses," inProc. 5th MIT Conf. Advanced Res. VLSI(Cambridge, MA), 1988, pp. 163178.
[17] R. Miller and Q. F. Stout, "Convexity algorithms for pyramid computers," inProc. 1984 Int. Conf. Parallel Processing, pp. 177 184.
[18] R. Miller and Q. F. Stout, "Some graph and imageprocessing algorithms for the hypercube," inHypercube Multiprocessors 1987. Philadelphia, PA, SIAM, 1987, pp. 418425.
[19] R. Miller and Q. F. Stout, "Data movement techniques for the pyramid computer,"SIAM J. Comput., vol. 16, pp. 3860, 1987.
[20] R. Miller and Q. F. Stout,Parallel Algorithms for Regular Architectures. Cambridge, MA: MIT Press, 1988, to be published.
[21] R. Miller and Q. F. Stout, "Efficient convex hull algorithms,"IEEE Trans. Comput., this issue, pp. 16051618.
[22] V. K. Prassana Kumar and M. Eschoghian, "Parallel geometric algorithms for digitized pictures on mesh of trees," inProc. 1986 Int. Conf. Parallel Processing, pp. 270273.
[23] V. K. Prassana Kumar and C. S. Raghavendra, "Image processing on enhanced mesh Connected computers," inProc. Comput. Architecture Pattern Anal. Image Database Man., 1985, pp. 243247.
[24] A. Rosenfeld, Ed.,Multiresolution Image Processing and Analysis. New York: SpringerVerlag, 1984.
[25] A. Rosenfeld, "Some pyramid techniques for image segmentation," inPyramidal Systems for Computer Vision(V. Cantoni and S. Levialdi, Eds.). Berlin, Heidelberg: SpringerVerlag, 1986, pp. 261271, NATO ASI Series, vol. F25.
[26] H. Samet, "A tutorial on quadtree research," inMultiresolution Image Processing and Analysis. New York: SpringerVerlag, 1984, pp. 212223.
[27] D. H. Schaefer, P. Ho, J. Boyd, and C. Vallejos, "The GAM Pyramid," inParallel Computer Vision. New York: Academic, 1987, pp. 1542.
[28] C. L. Seitz, "The Cosmic Cube,"Commun. ACM, pp. 2233, Jan. 1985.
[29] L. Snyder, "Introduction to the configurable, highly parallel computer,"Computer, vol. 1, pp. 4756, 1982.
[30] J. S. Squire and S. M. Palais, "Programming and design considerations for a highly parallel computer, "inProc. AFIPS Conf., vol. 23, 1963 SJCC, pp. 395400.
[31] Q. F. Stout, "Sorting, merging, selecting, and filtering on tree and pyramid machines, "inProc. 1983 Int. Conf. Parallel Processing, pp. 214221.
[32] Q. F. Stout, "Pyramid computer solutions of the closest pair problem,"J. Algorithms, vol. 6, pp. 200212, 1985.
[33] Q. F. Stout, "Meshes with multiple buses," inProc. 27th Symp. Foundations comput. Sci., 1986, pp. 264273.
[34] Q. F. Stout, "Pyramid computer algorithms optimal for the worstcase," inParallel Computer Vision, L. Uhr, Ed. New York: Academic Press, 1987, pp. 147168.
[35] S. L. Tanimoto and A. Klinger, Eds.,Structured Computer Vision: Machine Perception Through Hierarchical Computation Structures. New York: Academic, 1980.
[36] S. L. Tanimoto, T. J. Ligocki, and R. Ling, "A prototype pyramid machine for hierarchical cellular logic," inParallel Computer Vision. New York: Academic, 1987, pp. 4383.
[37] C. D. Thompson and H. T. Kung, "Sorting on a mesh connected processor array,"Commun. ACM, pp. 263271, 1972.
[38] L. Uhr, "Layered 'recognition cone' networks that preprocess, classify, and describe,"IEEE Trans. Comput., vol. C21, pp. 758 768, 1972.
[39] L. Uhr, "Parallel, hierarchical software/hardware pyramid architectures," inPyramidal Systems for Computer Vision, NATO ASI series F: Computer and System Sciences, vol. 25, New York: SpringerVerlag, 1986, pp. 120.
[40] L. Uhr, Ed.,Parallel Computer Vision. New York: Academic, 1987.
[41] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
[42] C. C. Weems, S. P. Levitan, A. R. Hanson, E. M. Riseman, J. G. Nash, and D. B. Shu, "The image understanding architecture," COINS Tech. Rep. 8776, Univ. Massachusetts, Amherst.
[43] Proc. Third Conf. Hypercube Concurrent Comput. Appl., SIAM, 1988.