
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.M. Eshaghian, "Parallel Algorithms for Image Processing on OMC," IEEE Transactions on Computers, vol. 40, no. 7, pp. 827833, July, 1991.  
BibTex  x  
@article{ 10.1109/12.83620, author = {M.M. Eshaghian}, title = {Parallel Algorithms for Image Processing on OMC}, journal ={IEEE Transactions on Computers}, volume = {40}, number = {7}, issn = {00189340}, year = {1991}, pages = {827833}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.83620}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Parallel Algorithms for Image Processing on OMC IS  7 SN  00189340 SP827 EP833 EPD  827833 A1  M.M. Eshaghian, PY  1991 KW  image processing; OMC; optical interconnects; generic model; computational limits; free space optics; parallel algorithms; fine grain image computing; constant time algorithms; computational complexity; computerised picture processing; optical information processing; parallel algorithms. VL  40 JA  IEEE Transactions on Computers ER   
The author studies a class of VLSI organizations with optical interconnects for fast solutions to several image processing tasks. The organization and operation of these architectures are based on a generic model called OMC, which is used to understand the computational limits in using free space optics in VLSI parallel processing systems. The relationships between OMC and shared memory models are discussed. Also, three physical implementations of OMC are presented. Using OMC, several parallel algorithms for fine grain image computing are presented. A set of processor efficient optimal O(log N) algorithms and a set of constant time algorithms are presented for finding geometric properties of digitized images. Finally, designs tailored to meet both the computation and communication needs of problems such as those involving irregular sparse matrices are examined.
[1] A. Agrawal and L. Nekludova, "A parallelO(logN) algorithm for finding connected components in planar images," inProc. IEEE Int. Conf. Parallel Processing, 1987.
[2] R. Anderson and G. L. Miller, "Optimal parallel algorithms for list ranking,"Tech. Rep., Dep. Comput. Sci., Univ. of Southern California, 1987.
[3] R. Barakat and J. Rief, "Lower bounds on the computational efficiency of optical computing systems,"J. Appl. Opt., vol. 26, no. 6, Mar. 15 1987.
[4] R. Cypher, J. L. C. Sanz, and L. Snyder, "EREW PRAM and mesh connected computer algorithms for image component labeling," inProc. IEEE Workshop Pattern Anal. Machine InteIl., 1987.
[5] M. M. Eshaghian, D. K. Panda, and V. K. PrasanaKumar, "Resource requirements of digital computations on electrooptical systems,"J. Appl. Opt., vol. 30, no. 8, Feb. 1991.
[6] M. M. Eshaghian and V. K. PrasannaKumar, "An implementation of neural networks using optical interconnects," inProc. IEEE Int. Conf. Neural Networks, 1988.
[7] D. J. Evans, Ed.Sparsity and its Applications. Cambridge, London: Cambridge University Press, 1985.
[8] J. A. Fried, "Optical I/O for high speed CMOS systems,"Opt. Eng., Oct. 1986.
[9] J. W. Goodman, S. Y. Kung, F. J. Leonberger, and R. A. Athale, "Optical interconnections for VLSI systems,"Proc. IEEE, vol. 72, pp. 850866, July 1984.
[10] R. I. Greenberg and C. E. Leiserson, "Randomized routing on fattrees," inProc. 26th Annu. Symp. Foundations Comput. Sci., Oct. 1985, pp. 241249.
[11] P. R. Haugen, S. Rychnovsky, A. Hussain, and L. D. Hutcheson, "Optical interconnects for high speed computing,"Opt. Eng., vol. 25, no. 10, Oct. 1986.
[12] E. Hecht,Optics, 3rd ed. Reading, MA: AddisonWesley, 1987.
[13] H. Ito, N. Komagata, H. Yamada, and H. Inaba, "New structure of laser diode and light emitting diode based on coaxial transverse junction," Tech. Rep., Research Institute of Electrical Communication, Tohoku Univ., Sendai 980, Japan.
[14] B. K. Jenkins and C. L. Giles, "Superposition in optical computing," inProc. ICO Int. Conf. Opt. Comput., Toulon, France, 1988.
[15] R. Miller, V. K. PrasannaKumar, D. Reisis, and Q. F. Stout, "Data movement operations and applications on reconfigurable VLSI arrays," inProc. IEEE Int. Conf. Parallel Processing, Aug. 1988.
[16] R. Miller and Q. F. Stout, "Parallel geometric algorithms for digitized pictures on mesh connected computers,"IEEE Trans. Pattern Anal. Machine Intell., Mar. 1985.
[17] V. K. PrasannaKumar and M. M. Eshaghian, "Parallel geometric algorithm fordigitized pictures on mesh of trees," inProc. IEEE Int. Conf. Parallel Processing, 1986.
[18] A. G. Ranade, "How to emulate shared memory," inProc. Annu. Symp. Foundations Comput. Sci., 1987.
[19] A. L. Rosenberg, "Threedimensional integrated circuits," inVLSI Systems and Computations, H. T. Kung, R. Sproul, and G. Steel, Eds. Rockville, MD: Computer Science Press, 1981, pp. 6979.
[20] A. A. Sawchuck, B. K. Jenkins, C. S. Raghavendra, and A. Varma, "Optical crossbar networks,"IEEE Comput., June 1987.
[21] C. D. Thompson, "A complexity theory for VLSI," Ph.D. dissertation, Dep. Comput. Sci., Carnegie Mellon Univ., 1980.
[22] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
[23] L. G. Valiant and G. Brebner, "Universal schemes for parallel communication," inProc. 13th Annu. ACM Symp. Theory Comput., 1981.
[24] J. C. Wyllie, "The complexity of parallel computations," Ph.D. dissertation, Dep. Comput. Sci., Cornell Univ., Ithaca, NY, 1979.