A heuristic method for ceneralized hypercube encoding

Abstract

S i m i l a r i t y r e t r i e v a l from a pict o r i a l d a t a base can be made more e f f i c i e n t by encoding t h e o r i g i n a l d a t a base i n t o cert a i n convenient format. Generalized hypercube (GH) encoding is one such technique. To optimize GH encoding, a h e u r i s t i c approach h a s been formulated. Two o p t i m i z a t i o n problems have been considered here: (1) given t h e handle l e n g t h m, f i n d optimal GHm encoding;( 2 ) given t h e threshold d e n s i t y , f i n d optimal GH encoding such t h a t each hypercube has dens i t y no less than t h r e s h o l d d e n s i t y .