Data Flow Implementation of Erosion and Dilation

Data Flow Implementation of Erosion and Dilation

Christina Pacher
Copyright: © 2021 |Pages: 8
DOI: 10.4018/978-1-7998-7156-9.ch007
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This chapter describes a data flow implementation of the image processing algorithms Erosion and Dilation. Erosion and Dilation are basic image processing algorithms which are used to reduce or increase the size of objects in images, respectively, and which are used in a wide number of image processing applications. The chapter first describes the control flow versions of the algorithms in detail. Subsequently, the translation of these algorithms to the Data Flow paradigm is examined, and the details of the data flow implementation as well as possible optimizations are discussed.
Chapter Preview
Top

Control Flow Algorithms

In order to be able to successfully transfer the algorithms to data flow, it is necessary to first understand exactly how the control flow implementations work; for this reason, this section is concerned with a description of erosion and dilation in control flow. It is first necessary to specify some assumptions about the input data, before examining the logic behind the algorithms.

Assumptions

The implementation described here uses the same notion of an image that is employed by Phillips (2000), where each pixel corresponds to one integer number; this basically means that the processed image has only one colour channel (e.g. greyscale). However, the algorithms could just as well be applied to images with three colour channels; it would suffice to perform the operations on each of the colour channels separately and then re-combine the results.

It is also assumed that a pixel value of 0, which is the minimum possible value, denotes the background colour; all pixels with values other than 0 belong to objects. The maximum possible value is assumed to be 255. Of course the algorithms would also work if other values were specified as the minimum and maximum, but it is important that the range of possible values has to be known beforehand since this influences the values of constants in the code, as will be shown below in the discussion of the data flow implementation.

Complete Chapter List

Search this Book:
Reset