Auto-dual connected operators based on iterative merging algorithms

Salembier Clairon, Philippe Jean; Garrido Ostermann, Luis; Garcia, D

View/Open

cSalembier98 (1).pdf (370,0Kb)

View Usage Statistics

Cita com:

Show full item record

Salembier Clairon, Philippe Jean

Garrido Ostermann, Luis

Garcia, D

Document typeConference report

Defense date1998

PublisherKluwer Academic Publishers

Rights accessOpen Access

Abstract

This paper proposes a new set of connected operators that are autodual. Classical connected operators are analyzed within the framework of merging algorithms. The discussion highlights three basic notions: merging order , merging criterion and region model. As a result a general merging algorithm is proposed. It can be used to create new connected operators and in particular autodual operators. Implementation issues are also discussed.

CitationSalembier, P., Garrido, L., Garcia, D. Auto-dual connected operators based on iterative merging algorithms. A: International Symposium Mathematical Morphology and Its Applications to Signal and Image. "Mathematical Morphology and its applications to image and signal processing". Amsterdam: Kluwer Academic Publishers, 1998, p. 183-190.

URIhttp://hdl.handle.net/2117/103577

ISBN0 7923 5133 9

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
cSalembier98 (1).pdf		370,0Kb	PDF	View/Open

Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain

UPCommons. Global access to UPC knowledge

Auto-dual connected operators based on iterative merging algorithms

View/Open

Browse