Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429)
DOI: 10.1109/icip.2003.1246750
|View full text |Cite
|
Sign up to set email alerts
|

Annotating retrieval database with active learning

Abstract: In this paper, we describe a retrieval system that uses hidden annotation to improve the performance. The contribution ofthis paper is a novel active learning framework that can improve the annotation efficiency. For each object in the database, we maintain a list of probabilities, each indicating the probability of this object having one of the attributes. This list of probabilities serves as the basis of our active learning algorithm, as well as semantic features to determine the similarity between objects i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 15 publications
0
13
0
Order By: Relevance
“…3). The images are classified by graduate stu-dents into 52 semantic categories (such as airplane, car, building; see [10]) based on their visual appearance; one image can belong to multiple categories. Based on this classification, we build a 1750 by 1750 similarity table S; S(i, j) = 1 if image I i and I j belong to a common category; S(i, j) = 0 otherwise.…”
Section: Methodsmentioning
confidence: 99%
“…3). The images are classified by graduate stu-dents into 52 semantic categories (such as airplane, car, building; see [10]) based on their visual appearance; one image can belong to multiple categories. Based on this classification, we build a 1750 by 1750 similarity table S; S(i, j) = 1 if image I i and I j belong to a common category; S(i, j) = 0 otherwise.…”
Section: Methodsmentioning
confidence: 99%
“…Wu et al define a representativeness measure for each sample according to its distance to nearby samples, and take it as a criterion of sample selection [18]. Zhang et al estimate data distribution p(x) by Kernel Density Estimation (KDE), and then take it into account in sample selection [13,20].…”
Section: Densitymentioning
confidence: 99%
“…Here we adopt a similar approach as that proposed in [20], by which p(x) is estimated by KDE as follows…”
Section: Densitymentioning
confidence: 99%
“…Some works use a thesaurus for annotation [5,7] to overcome the ambiguity problem. Some others pre-confine a small number of probable keywords for the image database [3,6,8] to alleviate both two problems. However the effectiveness of these approaches is modest.…”
Section: Introductionmentioning
confidence: 99%
“…Hidden annotation (HA) is an effective way to bridge this feature-to-concept gap [2][3][4][5][6][7][8], whose aim is to form highlevel semantic attributes for images. Most previous HA systems map an image into many keywords which directly reflect its semantic meaning, and combine the keyword information with low-level features to help retrieval.…”
Section: Introductionmentioning
confidence: 99%