loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2001 IEEE International Conference on Multimedia and Expo (ICME'01)
NNEW: NEAREST NEIGHBOR EXPANSION BY WEIGHTING IN IMAGE DATABASE RETRIEVAL
Tokyo, Japan
August 22-August 25
ISBN: 0-7695-1198-8
Various systems have been developed for supporting content-based image retrieval. Most systems make very strong assumptions in modeling users' query concepts. However, since the information need of users can be very diverse, these assumptions may not always hold and hence can lead to poor search results. For instance, if a system assumes that the query-concept is convex but a user issues a disjunctive query, and vice versa, the search result cannot be satisfactory. In this study, we propose a method that can approximate more complex (non-convex and disjunctive) query concepts. Our method uses intelligent modeling and learning to increase query speed and accuracy. Empirical results show that our method converges consistently faster than some traditional approaches on different datasets.
Index Terms:
query concept, relevance feedback.
Citation:
Huaxin You, Edward Chang, Beitao Li, "NNEW: NEAREST NEIGHBOR EXPANSION BY WEIGHTING IN IMAGE DATABASE RETRIEVAL," icme, pp.46, 2001 IEEE International Conference on Multimedia and Expo (ICME'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.