EUROCON 2005 - The International Conference on "Computer as a Tool" 2005
DOI: 10.1109/eurcon.2005.1629880
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Content-Based Image Retrieval with Relevance Feedback

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(7 citation statements)
references
References 14 publications
0
7
0
Order By: Relevance
“…We decided to use maximal and minimal value of detail, and their positions, as characteristic features, as described in previous section. Precision =TP/(TP+FP) (8) The goal of experiment here is to assess whether it is possible to distinguish a performer. Observe that the song Something Stupid in the database is performed by two performers: Robbie Williams and Frank Sinatra.…”
Section: B Two-class Problemmentioning
confidence: 99%
“…We decided to use maximal and minimal value of detail, and their positions, as characteristic features, as described in previous section. Precision =TP/(TP+FP) (8) The goal of experiment here is to assess whether it is possible to distinguish a performer. Observe that the song Something Stupid in the database is performed by two performers: Robbie Williams and Frank Sinatra.…”
Section: B Two-class Problemmentioning
confidence: 99%
“…Each class consists of 100 similar images, labeled by numerals, for instance: 0-99 (containing "Africans" -class 0), 100-199 (the "beach" scenes -class 1), 200-299 (monuments -class 2), 300-399 (busses -class 3), 400-499 (dinosaurs -class 4), 500-599 (elephants -class 5), 600-699 (flowers -class 6), 700-799 (horses -class 7), 800-899 (mountains -class 8), and 900-999 (cookies -class 9). Images in the database are described with low-level feature vectors, similarly to [10]. For each image the feature vector composing of low-level descriptors (color, texture, and shape) is created.…”
Section: A Datasetmentioning
confidence: 99%
“…In our previous work [10] an active learning strategy, exploiting both relevant and irrelevant images, is applied to update weights of query feature vector. Such a procedure combined with neural networks effectively brings out the most relevant images from the database.…”
Section: Introductionmentioning
confidence: 99%
“…Image i with the smallest distance d i is objectively the closest (i.e., more similar) to a query. After initial search, which is based on objective measure, the retrieving procedure may be improved by using user's relevance feedback [13,14,[18][19][20][21][22][23][24][25][26].…”
Section: Related Workmentioning
confidence: 99%
“…In this way, since the number of clusters K can be significantly lower than the number J of all feature vector components, the retrieving process will be accelerated accordingly. The rest of our system is of the structure that we already used in CBIR systems without feature vector reduction [25,26]. As a similarity measure, we used Mahalanobis distance while updating of the query feature vector is performed with assistance of radial basis function neural network.…”
Section: Feature Vector Reductionmentioning
confidence: 99%