P system implementation of dynamic programming stereo

DOI10.1007/s10851-012-0367-6zbMath1276.68077OpenAlexW1971644792MaRDI QIDQ385332

Georgy Gimel'farb, Sharvin Ragavan, Radu Nicolescu

Publication date: 2 December 2013

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-012-0367-6

zbMATH Keywords

membrane computingstereo matchingparallel systemssymmetric dynamic programming stereo (SDPS)

Mathematics Subject Classification ID

Related Items (1)

Testing based on identifiable P systems using cover automata and X-machines

Cites Work

• Unnamed Item
• P systems and computational algebraic topology
• P systems and the Byzantine agreement
• Computing with membranes
• Membrane computing. An introduction.
• BFS Solution for Disjoint Paths in P Systems
• A Faster P Solution for the Byzantine Agreement Problem
• Probabilistic regularisation and symmetry in binocular dynamic programming stereo

This page was built for publication: P system implementation of dynamic programming stereo