2010
DOI: 10.1016/j.image.2010.10.002
|View full text |Cite
|
Sign up to set email alerts
|

Tag refinement in an image folksonomy using visual similarity and tag co-occurrence statistics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(16 citation statements)
references
References 36 publications
0
16
0
Order By: Relevance
“…We evaluated the effectiveness of image tag refinement by adopting the noise level (N L) metric [9] [15], which represents the proportion of noisy tags in the set of user-supplied tags of an image folksonomy. When N L is close to one, the number of noisy tags in a folksonomy is high.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…We evaluated the effectiveness of image tag refinement by adopting the noise level (N L) metric [9] [15], which represents the proportion of noisy tags in the set of user-supplied tags of an image folksonomy. When N L is close to one, the number of noisy tags in a folksonomy is high.…”
Section: Methodsmentioning
confidence: 99%
“…The authors of [15] formulate the problem of tag relevance estimation as a maximum a posteriori (MAP) problem. Given a seed image, the proposed approach computes a posteriori probability for each tag associated with a seed image, taking advantage of the observation that the Euclidean distance between folksonomy images that have been annotated with the same tag follows a Gaussian distribution in feature space.…”
Section: Related Workmentioning
confidence: 99%
“…Lee at al. propose a tag refinement technique that aims at differentiating noisy tag assignments from correct tag assignments (Lee et al, 2010). Each tag is assigned a probability of being noisy based on the visual similarity of the images and tag co-occurrence statistics.…”
Section: Related Workmentioning
confidence: 99%
“…Normalization in Asymmetric takes place by using frequency of one of the tags [65,100] as shown in Eq 8.…”
Section: Co-occurring Tagsmentioning
confidence: 99%