2009
DOI: 10.1016/j.patcog.2008.04.012
|View full text |Cite
|
Sign up to set email alerts
|

Image annotation via graph learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
106
0
2

Year Published

2011
2011
2024
2024

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 179 publications
(109 citation statements)
references
References 6 publications
1
106
0
2
Order By: Relevance
“…Importantly, it also improves over state-of-the-art TagProp alone. Therefore, our method also improves over other works such as [9,13], which were outperformed by TagProp (see scores for MBRM or TGLM within [11]). …”
Section: Experimental Evaluationmentioning
confidence: 63%
See 1 more Smart Citation
“…Importantly, it also improves over state-of-the-art TagProp alone. Therefore, our method also improves over other works such as [9,13], which were outperformed by TagProp (see scores for MBRM or TGLM within [11]). …”
Section: Experimental Evaluationmentioning
confidence: 63%
“…In recent years, automatic image annotation has received increasing attention [11,13,17,18]. In its basic version, which we call image-level annotation, the task is to assign a few semantic labels to a test image, roughly describing its contents ( fig.…”
Section: Introductionmentioning
confidence: 99%
“…The random walk algorithm has also been studied in the domains of unsupervised image segmentation [19] and multi-class classification [43]. Finally, random walk algorithms have also been explored in the area of image retrieval [11,18,22,26,28,30,34,46], where the main advantages of such approaches are: 1) the ability to use visual and non-visual cues in the random walk procedure, 2) the potential to extend the method to large-scale databases, and 3) the relatively facility to adapt the method to dynamic problems, where new images and labels are continuously introduced into the database.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Note that this assumption is important to uncover the aforementioned influence of art prints over other artistic productions (and also over other art prints). Specifically, we explore the following graph-based algorithms [6,35,50]: label propagation [18,28,34,46], random walk [11], stationary solution using a stochastic matrix [30], and combinatorial harmonic [19]. We adapt each of those techniques to a bag of visual words (BOV) approach, and we compare their performance with BOV approaches that use the following classifiers: support vector machines (SVM) [45], and random forests (RF) [7].…”
Section: Introductionmentioning
confidence: 99%
“…Being aware of this, we propose an improved graph learning framework to resolve such issue. Graph-based methods [4] have achieved much success in the field of image retrieval [5] and automatic image annotation [8], which formulated the image retrieval task as a semi-supervised learning problem. Specifically, [5] take the user's query image as a labeled data and the images in the dataset as the unlabeled data, then the labels are propagated from the labeled data to the unlabeled data along their underlying manifold by analyzing their relationship in Euclidean space.…”
Section: An Improved Graph Learning Algorithmmentioning
confidence: 99%