抄録
An acceleration method is presented for searching for similar images based on the lower bound of the Euclidean distance between feature vectors. The lower bound is calculated with lower dimensional feature vectors that are obtained by partitioning each image into several blocks. The effectiveness of the proposed method was determined experimentally using a simple image database. The time required for a 10-NN search was reduced by 95 percent on average.
