P systems in stereo matching

  • Authors:
  • Georgy Gimel'farb;Radu Nicolescu;Sharvin Ragavan

  • Affiliations:
  • Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand;Department of Computer Science, University of Auckland, Auckland, New Zealand

  • Venue:
  • CAIP'11 Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part II
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Designing parallel versions of sequential algorithms has attracted renewed attention, due to recent hardware advances, including various general-purpose multi-core, multiple core and many-core processors, as well as special-purpose FPGA implementations. P systems consist of networks of autonomous cells, such that each cell transforms its input signals in accord with symbol-rewriting rules and feeds the output results into its immediate neighbours. Inherent intra- and inter-cell parallelism make the P systems a prospective theoretical testbed for designing parallel algorithms. This paper discusses capabilities of P systems to implement the symmetric dynamic programming algorithm for stereo matching, with due account to binocular or monocular visibility of 3D surface points.