MORPHOLOGICAL MULTISCALE SEGMENTATION FOR IMAGE-CODING

被引:88
作者
SALEMBIER, P
机构
[1] Department of Signal Theory and Communications, E.T.S.E.T.B. - UPC, 08080 Barcelona
关键词
SEGMENTATION; IMAGE CODING; MATHEMATICAL MORPHOLOGY; MULTISCALE ANALYSIS;
D O I
10.1016/0165-1684(94)90155-4
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper is concerned with a hierarchical segmentation algorithm for image coding. It is based on mathematical morphology which is very attractive for this purpose. Indeed, morphology can efficiently deal with geometrical features such as size, shape, contrast or connectivity that can be considered as object-oriented, and therefore segmentation-oriented, features. The proposed algorithm follows a purely top-down procedure. It first takes into account the most global information of the image and produces a coarse (with a reduced number of regions) segmentation. Then, the segmentation is improved by introducing regions corresponding to more local information. Each segmentation stage relies on four basic steps: simplification, feature extraction, decision and quality estimation. The simplification removes information from the input image to make it easier to segment. Morphological filters based on reconstruction processes are proved to be very efficient for this purpose. The feature extraction, called marker extraction, identifies the presence of homogeneous regions. The goal of the decision is to locate precisely the contours of the regions detected by the feature extraction. This decision process is performed by the watershed algorithm. Finally, the quality estimation concentrates on an image, called the coding residue, all the information about the regions that have not been properly represented by the current segmentation. The procedure allows the introduction of the texture and contour coding schemes within the segmentation algorithm. The coding residue is transmitted to the next segmentation stage to improve the segmentation and coding quality. Examples of transformations which can fit within this structure are described and discussed. Finally, some segmentation and coding examples are presented to show the validity and interest of the coding approach.
引用
收藏
页码:359 / 386
页数:28
相关论文
共 30 条
[1]  
Birkoff, Lattice Theory, AMS Colloquium Publications, 25, (1983)
[2]  
Burt, Adelson, The Laplacian pyramid as a compact image code, IEEE Trans. Commun., 31 COM, pp. 532-540, (1983)
[3]  
Burt, Hong, Rosenfeld, Segmentation and estimation of image region properties through cooperative hierarchical computation, IEEE Trans. Systems Man Cybernetics, 11, pp. 802-809, (1981)
[4]  
Delp, Mitchell, Image compression using block truncation coding, IEEE Trans. Commun., 27 COM, 9, pp. 1335-1341, (1979)
[5]  
Eden, Kocher, On the performance of a contour coding algorithm in the context of image coding. Part I: Contour segment coding, Signal Processing, 8, 4, pp. 381-386, (1985)
[6]  
Geman, Geman, Stochastic relaxation, Gibbs distribution and the Bayesian restoration, IEEE Trans. Pattern Anal. Machine Intell., 6, pp. 721-741, (1984)
[7]  
Horowitz, Pavlidis, Picture segmentation by a directed split-and-merge procedure, Proc. 2nd Internat. Joint Conf. Pattern Recognition, pp. 424-433, (1974)
[8]  
Jain, Image data compression: A review, Proc. IEEE, 69, pp. 349-389, (1981)
[9]  
Kocher, Kunt, A contour-texture approach to picture coding, Proc. 1982 IEEE Internat. Conf. Acoust. Speech Signal Process, pp. 436-440, (1982)
[10]  
Kunt, Ikonomopoulos, Kocher, Second generation image-coding techniques, Proc. IEEE, 73, pp. 549-574, (1985)