Suppose that we have a matrix of dissimilarities between n images of a database. For a new image, we would like to select the most similar image of our database. Because it may be too expensive to compute the dissimilarities for the new object to all images of our database, we want to ΓΏnd pn "vantag
Efficient image retrieval through vantage objects
β Scribed by Jules Vleugels; Remco C. Veltkamp
- Book ID
- 104161407
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 399 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
We describe a new indexing structure for general image retrieval that relies solely on a distance function giving the similarity between two images. For each image object in the database, its distance to a set of m predetermined vantage objects is calculated; the m-vector of these distances speci"es a point in the m-dimensional vantage space. The database objects that are similar (in terms of the distance function) to a given query object can be determined by means of an e$cient nearest-neighbor search on these points. We demonstrate the viability of our approach through experimental results obtained with two image databases, one consisting of about 5200 raster images of stamps, the other containing about 72,000 hieroglyphic polylines.
π SIMILAR VOLUMES
## Abstract In this article, we present an efficient approach for image retrieval based on the textural information of an image, such as orientation, directionality, and regularity. For this purpose, we apply the nonlinear modified discrete Radon transform to estimate these visual contents. We then