结构化 Krylov-SVD 分解的显著性目标检测算法-《计算机技术与发展》

文章信息/Info

Title:: Salient Object Detection Algorithm Based on Structured Krylov-SVD Decomposition

作者:: 郑维佳¹; 张荣国¹; 胡静¹; 赵建¹; 刘小君²; 1. 太原科技大学计算机科学与技术学院,山西太原 030024;
2. 合肥工业大学机械工程学院,安徽合肥 230009

Author(s):: ZHENG Wei-jia¹; ZHANG Rong-guo¹; HU Jing¹; ZHAO Jian¹; LIU Xiao-jun²; 1. School of Computer Science and Technology,Taiyuan University of Science and Technology,Taiyuan 030024,China;
2. School of Mechanical Engineering,Hefei University of Technology,Hefei 230009,China

Keywords:: salient object detection; structured low-rank matrix; Arnoldi model; Krylov-SVD decomposition; Index tree

摘要:: 针对低秩矩阵在图像显著性检测中,因凸松弛迭代奇异值分解导致的计算复杂度高及稀疏矩阵元素间潜在结构关系未充分考虑导致的显著图发散或不完整现象, 提出了一种结构化低秩矩阵 Krylov-SVD 分解的显著性目标检测算法。该算法对 Arnoldi 模型进行了深入研究,在 Krylov-Schur 重启算法的基础上对 Schur 分解进行改进,给出了 Krylov-SVD 奇异值分解算法,通过求其前 k 个特征值,对稀疏矩阵进行降阶处理,以降低计算复杂度;随后引入了索引树结构化稀疏范数,利用分层稀疏正则化来连接稀疏矩阵中元素之间的空间关系。实验中采用 MSRA10K、SOD 和 ECSSD 三个公开数据集、四种评价指标,与现有的十一种算法进行了对比实验。实验结果表明,该显著性目标检测算法在时间性能和精准性方面有着良好表现。

Abstract:: A salient object detection algorithm based on structured Krylov-SVD decomposition of low-rank matrices is proposed due to the high computational complexity caused by the convex relaxation iterative singular value decomposition and the incompleteness of the saliency map caused by the inadequate consideration of potential structural relationships between sparse matrix elements. The algorithm provides an in-depth study of the Arnoldi model,improves the Schur decomposition on the basis of the Krylov-Schur restart algorithm,and gives the Krylov -SVD singular value decomposition algorithm,which reduces the computational complexity by deregulating the sparse matrix by solving its first k eigenvalues. And then the index tree structured sparse parametric is introduced,and hierarchical sparse regularization is used to connect the spatial relationships between elements in the sparse matrix. Three public data sets,MSRA10K,SODand ECSSD,and four evaluation metrics are used in the experiments for comparison with eleven existing algorithms. The experiment shows that the proposed algorithm has better performance in terms of time performance and accuracy.