Salient Object Detection via Low-Rank and Structured Sparse Matrix Decomposition

Authors

  • Houwen Peng Chinese Academy of Sciences
  • Bing Li Chinese Academy of Sciences
  • Rongrong Ji Xiamen University
  • Weiming Hu Chinese Academy of Sciences
  • Weihua Xiong Chinese Academy of Sciences
  • Congyan Lang Beijing Jiaotong University

DOI:

https://doi.org/10.1609/aaai.v27i1.8591

Keywords:

Saliency Detection, Low Rank, Structured Sparsity, Matrix Decomposition

Abstract

Salient object detection provides an alternative solution to various image semantic understanding tasks such as object recognition, adaptive compression and image retrieval. Recently, low-rank matrix recovery (LR) theory has been introduced into saliency detection, and achieves impressed results. However, the existing LR-based models neglect the underlying structure of images, and inevitably degrade the associated performance. In this paper, we propose a Low-rank and Structured sparse Matrix Decomposition (LSMD) model for salient object detection. In the model, a tree-structured sparsity-inducing norm regularization is firstly introduced to provide a hierarchical description of the image structure to ensure the completeness of the extracted salient object. The similarity of saliency values within the salient object is then guaranteed by the $\ell _\infty$-norm. Finally, high-level priors are integrated to guide the matrix decomposition and enhance the saliency detection. Experimental results on the largest public benchmark database show that our model outperforms existing LR-based approaches and other state-of-the-art methods, which verifies the effectiveness and robustness of the structure cues in our model.

Downloads

Published

2013-06-30

How to Cite

Peng, H., Li, B., Ji, R., Hu, W., Xiong, W., & Lang, C. (2013). Salient Object Detection via Low-Rank and Structured Sparse Matrix Decomposition. Proceedings of the AAAI Conference on Artificial Intelligence, 27(1), 796-802. https://doi.org/10.1609/aaai.v27i1.8591