P system implementation of dynamic programming stereo

DOI10.1007/S10851-012-0367-6MaRDI QIDQ385332zbMATH OpenOpenAlexFDO

Authors Georgy Gimel'farb, Radu Nicolescu, Sharvin Ragavan

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 computingparallel systemsstereo matchingsymmetric dynamic programming stereo (SDPS)

Mathematics Subject Classification ID

Dynamic programming (90C39) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• Parallel and distributed algorithms in P systems
• Regularising ill-posed discrete optimisation: quests with P systems
• Stereo vision by self-organization
• P systems and computational algebraic topology
• On the degree of parallelism in membrane systems

Cites work

• scientific article; zbMATH DE number 5671765 (Why is no real title available?)
• A faster P solution for the Byzantine agreement problem
• BFS Solution for Disjoint Paths in P Systems
• Computing with membranes
• Membrane computing. An introduction.
• P systems and computational algebraic topology
• P systems and the Byzantine agreement
• Probabilistic regularisation and symmetry in binocular dynamic programming stereo

Cited in

(4)

• Neighbourhood message passing computation on a lattice with cP systems
• Testing based on identifiable P systems using cover automata and X-machines
• Regularising ill-posed discrete optimisation: quests with P systems
• Parallel and distributed algorithms in P systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385332)