By Topic

Connected operators

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Salembier, P. ; Ecole Polytech., Paris, France ; Wilkinson, M.H.F.

Connected operators are filtering tools that act by merging elementary regions called flat zones. Connecting operators cannot create new contours nor modify their position. Therefore, they have very good contour-preservation properties and are capable of both low-level filtering and higher-level object recognition. This article gives an overview on connected operators and their application to image and video filtering. There are two popular techniques used to create connected operators. The first one relies on a reconstruction process. The operator involves first a simplification step based on a "classical" filter and then a reconstruction process. In fact, the reconstruction can be seen as a way to create a connected version of an arbitrary operator. The simplification effect is defined and limited by the first step. The examples we show include simplification in terms of size or contrast. The second strategy to define connected operators relies on a hierarchical region-based representation of the input image, i.e., a tree, computed in an initial step. Then, the simplification is obtained by pruning the tree, and, third, the output image is constructed from the pruned tree. This article presents the most important trees that have been used to create connected operators and also discusses important families of simplification or pruning criteria. We also give a brief overview on efficient implementations of the reconstruction process and of tree construction. Finally, the possibility to define and to use nonclassical notions of connectivity is discussed and illustrated.

Published in:

Signal Processing Magazine, IEEE  (Volume:26 ,  Issue: 6 )