Please wait a minute...
浙江大学学报(工学版)  2024, Vol. 58 Issue (5): 979-987    DOI: 10.3785/j.issn.1008-973X.2024.05.011
计算机技术、通信技术     
稀疏分解和图拉普拉斯正则化的图像前景背景分割方法
谭婷芳1(),蔡万源1,蒋俊正1,2,3,*()
1. 桂林电子科技大学 信息与通信学院,广西壮族自治区 桂林 541004
2. 桂林电子科技大学 卫星导航定位与位置服务国家地方联合工程研究中心,广西壮族自治区 桂林 541004
3. 西安电子科技大学 杭州研究院,浙江 杭州 311231
Image foreground-background segmentation method based on sparse decomposition and graph Laplacian regularization
Tingfang TAN1(),Wanyuan CAI1,Junzheng JIANG1,2,3,*()
1. School of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, China
2. State and Local Joint Engineering Research Center for Satellite Navigation and Location Service, Guilin University of Electronic Technology, Guilin 541004, China
3. Hangzhou Institute of Technology, Xidian University, Hangzhou 311231, China
 全文: PDF(1796 KB)   HTML
摘要:

针对现有图像前景背景分割方法的分割结果存在孤立像素点的问题,利用图信号处理理论和稀疏分解模型,提出新的图像前景背景分割方法. 将图像的内在结构建模为图,通过图模型有效地刻画像素之间的内在关联性. 将图像的像素强度建模为图信号,其中图像背景作为平滑分量,由一组图傅里叶变换基函数线性表示,叠加在背景上的前景为稀疏分量,前景像素间的连通性可由图拉普拉斯正则化项进行刻画. 将图像前景背景分割问题归结为包含稀疏分解模型和图拉普拉斯正则化项的约束优化问题,采用交替方向乘子法对该优化问题进行求解. 实验结果表明,与现有的其他方法相比,所提方法具有更好的分割效果.

关键词: 图信号处理图拉普拉斯正则化图傅里叶变换基函数稀疏分解前景背景分割    
Abstract:

A new method for segmenting the foreground and background of images was proposed by using the graph signal processing theory and sparse decomposition model aiming at the problem of isolated pixel points in the segmentation results of existing image foreground-background segmentation methods. The intrinsic structure of an image was modeled as a graph, and the intrinsic correlation between pixels was effectively characterized by the graph model. The pixel intensity of the image was modeled as a graph signal. The image background was linearly represented as a smooth component by a set of graph Fourier transform basis functions, the foreground overlaid on the background was a sparse component, and the connectivity between foreground pixels could be characterized by the graph Laplacian regularization term. The image foreground-background segmentation problem was reduced to a constrained optimization problem incorporating the sparse decomposition model and graph Laplacian regularization term, and the alternating direction multiplier method was adopted to solve the optimization problem. The experimental results show that the proposed method has better segmentation performance compared with other existing methods.

Key words: graph signal processing    graph Laplacian regularization    graph Fourier transform basis function    sparse decomposition    foreground-background segmentation
收稿日期: 2023-07-03 出版日期: 2024-04-26
CLC:  TN 911  
基金资助: 国家自然科学基金资助项目(62171146, 62261014);广西创新驱动发展专项资助项目(桂科AA21077008);广西自然科学杰出青年基金资助项目(2021GXNSFFA220004);广西科技基地和人才专项资助项目(桂科AD21220112);桂林电子科技大学研究生教育创新计划资助项目(2022YCXS039).
通讯作者: 蒋俊正     E-mail: 21022303141@mails.guet.edu.cn;jzjiang@guet.edu.cn
作者简介: 谭婷芳(1997—),女,硕士生,从事图信号处理理论与应用研究. orcid.org/0000-0001-6882-6317. E-mail:21022303141@mails.guet.edu.cn
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
作者相关文章  
谭婷芳
蔡万源
蒋俊正

引用本文:

谭婷芳,蔡万源,蒋俊正. 稀疏分解和图拉普拉斯正则化的图像前景背景分割方法[J]. 浙江大学学报(工学版), 2024, 58(5): 979-987.

Tingfang TAN,Wanyuan CAI,Junzheng JIANG. Image foreground-background segmentation method based on sparse decomposition and graph Laplacian regularization. Journal of ZheJiang University (Engineering Science), 2024, 58(5): 979-987.

链接本文:

https://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2024.05.011        https://www.zjujournals.com/eng/CN/Y2024/V58/I5/979

算法 基于SDGLR的图像前景背景分割算法输入:原始图像,图像块大小$ l = 64 $,正则化参数$ \tau = 0.15 $$ \gamma = 0.5 $,GFT基函数的数量$ M = 10 $. 1)初始化:前景$ {\boldsymbol{s}} = {\boldsymbol{0}} $. 2)将原始图像分成$ {r_{\max }} $个大小为$ l \times l $的非重叠图像块. 3)对第$ r $个图像块执行以下迭代过程,其中$ r = 1:{r_{\max }} $. a)初始化变量:$ {{\boldsymbol{\alpha }}_r} = {{\boldsymbol{x}}_r} = {{\boldsymbol{y}}_r} = {{\boldsymbol{s}}_r} = {\boldsymbol{0}} $,乘子$ {{\boldsymbol{u}}_r} = {{\boldsymbol{v}}_r} = {{\boldsymbol{w}}_r} = {\boldsymbol{0}} $,惩罚项参数$ \rho = {10^{ - 2}} $及其最大值$ {\rho _{\max }} = {10^6} $,惩罚参数的增长系数$ \eta = 1.5 $$ k = 0 $$ {k_{\max }} = 50 $${\varepsilon _1} = {\varepsilon _2} = $$ {\varepsilon _3} = {10^{ - 6}} $.b)对第$ r $个图像块进行图模型建模,计算图拉普拉斯矩阵$ {{\boldsymbol{L}}_{{G_r}}} $,对$ {{\boldsymbol{L}}_{{G_r}}} $进行特征分解得到GFT基函数.c)更新$ {\boldsymbol{\alpha }}_r^{(k+1)} $$ {\boldsymbol{x}}_r^{(k+1)} $$ {\boldsymbol{y}}_r^{(k+1)} $$ {\boldsymbol{s}}_r^{(k+1)} $$ {\boldsymbol{u}}_r^{(k+1)} $$ {\boldsymbol{v}}_r^{(k+1)} $$ {\boldsymbol{w}}_r^{(k+1)} $$ \rho : = \min \;\left\{ {\eta \rho ,\;{\rho _{\max }}} \right\} $.d)检查是否达到最大迭代次数或满足收敛条件.e)输出第$ r $个图像块的前景$ {{\boldsymbol{s}}_r} $.4)将$ {{\boldsymbol{s}}_1}, \cdots ,{{\boldsymbol{s}}_{{r_{{\mathrm{max}}}}}} $赋值到前景$ {\boldsymbol{s}} $.输出:前景$ {\boldsymbol{s}} $.
  
图 1  采用不同方法得到的合成图像分割结果对比
图 2  不同方法在MSRA数据集上的分割结果对比
图 3  采用不同方法得到的屏幕内容图像分割结果对比
方法图1的第1张测试图图1的第2张测试图平均值
PRF1PRF1PRF1
LRSD73.1171.4972.2984.5783.9884.2778.8477.7478.28
LAD80.8382.0881.4583.1379.6481.3581.9880.8681.40
SDTVM85.9982.6384.2888.3375.0481.1487.1682.6382.71
SR72.2677.9274.9985.3988.1486.7478.8383.0380.87
SD-GFT98.3382.9790.0092.1286.6989.3395.8384.8383.24
SDGLR99.4584.3491.2899.7885.5292.1099.6284.9391.69
表 1  不同方法在合成图像上的分割性能对比
方法图2的第1张测试图图2的第2张测试图图2的第3张测试图图2的第4张测试图平均值
PRF1PRF1PRF1PRF1PRF1
LRSD75.5677.9676.7481.4784.5082.9684.4483.7784.1088.1394.9391.4082.4085.2983.80
LAD50.9968.1458.3384.6577.1780.7458.4558.0958.2762.5061.1561.8264.1566.1464.79
SDTVM56.0982.2766.6383.2672.7677.6541.6452.9146.6142.9372.8154.0155.9870.1961.23
SR83.0285.7184.355.8540.8610.2478.5779.2578.9182.3980.0581.2062.4671.4763.68
SD-GFT89.4286.8188.1094.7787.5391.0185.3480.0982.6394.0457.3371.2390.8977.9483.24
SDGLR91.5389.7890.6494.7987.5391.0191.1384.7187.8094.0557.5071.3792.8879.8885.21
表 2  不同方法在MSRA数据集上的分割性能对比
图 4  参数τ的灵敏度分析
图 5  参数γ的灵敏度分析
图 6  不同基函数数量下提出方法的分割结果
图 7  不同图像块大小下提出方法的分割结果
图 8  F1与迭代次数的关系
1 MUKHERJEE D, CHRYSAFIS C, SAID A. JPEG2000-matched MRC compression of compound documents [C]// Proceedings. International Conference on Image Processing . Rochester: IEEE, 2002.
2 WANG G, LI W, ZULUAGA M A, et al Interactive medical image segmentation using deep learning with image-specific fine tuning[J]. IEEE Transactions on Medical Imaging, 2018, 37 (7): 1562- 1573
doi: 10.1109/TMI.2018.2791721
3 YIN X C, ZUO Z Y, TIAN S, et al Text detection, tracking and recognition in video: a comprehensive survey[J]. IEEE Transactions on Image Processing, 2016, 25 (6): 2752- 2773
doi: 10.1109/TIP.2016.2554321
4 LIN T, HAO P Compound image compression for real-time computer screen image transmission[J]. IEEE Transactions on Image Processing, 2005, 14 (8): 993- 1005
doi: 10.1109/TIP.2005.849776
5 BOTTOU L, HAFFNER P, HOWARD P G, et al High quality document image compression with "DjVu"[J]. Journal of Electronic Imaging, 1998, 7 (3): 410- 425
doi: 10.1117/1.482609
6 MINAEE S, WANG Y. Screen content image segmentation using least absolute deviation fitting [C]// IEEE International Conference on Image Processing . Quebec City: IEEE, 2015: 3295-3299.
7 MINAEE S, WANG Y. Screen content image segmentation using sparse decomposition and total variation minimization [C]// IEEE International Conference on Image Processing . Phoenix: IEEE, 2016: 3882-3886.
8 MINAEE S, WANG Y An ADMM approach to masked signal decomposition using subspace representation[J]. IEEE Transactions on Image Processing, 2019, 28 (7): 3192- 3204
doi: 10.1109/TIP.2019.2894966
9 HU W, PANG J, LIU X, et al Graph signal processing for geometric data and beyond: theory and applications[J]. IEEE Transactions on Multimedia, 2021, 24: 3961- 3977
10 ORTEGA A, FROSSARD P, KOVAČEVIĆ J, et al Graph signal processing: overview, challenges, and applications[J]. Proceedings of the IEEE, 2018, 106 (5): 808- 828
doi: 10.1109/JPROC.2018.2820126
11 SHUMAN D I, NARANG S K, FROSSARD P, et al The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains[J]. IEEE Signal Processing Magazine, 2013, 30 (3): 83- 98
doi: 10.1109/MSP.2012.2235192
12 ABIKO K, URUMA K, SUGAWARA M, et al. Image segmentation based graph-cut approach to fast color image coding via graph Fourier transform [C]// IEEE Visual Communications and Image Processing . Sydney: IEEE, 2019: 457-460.
13 BOGACH I V, LUPIAK D D, IVANOV Y Y, et al. Analysis and experimental research of modifications of the image segmentation method using graph theory [C]// International Siberian Conference on Control and Communications . Tomsk: IEEE, 2019: 490-493.
14 HU W, CHEUNG G, ORTEGA A, et al Multiresolution graph Fourier transform for compression of piecewise smooth images[J]. IEEE Transactions on Image Processing, 2015, 24 (1): 419- 433
doi: 10.1109/TIP.2014.2378055
15 PANG J, CHEUNG G Graph Laplacian regularization for image denoising: analysis in the continuous domain[J]. IEEE Transactions on Image Processing, 2017, 26 (4): 1770- 1785
doi: 10.1109/TIP.2017.2651400
16 刘娜, 李伟, 陶然 图信号处理在高光谱图像处理领域的典型应用[J]. 电子与信息学报, 2023, 45 (5): 1529- 1540
LIU Na, LI Wei, TAO Ran Typical application of graph signal processing in hyperspectral image processing[J]. Journal of Electronics and Information Technology, 2023, 45 (5): 1529- 1540
17 DONG X, THANOU D, TONI L, et al Graph signal processing for machine learning: a review and new perspectives[J]. IEEE Signal Processing Magazine, 2020, 37 (6): 117- 127
doi: 10.1109/MSP.2020.3014591
18 CAI W, JIANG J, OUYANG S Hyperspectral image denoising using adaptive weight graph total variation regularization and low-rank matrix recovery[J]. IEEE Geoscience and Remote Sensing Letters, 2021, 19: 1- 5
19 ACHANTA R, HEMAMI S, ESTRADA F, et al. Frequency-tuned salient region detection [C]// IEEE Conference on Computer Vision and Pattern Recognition . Miami: IEEE, 2009: 1597-1604.
20 MIN X, MA K, GU K, et al Unified blind quality assessment of compressed natural, graphic, and screen content images[J]. IEEE Transactions on Image Processing, 2017, 26 (11): 5462- 5474
doi: 10.1109/TIP.2017.2735192
21 JIANG J, FENG H, TAY D B, et al Theory and design of joint time-vertex nonsubsampled filter banks[J]. IEEE Transactions on Signal Processing, 2021, 69: 1968- 1982
doi: 10.1109/TSP.2021.3064984
22 TAY D B, JIANG J Time-varying graph signal denoising via median filters[J]. IEEE Transactions on Circuits and Systems II: Express Briefs, 2021, 68 (3): 1053- 1057
23 SANDRYHAILA A, MOURA J M F Big data analysis with signal processing on graphs: representation and processing of massive data sets with irregular structure[J]. IEEE Signal Processing Magazine, 2014, 31 (5): 80- 90
doi: 10.1109/MSP.2014.2329213
24 THANOU D, FROSSARD P. Multi-graph learning of spectral graph dictionaries [C]// IEEE International Conference on Acoustics, Speech and Signal Processing . South Brisbane: IEEE, 2015: 3397-3401.
25 QIU K, MAO X, SHEN X, et al Time-varying graph signal reconstruction[J]. IEEE Journal of Selected Topics in Signal Processing, 2017, 11 (6): 870- 883
doi: 10.1109/JSTSP.2017.2726969
26 QI W, GUO S, HU W Generic reversible visible watermarking via regularized graph Fourier transform coding[J]. IEEE Transactions on Image Processing, 2021, 31: 691- 705
27 CHEUNG G, MAGLI E, TANAKA Y, et al Graph spectral image processing[J]. Proceedings of the IEEE, 2018, 106 (5): 907- 930
doi: 10.1109/JPROC.2018.2799702
28 LIU M, WEI Y. Image denoising using graph-based frequency domain low-pass filtering [C]// IEEE 4th International Conference on Image, Vision and Computing. Xiamen: IEEE, 2019: 118-122.
29 KE G Y, PAN Y, YIN J, et al Optimizing evaluation metrics for multitask learning via the alternating direction method of multipliers[J]. IEEE Transactions on Cybernetics, 2017, 48 (3): 993- 1006
30 孙菲, 厉小润, 赵辽英, 等 基于FrFT变换和全变分正则化的异常检测算法[J]. 浙江大学学报:工学版, 2022, 56 (7): 1276- 1284
SUN Fei, LI Xiaorun, ZHAO Liaoying, et al Anomaly detection algorithm based on FrFT transform and total variation regularization[J]. Journal of Zhejiang University: Engineering Science, 2022, 56 (7): 1276- 1284
31 BOYD S, PARIKH N, CHU E, et al Distributed optimization and statistical learning via the alternating direction method of multipliers[J]. Foundations and Trends in Machine Learning, 2011, 3 (1): 1- 122
32 ZHANG Y, CHANDLER D M, MOU X Quality assessment of screen content images via convolutional-neural-network-based synthetic/natural segmentation[J]. IEEE Transactions on Image Processing, 2018, 27 (10): 5113- 5128
doi: 10.1109/TIP.2018.2851390
33 ARAVKIN A, BECKER S, CEVHER V, et al. A variational approach to stable principal component pursuit [EB/OL]. [2014-06-04]. https://arxiv.org/abs/1406.1089.
[1] 李文娟,邓洪高,马谋,蒋俊正. 基于图信号处理的传染病传播预测方法[J]. 浙江大学学报(工学版), 2022, 56(5): 1017-1024.