Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

DOI10.1006/CVIU.1998.0741MaRDI QIDQ4240143zbMATH OpenOpenAlexFDO

Authors Yu-Hua Lee, Shi-Jinn Horng

Publication date 14 October 1999

Published in Computer Vision and Image Understanding (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/cviu.1998.0741

zbMATH Keywords

distance transformhypercube computer

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• A cost optimal parallel algorithm for weighted distance transforms.
• Parallel computation of distance transforms
• Parallel distance transforms on a linear array architecture

Cited in

(9)

• Parallel computation of distance transforms
• Parallel distance transforms on a linear array architecture
• A cost optimal parallel algorithm for weighted distance transforms.
• An alternative efficient chessboard representation based on 4-bit piece coding
• scientific article; zbMATH DE number 5642148 (Why is no real title available?)
• The equivalence of the chessboard distance transform and the medial axis transform^∗
• scientific article; zbMATH DE number 2040840 (Why is no real title available?)
• MIMD divide-and-conquer algorithms for the distance transformation. Part I: City Block distance
• MIMD divide-and-conquer algorithms for the distance transformation. Part II: Chamfer 3-4 distance

This page was built for publication: Optimal Computing the Chessboard Distance Transform on Parallel Processing Systems

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