Efficient parallel algorithms for distance maps of 2D binary images using an optical bus
暂无分享,去创建一个
Yi Pan | Keqin Li | Si-Qing Zheng | Jie Li | Yamin Li
[1] Sartaj Sahni,et al. Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses , 1997, IEEE Trans. Parallel Distributed Syst..
[2] Yi Pan,et al. Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems , 2000, The Journal of Supercomputing.
[3] Rami G. Melhem,et al. Time-Division Optical Communications in Multiprocessor Arrays , 1993, IEEE Trans. Computers.
[4] Selim G. Akl,et al. on the Power of Arrays with Optical Pipeline Buses , 1996, PDPTA.
[5] Ling Chen,et al. A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image , 1994, Inf. Process. Lett..
[6] Ling Chen,et al. An Efficient Algorithm for Complete Euclidean Distance Transform on Mesh-Connected SIMD , 1995, Parallel Comput..
[7] Yi Pan,et al. Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses , 2000, J. Parallel Distributed Comput..
[8] Yi Pan,et al. An improved constant-time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh , 1999, IEEE Trans. Syst. Man Cybern. Part A.
[9] Jelloul Elmesbahi. Nearest neighbor problems on a mesh-connected computer , 1990, IEEE Trans. Syst. Man Cybern..
[10] Sartaj Sahni,et al. Models and algorithms for optical and optoelectronic parallel computers , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.
[11] Yi Pan,et al. Basic Data Movement Operations on the LARPBS Model , 1998 .
[12] J. El Mesbahi. Theta (1) algorithm for image component labeling in a mesh connected computer , 1991 .
[13] Yi Pan,et al. Pipelined time-division multiplexing optical bus with conditional delays , 1997 .
[14] Yi Pan,et al. Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system , 1997, Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97).
[15] H. Yamada. Complete Euclidean Distance Transformation by Parallel Poeration , 1984 .
[16] Rami G. Melhem,et al. Space Multiplexing of Waveguides in Optically Interconnected Multiprocessor Systems , 1989, Comput. J..
[17] P. Danielsson. Euclidean distance mapping , 1980 .
[18] Omar Bouattane,et al. θ(1) time quadtree algorithm and its application for image geometric properties on a mesh connected computer (MCC) , 1995, IEEE Transactions on Systems, Man, and Cybernetics.
[19] Yuan Yan Tang,et al. RPCT Algorithm and its VLSI Implementation , 1994, IEEE Trans. Syst. Man Cybern. Syst..
[20] Rami G. Melhem,et al. Pipelined Communications in Optically Interconnected Arrays , 1991, J. Parallel Distributed Comput..
[21] Shi-Jinn Horng,et al. An O(1) time algorithms for computing histogram and Hough transform on a cross-bridge reconfigurable array of processors , 1995, IEEE Trans. Syst. Man Cybern..
[22] Jelloul Elmesbahi. Θ(1) algorithm for image component labeling in a mesh connected computer , 1991, IEEE Trans. Syst. Man Cybern..
[23] Terry Bossomaier,et al. Dara Parallel Computation of Euclidean Distance Transforms , 1992, Parallel Process. Lett..
[24] Shi-Jinn Horng,et al. Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses , 2000, J. Parallel Distributed Comput..
[25] Kiriakos N. Kutulakos,et al. Fast Computation of the Euclidian Distance Maps for Binary Images , 1992, Inf. Process. Lett..
[26] E. Dubois,et al. Digital picture processing , 1985, Proceedings of the IEEE.