High-speed Data Retrieval in an Eigenspace Employing a B-tree Structure

In this paper, we propose a technique for retrieving a database containing a large amount of data at high-speed for the purpose of recognizing human postures/motions. There is a technique for recognizing a 3D object from its 2D image set. But it has a disadvantage that the retrieval time increases in proportion to the number of objects registered in the database. We have developed a high-speed retrieval technique of such a large database by applying B-tree data structure to the database. An experiment was performed employing some human posture images as well as alphabetical images and the proposed technique achieved satisfactory results