A general framework for tree-based morphology and its applications to self-dual filtering

Authors:
Alla Vichik;Renato Keshet;David Malah
Affiliations:
Electrical Engineering Department, Technion-Israel Institute of Technology, Haifa 32000, Israel;Hewlett Packard Laboratories - Israel, Technion City, Haifa 32000, Israel;Electrical Engineering Department, Technion-Israel Institute of Technology, Haifa 32000, Israel
Venue:
Image and Vision Computing
Year:
2010

Citing 12
Cited 0

The flat zone approach: a general low-level region merging segmentation method

Signal Processing
Extension of morphological operations to complete semilattices and its applications to image and video processing

ISMM '98 Proceedings of the fourth international symposium on Mathematical morphology and its applications to image and signal processing
Fundamenta morphologicae mathematicae

Fundamenta Informaticae - Special issue on mathematical morphology
Mathematical morphology on complete semilattices and its applications to image processing

Fundamenta Informaticae - Special issue on mathematical morphology
Inf-Semilattice Approach to Self-Dual Morphology

Journal of Mathematical Imaging and Vision
Grain Filters

Journal of Mathematical Imaging and Vision
Connected Operators Based on Region-Tree Pruning Strategies

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Shape-Tree Semilattice

Journal of Mathematical Imaging and Vision
Adjacency lattices and shape-tree semilattices

Image and Vision Computing
Reconstructing masks from markers in non-distributive lattices

Applicable Algebra in Engineering, Communication and Computing
Fast computation of a contrast-invariant image representation

IEEE Transactions on Image Processing
Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a tree-based framework for producing self-dual morphological operators, based on a tree-representation complete inf-semilattice (CISL). The idea is to use a self-dual tree transform to map a given image into the above CISL, perform one or more morphological operations there, and map the result back to the image domain using the inverse tree transform. We also present a particular case of this general framework, involving a new tree transform, the Extrema-Watershed Tree (EWT). The operators obtained by using the EWT in the above framework behave like classical morphological operators, but in addition are self-dual. Some application examples are provided: pre-processing for OCR and dust and scratch removal algorithms, and image denoising. We also explore first steps towards obtaining tree transforms that induce a CISL on the image domain as well.