Share Email Print

Proceedings Paper

Co-saliency detection via cluster-based structured matrix decomposition
Author(s): Zhengyi Liu; Song Shi; Quntao Duan
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Aiming at automatically discovering the common objects among a group of relevant and similar images as foreground, co-saliency has become a hot topic in recent years. Previous works utilize low-rank matrix recovery on the single image, but neglect the relationship between a set of images. In this paper, we propose a novel framework to capture the coherence of common salient objects, and solve the problem when the background is clatter. The model include a novel cluster-based tree-structured sparsity-including regularization that make regions from same class have identical saliency value, and a Laplacian constraint regularization is also integrated into the model, the propose is to enlarge the gaps between common objects and background in original feature space and smooth the saliency value in same cluster. Furthermore, to facilitate the efficient, a coherence weight is identified and integrated into the model. Experiment results on three benchmark datasets demonstrate are the performance of our method compared to other stateof-the-art co-saliency models.

Paper Details

Date Published: 6 May 2019
PDF: 12 pages
Proc. SPIE 11069, Tenth International Conference on Graphics and Image Processing (ICGIP 2018), 110691R (6 May 2019); doi: 10.1117/12.2524404
Show Author Affiliations
Zhengyi Liu, Anhui Univ. (China)
Song Shi, Anhui Univ. (China)
Quntao Duan, Anhui Univ. (China)

Published in SPIE Proceedings Vol. 11069:
Tenth International Conference on Graphics and Image Processing (ICGIP 2018)
Chunming Li; Hui Yu; Zhigeng Pan; Yifei Pu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?