Optimal image algorithms on an orthogonally-connected memory-based architecture
暂无分享,去创建一个
[1] Robert Michael Owens,et al. An architecture for a VLSI FFT processor , 1983, Integr..
[2] Viktor K. Prasanna,et al. Fast Image Labeling Using Local Operators on Mesh-Connected Computers , 1991, IEEE Trans. Pattern Anal. Mach. Intell..
[3] Russ Miller,et al. Geometric Algorithms for Digitized Pictures on a Mesh-Connected Computer , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4] Isaac D. Scherson,et al. Parallel Sorting in Two-Dimensional VLSI Models of Computation , 1989, IEEE Trans. Computers.
[5] Kai Hwang,et al. An Orthogonal Multiprocessor for Parallel Scientific Computations , 1989, IEEE Trans. Computers.
[6] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[7] Russ Miller,et al. Meshes with reconfigurable buses , 1988 .
[8] Richard O. Duda,et al. Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.
[9] S. N. Maheshwari,et al. Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.
[10] Alan C. Tucker,et al. An Efficient Test for Circular-Arc Graphs , 1980, SIAM J. Comput..
[11] Sartaj Sahni,et al. Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..
[12] H. M. Alnuweiri,et al. Optimal image computations on reduced VLSI architectures , 1989 .
[13] Russ Miller,et al. Data Movement Techniques for the Pyramid Computer , 1987, SIAM J. Comput..