5th International Conference on Visual Information Engineering (VIE 2008) 2008
DOI: 10.1049/cp:20080356
|View full text |Cite
|
Sign up to set email alerts
|

Query refinement and user relevance feedback for contextualized image retrieval

Abstract: The motivation of this paper is to increase the user perceived precision of results of Content Based Information Retrieval (CBIR) systems with Query Refinement (QR), Visual Analysis (VA) and Relevance Feedback (RF) algorithms. The proposed algorithms were implemented as modules into K-Space CBIR system. The QR module discovers hypernyms for the given query from a free text corpus (Wikipedia) and uses these hypernyms as refinements for the original query. Extracting hypernyms from Wikipedia makes it possible to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(14 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…Since WordNet has narrow coverage for domain specific queries [20], we use association rules to exploit collection-dependent word relationships. We examine the vocabulary and add the words with both top 10 highest conf idence and support with the original query words into the query expansion.…”
Section: A Query Expansionmentioning
confidence: 99%
“…Since WordNet has narrow coverage for domain specific queries [20], we use association rules to exploit collection-dependent word relationships. We examine the vocabulary and add the words with both top 10 highest conf idence and support with the original query words into the query expansion.…”
Section: A Query Expansionmentioning
confidence: 99%
“…The value of Euclidean 2-norm distance between 1 u and the next input sample x , is compared withε . If it is greater, a new cluster which is centered at the location defined by x is created as 2 u , otherwise the elements of 1 u are updated as:…”
Section: Rbf Neural Networkmentioning
confidence: 99%
“…THD also has the advantage of requiring no training and can use up-to-date on-line resources to find hypernyms in real time. The THD algorithm proposed here is an updated and expanded version of the algorithm used in our earlier work [8]. The outline of the steps taken to find a hypernym for a given entity in our THD implementation is as follows: Performing all these steps requires to carry out multiple information retrieval and text processing tasks.…”
Section: Targeted Hypernym Discoverymentioning
confidence: 99%