1. A computer-implemented method for configuring and providing a data binary tree for a fast object search, comprising: computing at least one appearance model with respect to a plurality of detected regions in an object frame of an object stored in an object database containing a plurality of multidimensional data objects including said object, said at least one appearance model represented in a covariance matrix; assigning a class label to said at least one appearance model in a vector-based format in order to form labeled data; and utilizing a support vector machine with respect to said labeled data to generate a classifier with an optimal hyperplane and a particular margin in order to hierarchically construct a data binary tree for a fast object search thereof.