Work

Efficient sequential and parallel algorithms for morphological image processing

Year: 2004

Type: book

Abstract: A general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorithm can be easily parallelized on shared memory computers. The algorithm can be used for the computation of the exact Euclidean, Manhattan (L1 norm), and chessboard distance (L∞ norm) transforms.

Source: University of Groningen research database (University of Groningen / Centre for Information Technology)

Author: Arnold Meijster

Language: English

Topic: Digital Image Processing Techniques

Subfield: Computer Vision and Pattern Recognition

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1577459704

FWCI: 0.239

Cites: 89

Cited by: 14

Related to: 10