Skip to Main Content
Addresses the problem of efficient image retrieval from a compressed image database, using information derived from the compression process. Images in the database are compressed applying two approaches: vector quantization (VQ) and quadtree image decomposition. Both are based on Konohen's self-organizing feature maps (SOFM) for creating vector quantization codebooks. However, while VQ uses one codebook of one resolution to compress the images, Quadtree decomposition uses simultaneously 4 codebooks of four different resolutions. Image indexing is implemented by generating a feature vector (FV) for each compressed image. Accordingly, images are retrieved by means of FVs similarity evaluation between the query image and the images in the database, depending on a distance measure. Three distance measures have been analyzed to assess FV index similarity: Euclidean, intersection and correlation distances. Distance measures efficiency retrieval is evaluated for different VQ resolutions and different quadtree image descriptors. Experimental results using real data, esophageal ultrasound and eye angiography images, are presented.