×

Method and system for building a support vector machine binary tree for fast object search

  • US 8,849,832 B2
  • Filed: 04/02/2008
  • Issued: 09/30/2014
  • Est. Priority Date: 04/02/2008
  • Status: Expired due to Fees
First Claim
Patent Images

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 all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×