MIMD divide-and-conquer algorithms for the distance transformation. Part II: Chamfer 3-4 distance

DOI10.1016/0167-8191(95)00014-FMaRDI QIDQ672944zbMATH OpenOpenAlexFDO

Authors Hugo Embrechts, Dirk Roose

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(95)00014-f

zbMATH Keywords

Distance transformationDivide and conquerImage analysisMIMD machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance
• Parallel distance transforms on pyramid machines: Theory and implementation
• Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems
• A general algorithm for computing distance transforms in linear time

Cited in

(3)

• 2D subquadratic separable distance transformation for path-based norms
• On the validity of the two raster sequences distance transform algorithm
• MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance

This page was built for publication: MIMD divide-and-conquer algorithms for the distance transformation. Part II: Chamfer 3-4 distance

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