Line connectivity algorithms for an asynchronous pyramid computer

Computer Vision, Graphics, and Image Processing - Tập 40 - Trang 169-187 - 1987
Shimon Edelman1
1Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel

Tài liệu tham khảo

Ullman, 1984, Visual routines, Cognition, 18, 97, 10.1016/0010-0277(84)90023-4 Marr, 1982 Jolicœur, 1986, Curve tracing: A possible basic operation in the perception of spatial relations, Memory & Cognition, 14, 129, 10.3758/BF03198373 Edelman, 1985 Wyllie, 1979 Shiloach, 1982, An O(log n) parallel connectivity algorithm, J. Algorithms, 3, 57, 10.1016/0196-6774(82)90008-6 Cook, 1983, The classification of problems which have fast parallel algorithms, Vol. 158, 78 Aggarwal, 1984, A comparison of X-trees, pyramids, and related machines, 89 1984 Minsky, 1969 Tutte, 1966, Vol. 15 Henle, 1979 Julesz, 1979, The role of terminators in visual texture discrimination, Vol. 44 Edelman, 1985, Quadtress in concurrent prolog, 544 Kameswara Rao, 1978, Checking connectivity preservation properties of some types of picture processing operations, 8, 299 Samet, 1984, The quadtree and related hierarchical data structures, Comput. Surveys, 16, 187, 10.1145/356924.356930 Nassimi, 1980, Finding connected components and connected ones on a mesh-connected parallel computer, SIAM J. Comput., 9, 744, 10.1137/0209058 Ahuja, 1984, Multiprocessor pyramid architectures for bottom-up image analysis, IEEE Trans. Pattern Anal. Mach. Intell. PAMI, 6, 463, 10.1109/TPAMI.1984.4767551 Tanimoto, 1982, Programming techniques for hierarchical parallel image processors, 421 Feldman, 1984 Tanimoto, 1980, Image data structures, 31 Uhr, 1980, Psychological motivation and underlying concepts, 1 Tanimoto, 1985, Image processing with hierarchical cellular logic, Vol. 18, 279