Share Email Print

Proceedings Paper

Content-based image retrieval using greedy routing
Author(s): Anthony Don; Nicolas Hanusse
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we propose a new concept for browsing and searching in large collections of content-based indexed images. Our approach is inspired by greedy routing algorithms used in distributed networks. We define a navigation graph, called navgraph, whose vertices represent images. The edges of the navgraph are computed according to a similarity measure between indexed images. The resulting graph can be seen as an ad-hoc network of images in which a greedy routing algorithm can be applied for retrieval purposes. A request for a target image consists of a walk in the navigation graph using a greedy approach : starting from an arbitrary vertex/image, the neighbors of the current vertex are presented to the user, who iteratively selects the vertex which is the most similar to the target. We present the navgraph construction and prove its efficiency for greedy routing. We also propose a specific content-descriptor that we compare to the MPEG7 Color Layout Descriptor. Experimental results with test-users show the usability of this approach.

Paper Details

Date Published: 28 January 2008
PDF: 11 pages
Proc. SPIE 6820, Multimedia Content Access: Algorithms and Systems II, 68200I (28 January 2008); doi: 10.1117/12.761158
Show Author Affiliations
Anthony Don, Univ. Bordeaux I (France)
Nicolas Hanusse, Univ. Bordeaux I (France)

Published in SPIE Proceedings Vol. 6820:
Multimedia Content Access: Algorithms and Systems II
Theo Gevers; Ramesh C. Jain; Simone Santini, Editor(s)

© SPIE. Terms of Use
Back to Top