Title of article :
Antiextensive connected operators for image and sequence processing
Author/Authors :
Philippe Salembier، نويسنده , , P.، نويسنده , , Oliveras، نويسنده , , A.، نويسنده , , Garrido، نويسنده , , L.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
This paper deals with a class of morphological
operators called connected operators. These operators filter the
signal by merging its flat zones. As a result, they do not create
any new contours and are very attractive for filtering tasks
where the contour information has to be preserved. This paper
shows that connected operators work implicitly on a structured
representation of the image made of flat zones. The max-tree is
proposed as a suitable and efficient structure to deal with the
processing steps involved in antiextensive connected operators.
A formal definition of the various processing steps involved
in the operator is proposed and, as a result, several lines of
generalization are developed. First, the notion of connectivity and
its definition are analyzed. Several modifications of the traditional
approach are presented. They lead to connected operators that
are able to deal with texture. They also allow the definition of
connected operators with less leakage than the classical ones.
Second, a set of simplification criteria are proposed and discussed.
They lead to simplicity-, entropy-, and motion-oriented operators.
The problem of using a nonincreasing criterion is analyzed. Its
solution is formulated as an optimization problem that can be
very efficiently solved by a Viterbi algorithm. Finally, several
implementation issues are discussed showing that these operators
can be very efficiently implemented.
Keywords :
watershed. , Connected operators , connectivity , Mathematicalmorphology , motion criterion , optimization , sequence processing , Viterbi algorithm , simplicity criterion
Journal title :
IEEE TRANSACTIONS ON IMAGE PROCESSING
Journal title :
IEEE TRANSACTIONS ON IMAGE PROCESSING