Thesis (PDF) - Signal & Image Processing Lab
Thesis (PDF) - Signal & Image Processing Lab
Thesis (PDF) - Signal & Image Processing Lab
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
8 CHAPTER 1. INTRODUCTION<br />
disadvantages:<br />
1. Are not really self-dual (see [1, 3]).<br />
2. Allow to design filters (see [9, 8, 10, 11]), but not openings (or erosions, etc.).<br />
3. Need a reference image (like in the reference semilattices, developed by Keshet<br />
[4], and further studied by Heijmans and Keshet in [5]).<br />
The erosion and opening operators that are based on the BTV Transform suffer<br />
from a “trench” problem. The “trench” problem arises, especially in complex gray-<br />
scale images, when the operators are applied (see Fig. 4.3(b)). Our initial goal in<br />
this research was to solve this problem. Afterwards, the next goal was to design<br />
improved self-dual morphological operators that are not necessary connected, and to<br />
check application possibilities for the new operators.<br />
1.3 Original contributions<br />
Initially, an efficient implementation of self-dual morphological operators in Boundary-<br />
Topographic-Variation (BTV) domain, is proposed. In addition, the “trench” problem<br />
introduced by the BTV morphological operators is studied and a few solutions are<br />
proposed.<br />
We also noticed that an efficient implementation of these morphological operators<br />
is achieved by first transforming the input image into an appropriate tree represen-<br />
tation.<br />
While working on our research, another, more robust semilattice (without trench<br />
problems) was introduced by Keshet [17]. This new semilattice is based on yet another<br />
tree representation, the tree of shapes, proposed by Monasse and Guichard [12, 13]<br />
(see also [14, 15]). The tree of shape is slightly different from that of the BTV.<br />
Notice that both the BTV and the shape tree semilattices, and their corresponding<br />
morphological operators, can be directly associated to self-dual tree representations.<br />
There are many other self-dual tree representations in the literature. For instance,<br />
Salembier and Garrido proposed a Binary Partition Tree for hierarchical segmenta-<br />
tion in [10, 11]. These tree representations are usually used for obtaining connected<br />
filtering operations on an image; however, they do not yield non-connected operators,