抄録
An acceleration method is presented for similarity search of images on the basis of a lower bound of the Euclidean distance. The lower bound is calculated with lower dimensional feature vectors that are obtained by partitioning each image into several blocks. The effectiveness of the present method is experimentally shown with a simple image database.