Treffer: Approximate search in image database

Title:
Approximate search in image database
Source:
Storage and retrieval for media databases 2000 (San Jose CA, 26-28 January 2000)SPIE proceedings series. 3972:210-214
Publisher Information:
Bellingham WA: SPIE, 2000.
Publication Year:
2000
Physical Description:
print, 9 ref
Original Material:
INIST-CNRS
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dipartimento di Matematica e Informatica, University di Catania, Viale A.Doria 6, 95125 Catania, Italy
Rights:
Copyright 2001 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Sciences of information and communication. Documentation

FRANCIS
Accession Number:
edscal.779449
Database:
PASCAL Archive

Weitere Informationen

This paper presents a new approach to content based retrieval in image databases. The basic new idea in the proposed technique is to organize the quantized and truncated wavelet coefficients of an image into a suitable tree structure. The tree structure respects the natural hierarchy imposed on the coefficients by the successive resolution levels. All the trees relative to the images in a database are organized into a trie. This structure helps in the error tolerant retrieval of queries. The results obtained show that this approach is promising provided that a suitable distance function between trees is adopted.