Extensive partition operators, gray-level connected operators, and region merging/classification segmentation algorithms: Theoretical links

被引:20
作者
Gatica-Perez, D [1 ]
Gu, C
Sun, MT
Ruiz-Correa, S
机构
[1] Univ Washington, Dept Elect Engn, Seattle, WA 98195 USA
[2] Univ Washington, Human Interface Technol Lab, Seattle, WA 98195 USA
[3] Microsoft Corp, Redmond, WA 98052 USA
[4] Univ Washington, Dept Elect Engn, Seattle, WA 98195 USA
关键词
extensive partition operators; gray-level connected operators; mathematical morphology; operators on complete lattices; region merging/classification segmentation; algorithms;
D O I
10.1109/83.941857
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The relation between morphological gray-level connected operators and segmentation algorithms based on region merging/classification strategies has been pointed out several times in the recent literature. However, to the best of our knowledge, the formal relation between them has not been established. This paper presents the link between the two domains based on the observation that both connected operators and segmentation algorithms share a key mechanism: they simultaneously operate on images and on partitions, and therefore they can be described as operations on a joint image-partition model. As a result, we analyze both segmentation algorithms and connected operators by defining operators on complete product lattices, that explicitly model gray-level and partition attributes. In the first place, starting with a complete lattice of partitions, we initially define the concept of segmentation model as a mapping in a product lattice, whose elements are three-tuples consisting of a partition, an image that models the partition attributes, and an image that represents the gray-level model associated to the segmentation. Then, assuming a conditional ordering relation, we show that any region merging/classification segmentation algorithm can be defined as an extensive operator in such a complete product lattice. In the second place, we proposed a very similar lattice-based extended representation of gray-level functions in the context of connected operators, that highlights the mathematical analogy with segmentation algorithms, but in which the ordering relation is different. We use this framework to show that every region merging/classification segmentation algorithm indeed corresponds to a connected operator. While this result provides an explanation to previous work in the area, it also opens possibilities for further analysis in the two domains. From this perspective, we additionally study some theoretical properties of a general region merging segmentation algorithm.
引用
收藏
页码:1332 / 1345
页数:14
相关论文
共 33 条
[1]   Attribute openings, thinnings, and granulometries [J].
Breen, EJ ;
Jones, R .
COMPUTER VISION AND IMAGE UNDERSTANDING, 1996, 64 (03) :377-389
[2]   Video segmentation based on multiple features for interactive multimedia applications [J].
Castagno, R ;
Ebrahimi, T ;
Kunt, M .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 1998, 8 (05) :562-571
[3]  
CHALOM E, 1996, P IEEE INT C IM PROC, P643
[4]   The flat zone approach: A general low-level region merging segmentation method [J].
Crespo, J ;
Schafer, RW ;
Serra, J ;
Gratin, C ;
Meyer, F .
SIGNAL PROCESSING, 1997, 62 (01) :37-60
[5]   Theoretical aspects of morphological filters by reconstruction [J].
Crespo, J ;
Serra, J ;
Schafer, RW .
SIGNAL PROCESSING, 1995, 47 (02) :201-225
[6]  
Davey B., 1990, INTRO LATTICES ORDER
[7]   Extensive operators in partition lattices for image sequence analysis [J].
Garrido, L ;
Salembier, P ;
Garcia, D .
SIGNAL PROCESSING, 1998, 66 (02) :157-180
[8]   Motion analysis of image sequences using connected operators [J].
Garrido, L ;
Oliveras, A ;
Salembier, P .
VISUAL COMMUNICATIONS AND IMAGE PROCESSING '97, PTS 1-2, 1997, 3024 :546-557
[9]  
GATICAPEREZ D, 2000, P INT S MATH MORP 20
[10]   MORPHOLOGICAL OPERATORS FOR IMAGE SEQUENCES [J].
GOUTSIAS, J ;
HEIJMANS, HJAM ;
SIVAKUMAR, K .
COMPUTER VISION AND IMAGE UNDERSTANDING, 1995, 62 (03) :326-346