Perceptual grouping of segmented regions in color images

被引:36
作者
Luo, JB [1 ]
Guo, CE
机构
[1] Eastman Kodak Co, Res & Dev, Elect Imaging Prod, Rochester, NY 14650 USA
[2] Univ Calif Los Angeles, Dept Comp Sci, Ctr Image & Vis Sci, Los Angeles, CA 90095 USA
关键词
image segmentation; perceptual grouping; non-purposive grouping; Markov random field; energy functions;
D O I
10.1016/S0031-3203(03)00170-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Image segmentation is often the first yet important step of an image understanding system. However, general-purpose image segmentation algorithms that do not rely on specific object models still cannot produce perceptually coherent segmentation of regions at a level comparable to humans. Over-segmentation and under-segmentation have plagued the research community in spite of many significant advances in the field. Therefore, grouping of segmented region plays a significant role in bridging image segmentation and high-level image understanding. In this paper, we focused on non-purposive grouping (NPG), which is built on general expectations of a perceptually desirable segmentation as opposed to any object specific models, such that the grouping algorithm is applicable to any image understanding application. We propose a probabilistic model for the NPG problem by defining the regions as a Markov random field (MRF). A collection of energy functions is used to characterize desired single-region properties and pair-wise region properties. The single-region properties include region area, region convexity, region compactness, and color variances in one region. The pair-wise properties include color mean differences between two. regions; edge strength along the shared boundary; color variance of the cross-boundary area; and contour continuity between two regions. The grouping process is implemented by a greedy method using a highest confidence first (HCF) principle. Experiments have been performed on hundreds of color photographic images to show the effectiveness of the grouping algorithm using a set of fixed parameters. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:2781 / 2792
页数:12
相关论文
共 21 条
[1]  
AUGUST J, 1996, P IEEE INT C PATT RE
[2]   ECOLOGICAL CUE-VALIDITY OF PROXIMITY AND OF OTHER GESTALT FACTORS [J].
BRUNSWIK, E ;
KAMIYA, J .
AMERICAN JOURNAL OF PSYCHOLOGY, 1953, 66 (01) :20-32
[3]   THE THEORY AND PRACTICE OF BAYESIAN IMAGE LABELING [J].
CHOU, PB ;
BROWN, CM .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1990, 4 (03) :185-210
[4]  
CHRISTOUDIAS CM, 2002, P INT C PATT REC QUE
[5]   Mean shift: A robust approach toward feature space analysis [J].
Comaniciu, D ;
Meer, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (05) :603-619
[6]   Robust and efficient detection of salient convex groups [J].
Jacobs, DW .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1996, 18 (01) :23-37
[7]  
KINDRMAN R, 1980, MARKOV RANDOM FIELDS
[8]  
LUO J, 1997, P ICIP
[9]  
Luo J., UNPUB
[10]   EdgeFlow: A technique for boundary detection and image segmentation [J].
Ma, WY ;
Manjunath, BS .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2000, 9 (08) :1375-1388