Line connectivity algorithms for an asynchronous pyramid computer
暂无分享,去创建一个
[1] S. Ullman. Visual routines , 1984, Cognition.
[2] Michael Henle,et al. A combinatorial introduction to topology , 1978 .
[3] Alan Bundy,et al. Image Data Structures , 1984 .
[4] Shimon Edelman,et al. Quadtrees in Concurrent PROLOG , 1985, ICPP.
[5] Stephen A. Cook,et al. The Classifikation of Problems which have Fast Parallel Algorithms , 1983, FCT.
[6] S. Ullman,et al. Curve tracing: A possible basic operation in the perception of spatial relations , 1986, Memory & cognition.
[7] Sartaj Sahni,et al. Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer , 1980, SIAM J. Comput..
[8] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[9] C. V. Kameswara Rao,et al. Checking connectivity preservation properties of some types of picture processing operations , 1978 .
[10] Narendra Ahuja,et al. Multiprocessor Pyramid Architectures for Bottom-Up Image Analysis , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Uzi Vishkin,et al. An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.
[12] Jerome A. Feldman,et al. Rochester Connectionist Papers: 1979-1984. Revision , 1984 .
[13] S. L. Tanimoto,et al. Image Processing with Hierarchical Cellular Logic , 1985 .
[14] Azriel Rosenfeld,et al. Multiresolution image processing and analysis , 1984 .
[15] James Christopher Wyllie,et al. The Complexity of Parallel Computations , 1979 .