An efficient algorithm to update non-flat and incremental attributes in morphological trees

Abstract

• An efficient algorithm to update non-flat and incremental attributes in morphological trees. • Concepts and properties about updating non-flat and incremental attributes in morphological trees. • Adaptations of filter rules to compute additional structures for updating non-flat and incremental attributes. • Our algorithm is suitable for improving computation of composition of attribute filters Attribute Filters are powerful image simplification operators that have very good contour-preservation properties. They can be efficiently computed using morphological trees. The most common strategy to compute attribute filters using morphological trees is based on three steps: ( i ) tree construction: the tree is built along with its attributes; ( i i ) filtering: we simplify the tree by removing some of its nodes based on some attribute and a filtering rule defined on a threshold value; and ( i i i ) image reconstruction: this is the final phase where the tree is converted back to an image leading to an attribute filter. However, after filtering a few attributes in tree may change (we call them as non-flat attributes) and they must be updated, when other attribute filters are applied to the simplified tree again, with either a different or the same threshold value. In this paper we present an efficient algorithm to update non-flat and incremental attributes in morphological trees with low memory consumption and fast computation.