| （英） |
We have proposed a fractal code retrieval method.
There, we interpreted a fractal code as a vector set, and introduced a similarity measure between vector sets.
This similarity measure required high computation cost.
To reduce it, we proposed a method to use upper bounds of the similarity measure.
In this report, we further improve the proposed upper bounds by using subsets of the vector sets, and introduce a new upper bound of the similarity measure.
This new upper bound is a generalization of the already proposed upper bounds.
After discussions on the details of the new upper bound, and we examine its properties through an image retrieval experiment. |