[en] Two new families of algorithms for computing openings of binary and label images are presented in this paper. The first family of algorithms is based on an horizontal scan, and a vertical scan that takes the result of the horizontal scan as input. With the results of these two scans it is possible to compute an opening with respect to a rectangle of any size. The second family of algorithms is based on the construction of an exhaustive list of rectangles included in an object. Rectangles of this list all have a maximal extension, i.e. no larger rectangle included in a region contains them. The opening then results from filling the output image with rectangles larger than the structuring element. After a description of the algorithms we provide a comparison of several algorithms in terms of computation time efficiency. The comparison shows that some of the new algorithms advantageously compete with existing algorithms.
Research center :
Intelsig
Disciplines :
Electrical & electronics engineering
Author, co-author :
Van Droogenbroeck, Marc ; Université de Liège - ULiège > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Télécommunications
Language :
English
Title :
Algorithms for openings of binary and label images with rectangular structuring elements
Publication date :
April 2002
Event name :
International Symposium on Mathematical morphology (ISMM)
Event place :
Sydney, Australia
Event date :
April
Audience :
International
Main work title :
International Symposium on Mathematical morphology (ISMM)