Proceedings of the 18th ACM International Conference on Multimedia 2010
DOI: 10.1145/1873951.1874028
|View full text |Cite
|
Sign up to set email alerts
|

Image tag refinement towards low-rank, content-tag prior and error sparsity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
168
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 225 publications
(168 citation statements)
references
References 20 publications
0
168
0
Order By: Relevance
“…this method also account for the calculated stabletag count through its occurrence.  Zhu et al [16] proposed RobustPCA method [6]. This method is based on analyzing the main powerful factors, D matrix (tag and image) is factorization by analysis of low Ran k decomposition with error scarcity and it is D=Ď+E in which Ď has a low rank constraint based on the nuclear norm, and E is an error mat rix with l 1 -normsparsity constraint.…”
Section:  mentioning
confidence: 99%
“…this method also account for the calculated stabletag count through its occurrence.  Zhu et al [16] proposed RobustPCA method [6]. This method is based on analyzing the main powerful factors, D matrix (tag and image) is factorization by analysis of low Ran k decomposition with error scarcity and it is D=Ď+E in which Ď has a low rank constraint based on the nuclear norm, and E is an error mat rix with l 1 -normsparsity constraint.…”
Section:  mentioning
confidence: 99%
“…Recently, a promising work for tag refinement was presented in [24], where Zhu et al proposed to decompose a user-provided tag matrix into a low-rank refined matrix and a sparse error matrix. The work in [24] is effective for a global tag refinement; however, it may not be appropriate to our problem here as each entry in our tag matrices represents a score and our objective is to tune the scores locally (a global tag refinement may obscure the experimental results of our proposed approaches).…”
Section: Tag Refinementmentioning
confidence: 99%
“…The work in [24] is effective for a global tag refinement; however, it may not be appropriate to our problem here as each entry in our tag matrices represents a score and our objective is to tune the scores locally (a global tag refinement may obscure the experimental results of our proposed approaches). As a result, we modified the approach of learning class-specific weights for the searching of visually similar images in [25] to fit our needs.…”
Section: Tag Refinementmentioning
confidence: 99%
“…Wang et al [28] address the tag optimization problem given the tagging labels of images obtained by a classifier; Zhu et al [31] propose a classification method to address the noisy tagging problem; neither of the methods explicitly tackles the incomplete tagging problem. Liu et al [18] propose a solution that denoises the noisy tagging and enriches the incomplete tagging, while their enrichment can only add synonyms and hypernyms, and needs the availability and assistance from WordNet.…”
Section: Related Workmentioning
confidence: 99%
“…Liu et al [18] propose a solution that denoises the noisy tagging and enriches the incomplete tagging, while their enrichment can only add synonyms and hypernyms, and needs the availability and assistance from WordNet. In addition, the classification solutions in [18] and [31] are not inductive in learning.…”
Section: Related Workmentioning
confidence: 99%