Home > Research > Publications & Outputs > Salient object detection employing a local tree...

Links

Text available via DOI:

View graph of relations

Salient object detection employing a local tree-structured low-rank representation and foreground consistency

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Salient object detection employing a local tree-structured low-rank representation and foreground consistency. / Zhang, Q.; Huo, Z.; Liu, Y. et al.
In: Pattern Recognition, Vol. 92, 01.08.2019, p. 119-134.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

APA

Vancouver

Zhang Q, Huo Z, Liu Y, Pan Y, Shan C, Han J. Salient object detection employing a local tree-structured low-rank representation and foreground consistency. Pattern Recognition. 2019 Aug 1;92:119-134. Epub 2019 Mar 23. doi: 10.1016/j.patcog.2019.03.023

Author

Zhang, Q. ; Huo, Z. ; Liu, Y. et al. / Salient object detection employing a local tree-structured low-rank representation and foreground consistency. In: Pattern Recognition. 2019 ; Vol. 92. pp. 119-134.

Bibtex

@article{427f76b02b334eaf8610bbf0c5fe801d,
title = "Salient object detection employing a local tree-structured low-rank representation and foreground consistency",
abstract = "We propose a local tree-structured low-rank representation (TS-LRR) model to detect salient objects under the complicated background with diverse local regions, which is problematic for most low-rank matrix recovery (LRMR) based salient object detection methods. We first impose a local tree-structured low-rank constraint on the representation coefficients matrix to capture the complicated background. Specifically, a primitive background dictionary is constructed for TS-LRR to promote its background representation ability, and thus enlarge the gap between the salient objects and the background. We then impose a group-sparsity constraint on the sparse error matrix with the intention to ensure the saliency consistency among patches with similar features. At last, a foreground consistency is introduced to identically highlight the distinctive regions within the salient object. Experimental results on three public benchmark datasets demonstrate the effectiveness and superiority of the proposed model over the state-of-the-art methods.",
keywords = "Background dictionary, Foreground consistency, Salient object detection, Structured low-rank representation, Forestry, Object recognition, Benchmark datasets, Coefficients matrixes, Low-rank matrix recoveries, Low-rank representations, Rank constraints, State-of-the-art methods, Object detection",
author = "Q. Zhang and Z. Huo and Y. Liu and Y. Pan and C. Shan and J. Han",
year = "2019",
month = aug,
day = "1",
doi = "10.1016/j.patcog.2019.03.023",
language = "English",
volume = "92",
pages = "119--134",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Ltd",

}

RIS

TY - JOUR

T1 - Salient object detection employing a local tree-structured low-rank representation and foreground consistency

AU - Zhang, Q.

AU - Huo, Z.

AU - Liu, Y.

AU - Pan, Y.

AU - Shan, C.

AU - Han, J.

PY - 2019/8/1

Y1 - 2019/8/1

N2 - We propose a local tree-structured low-rank representation (TS-LRR) model to detect salient objects under the complicated background with diverse local regions, which is problematic for most low-rank matrix recovery (LRMR) based salient object detection methods. We first impose a local tree-structured low-rank constraint on the representation coefficients matrix to capture the complicated background. Specifically, a primitive background dictionary is constructed for TS-LRR to promote its background representation ability, and thus enlarge the gap between the salient objects and the background. We then impose a group-sparsity constraint on the sparse error matrix with the intention to ensure the saliency consistency among patches with similar features. At last, a foreground consistency is introduced to identically highlight the distinctive regions within the salient object. Experimental results on three public benchmark datasets demonstrate the effectiveness and superiority of the proposed model over the state-of-the-art methods.

AB - We propose a local tree-structured low-rank representation (TS-LRR) model to detect salient objects under the complicated background with diverse local regions, which is problematic for most low-rank matrix recovery (LRMR) based salient object detection methods. We first impose a local tree-structured low-rank constraint on the representation coefficients matrix to capture the complicated background. Specifically, a primitive background dictionary is constructed for TS-LRR to promote its background representation ability, and thus enlarge the gap between the salient objects and the background. We then impose a group-sparsity constraint on the sparse error matrix with the intention to ensure the saliency consistency among patches with similar features. At last, a foreground consistency is introduced to identically highlight the distinctive regions within the salient object. Experimental results on three public benchmark datasets demonstrate the effectiveness and superiority of the proposed model over the state-of-the-art methods.

KW - Background dictionary

KW - Foreground consistency

KW - Salient object detection

KW - Structured low-rank representation

KW - Forestry

KW - Object recognition

KW - Benchmark datasets

KW - Coefficients matrixes

KW - Low-rank matrix recoveries

KW - Low-rank representations

KW - Rank constraints

KW - State-of-the-art methods

KW - Object detection

U2 - 10.1016/j.patcog.2019.03.023

DO - 10.1016/j.patcog.2019.03.023

M3 - Journal article

VL - 92

SP - 119

EP - 134

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

ER -