MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance

DOI10.1016/0167-8191(95)00013-EMaRDI QIDQ672943zbMATH 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)00013-e

zbMATH Keywords

Distance transformationDivide and conquerImage analysisMIMD machines

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• MIMD divide-and-conquer algorithms for the distance transformation. Part II: Chamfer 3-4 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

(5)

• Branch and bound algorithm for multidimensional scaling with city-block metric
• Parallel distance transforms on a linear array architecture
• Fast algorithm for sequential machine to compute pattern spectrum via city-block distance transform
• scientific article; zbMATH DE number 2040840 (Why is no real title available?)
• MIMD divide-and-conquer algorithms for the distance transformation. Part II: Chamfer 3-4 distance

This page was built for publication: MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance

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