2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition 2010
DOI: 10.1109/cvpr.2010.5540036
|View full text |Cite
|
Sign up to set email alerts
|

Automatic image annotation using group sparsity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
95
1

Year Published

2012
2012
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 153 publications
(96 citation statements)
references
References 26 publications
0
95
1
Order By: Relevance
“…Also label interdependencies might result into corrupted distribution models. Another nearest-neighbour based method [5] tries to benefit from feature sparsity and clustering properties using a regularization based algorithm for feature selection. JEC [2] treats image annotation as retrieval.…”
Section: Related Workmentioning
confidence: 99%
“…Also label interdependencies might result into corrupted distribution models. Another nearest-neighbour based method [5] tries to benefit from feature sparsity and clustering properties using a regularization based algorithm for feature selection. JEC [2] treats image annotation as retrieval.…”
Section: Related Workmentioning
confidence: 99%
“…It can be seen that our method consistently improves performance over the conventional one-vs-rest SVM. Also, it performs comparable or better than even the recently proposed annotation methods such as [6,8,23] (except for IAPRTC-12 dataset where its performance is inferior only to the best results of [8]). We also compare with two SVM-based models [1,9].…”
Section: Discussionmentioning
confidence: 99%
“…We use the same evaluation criteria as being used by previous methods [6,8,11,19,23]. Given a new sample, first we compute the score for each label using the corresponding classifier, and then assign it the five top-scoring labels.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations