Abstract
Assume we are given ann ×n binary image containing horizontally convex features; i.e., for each feature, each of its row's pixels form an interval on that row. In this paper we consider the problem of assigning topological numbers to such features, i.e., assign a number to every featuref so that all features to the left off in the image have a smaller number assigned to them. This problem arises in solutions to the stereo matching problem. We present a parallel algorithm to solve the topological numbering problem inO(n) time on ann ×n mesh of processors. The key idea of our solution is to create a tree from which the topological numbers can be obtained even though the tree does not uniquely represent the “to the left of” relationship of the features.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. Ohta and T. Kanade, Stereo by Intra- and Inter-Scanline Search Using Dynamic Programming,IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 7, No. 2, pp. 139–154, March 1985.
S. T. Barnard and M. A. Fischler, Computational Stereo,Computing Surveys, Vol. 14, No. 4, pp. 553–572, December 1982.
S. T. Barnard and W. B. Thompson, Disparity Analysis of Images,IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 2, No. 4, pp. 333–340, July 1980.
C. Guerra and T. Kanade, A Systolic Algorithm for Stereo Matching, inVLSI: Algorithms and Architectures, P. Bertolazzi and F. Luccio, eds., North-Holland, Amsterdam, pp. 103–112, 1985.
D. Marr and T. Poggio, Cooperative Computation of Stereo Disparity,Science, Vol. 194, No. 4262, pp. 283–287, 15 October 1976.
K. E. Batcher, Design of a Massively Parallel Processor,IEEE Transactions on Computers, Vol. 29, No. 9, pp. 836–840, September 1980.
R. E. Cypher, J. L. C. Sanz, and L. Snyder, Practical Algorithms for Image Component Labeling on SIMD Mesh Connected Computers,Proceedings of the 1987 International Conference on Parallel Processing, pp. 772–779, 1987.
S. E. Hambrusch, VLSI Algorithms for the Connected Component Problem,SIAM Journal on Computing, Vol. 12, No. 2, pp. 354–365, May 1983.
S. E. Hambrusch and L. E. TeWinkel, A Study of Connected Component Labeling Algorithms on the MPP,Proceedings of the Third International Conference on Supercomputing, Vol. I, pp. 477–483, May 1988.
R. Miller and Q. F. Stout,Parallel Algorithms for Regular Architectures, Manuscript, 1991 (to be published by MIT Press).
D. Nassimi and S. Sahni, Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer,SIAM Journal on Computing, Vol. 9, No. 4, pp. 744–757, November 1980.
M. J. Atallah and S. E. Hambrusch, Solving Tree Problems on a Mesh-Connected Processor Array,Information and Control, Vol. 69, Nos. 1–3, pp. 168–187, April/May/June 1986.
Author information
Authors and Affiliations
Additional information
Communicated by Frank Dehne.
The work of M. J. Atallah was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T. Part of this work was done while he was a Visiting Scientist at the Center for Advanced Architectures project of the Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffett Field, CA 94035, USA. S. E. Hambrusch's work was supported by the Office of Naval Research under Contracts N00014-84-K-0502 and N00014-86K-0689, and by the National Science Foundation under Grant MIP-87-15652. Part of this work was done while she was visiting the International Computer Science Institute, Berkeley, CA 94704, USA. The work of L. E. TeWinkel was supported by the Office of Naval Research under Contract N00014-86K-0689.
Rights and permissions
About this article
Cite this article
Atallah, M.J., Hambrusch, S.E. & TeWinkel, L.E. Topological numbering of features on a mesh. Algorithmica 6, 762–769 (1991). https://doi.org/10.1007/BF01759070
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01759070