TY - JOUR
T1 - Interactive natural image segmentation via spline regression
AU - Xiang, Shiming
AU - Nie, Feiping
AU - Zhang, Chunxia
AU - Zhang, Changshui
PY - 2009
Y1 - 2009
N2 - This paper presents an interactive algorithm for segmentation of natural images. The task is formulated as a problem of spline regression, in which the spline is derived in Sobolev space and has a form of a combination of linear and Green's functions. Besides its nonlinear representation capability, one advantage of this spline in usage is that, once it has been constructed, no parameters need to be tuned to data. We define this spline on the user specified foreground and background pixels, and solve its parameters (the combination coefficients of functions) from a group of linear equations. To speed up spline construction, K-means clustering algorithm is employed to cluster the user specified pixels. By taking the cluster centers as representatives, this spline can be easily constructed. The foreground object is finally cut out from its background via spline interpolation. The computational complexity of the proposed algorithm is linear in the number of the pixels to be segmented. Experiments on diverse natural images, with comparison to existing algorithms, illustrate the validity of our method.
AB - This paper presents an interactive algorithm for segmentation of natural images. The task is formulated as a problem of spline regression, in which the spline is derived in Sobolev space and has a form of a combination of linear and Green's functions. Besides its nonlinear representation capability, one advantage of this spline in usage is that, once it has been constructed, no parameters need to be tuned to data. We define this spline on the user specified foreground and background pixels, and solve its parameters (the combination coefficients of functions) from a group of linear equations. To speed up spline construction, K-means clustering algorithm is employed to cluster the user specified pixels. By taking the cluster centers as representatives, this spline can be easily constructed. The foreground object is finally cut out from its background via spline interpolation. The computational complexity of the proposed algorithm is linear in the number of the pixels to be segmented. Experiments on diverse natural images, with comparison to existing algorithms, illustrate the validity of our method.
KW - Interactive natural image segmentation
KW - K-means clustering
KW - Spline regression
UR - http://www.scopus.com/inward/record.url?scp=67649998525&partnerID=8YFLogxK
U2 - 10.1109/TIP.2009.2018570
DO - 10.1109/TIP.2009.2018570
M3 - Article
C2 - 19447712
AN - SCOPUS:67649998525
SN - 1057-7149
VL - 18
SP - 1623
EP - 1632
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
IS - 7
ER -