Method and system for building a support vector machine binary tree for fast object search
First Claim
1. A computer-implemented method for configuring and providing a data binary tree for a fast object search, comprising:
- receiving an image frame from a video sensing device;
receiving image motion data from said image frame from an image motion processor;
computing at least one appearance model from said received image frame and said received image motion data, representative of an object within said image frame detected in a plurality of regions in said image frame wherein said object is stored in an object database containing a plurality of multidimensional data objects including said object, wherein said at least one appearance model is represented in a covariance matrix;
storing said appearance model in a database;
assigning a class label to said at least one appearance model in a vector-based format in order to form labeled data corresponding to each of said appearance models including an object index; and
utilizing a support vector machine with respect to said labeled data to generate a classifier with an optimal hyperplane and a particular margin; and
hierarchically constructing a data binary tree utilizing said labeled data for a fast object search thereof;
automatically searching a query appearance model in said object frame utilizing said data binary tree in accordance with said classifier and said particular margin, such that if a query point of said query appearance model falls within a particular margin, wherein said at least one appearance models and said query appearance model are indexed within said data binary tree;
querying a left child and a right child of said binary tree in order to obtain a classification result, if a query point of said query appearance model falls within said particular margin; and
thereafter processing said left child if said classification result is positive or thereafter processing said right child if said classification result is negative.
1 Assignment
0 Petitions
Accused Products
Abstract
Method and system for building a support vector machine binary tree for fast object search. An appearance model can be generated for objects in a database and computed on regions detected in an image frame. A covariance matrix can be utilized for representing the appearance model of the detected regions. The covariance matrix appearance model can be preprocessed and/or transferred into a vector-based format. The data in the vector-based format can be added with a class label to form labeled data. A support vector machine (SVM) can be utilized on the labeled data to generate a classifier with an optimal hyperplane and a margin area in order to hierarchically build a balanced SVM binary tree. A query appearance model can be searched rapidly utilizing the SVM binary tree during a search phase.
-
Citations
14 Claims
-
1. A computer-implemented method for configuring and providing a data binary tree for a fast object search, comprising:
-
receiving an image frame from a video sensing device; receiving image motion data from said image frame from an image motion processor; computing at least one appearance model from said received image frame and said received image motion data, representative of an object within said image frame detected in a plurality of regions in said image frame wherein said object is stored in an object database containing a plurality of multidimensional data objects including said object, wherein said at least one appearance model is represented in a covariance matrix; storing said appearance model in a database; assigning a class label to said at least one appearance model in a vector-based format in order to form labeled data corresponding to each of said appearance models including an object index; and utilizing a support vector machine with respect to said labeled data to generate a classifier with an optimal hyperplane and a particular margin; and hierarchically constructing a data binary tree utilizing said labeled data for a fast object search thereof; automatically searching a query appearance model in said object frame utilizing said data binary tree in accordance with said classifier and said particular margin, such that if a query point of said query appearance model falls within a particular margin, wherein said at least one appearance models and said query appearance model are indexed within said data binary tree; querying a left child and a right child of said binary tree in order to obtain a classification result, if a query point of said query appearance model falls within said particular margin; and thereafter processing said left child if said classification result is positive or thereafter processing said right child if said classification result is negative. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A system for configuring and providing a data binary tree for a fast object search, comprising:
-
a data bus coupled to a processor; and a compute-usable medium embodying computer code, said computer-usable medium being coupled to said data bus, said computer program code comprising instructions executable by said processor and configured for; receiving an image frame from a video sensing device; receiving image motion data from said image frame from an image motion processor; computing at least one appearance model from said received image frame and said received image motion data, representative of an object within said image frame detected in a plurality of regions in said image frame wherein said object is stored in an object database containing a plurality of multidimensional data objects including said object, wherein said at least one appearance model is represented in a covariance matrix; storing said appearance model in a database; assigning a class label to said at least one appearance model in a vector-based format in order to form labeled data corresponding to each of said appearance models including an object index; utilizing a support vector machine with respect to said labeled data to generate a classifier with an optimal hyperplane and a particular margin; and hierarchically constructing a data binary tree utilizing said labeled data for a fast object search thereof; wherein said instructions are further configured for automatically searching a query appearance model in said object frame utilizing said data binary tree in accordance with said classifier and said particular margin, wherein said at least one appearance models and said query appearance model are indexed within said data binary tree; querying a left child and a right child of said binary tree in order to obtain a classification result, if a query point of said query appearance model falls within said particular margin; and thereafter processing said left child if said classification result is positive or thereafter processing said right child if said classification result is negative. - View Dependent Claims (7, 8, 9)
-
-
10. A non-transitory computer-usable medium embodying computer program code, said computer program code comprising computer executable instructions configured for:
-
receiving an image frame from a video sensing device; receiving image motion data from said image frame from an image motion processor; computing at least one appearance model from said received image frame and said received image motion data representative of an object within said image frame detected in a plurality of regions in said image frame wherein said object is stored in an object database containing a plurality of multidimensional data objects including said object, wherein said at least one appearance model is represented in a covariance matrix; storing said appearance model in a database; assigning a class label to said at least one appearance model in a vector-based format in order to form labeled data corresponding to each of said appearance models including an object index; and utilizing a support vector machine with respect to said labeled data to generate a classifier with an optimal hyperplane and a particular margin; and hierarchically constructing a data binary tree utilizing said labeled data for a fast object search thereof; wherein said embodied computer program code further comprises computer executable instructions configured for automatically searching a query appearance model in said object frame utilizing data binary tree in accordance with said classifier and said particular margin, wherein said at least one appearance models and said query appearance model are indexed within said data binary tree; querying a left child and a right child of said binary tree in order to obtain a classification result, if a query point of said query appearance model falls within said particular margin; and thereafter processing said left child if said classification result is positive or thereafter processing said right child if said classification result is negative. - View Dependent Claims (11, 12, 13, 14)
-
Specification