Returns random floating-point number between 0 and 1: */

decodes standard or user-defined object and returns it */

Releases CvMatND */

Fast variant of cvSetAdd */

Removes set element given its pointer */

dst(mask) = src(mask) - value = src(mask) + (-value) */

Search for many objects in the image, such as all the faces, storing the results into 'objects'. Can use Haar cascades or LBP cascades for Face Detect

void setKeepFloatPosteriors(bool b) { keep_float_posteriors_ = b; }

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist.

* Create a tree node that subdivides the list of vecs from vind[first] * to vind[last]. The routine is called recursively on each sublist.

Draw a crossbar at the given position.

Draw a crossbar at the given position.

* Draws OpenGL polygons that represent the fluid simulation. Also calles * methods that trigger simulation steps. Most of the behavior of the *

* Draws OpenGL polygons that represent the fluid simulation. Also calles * methods that trigger simulation steps. Most of the behavior of the *

Draw a rectangle around the given object.

Draw a rectangle around the given object.

Draw a filled rectangle around the given object.

Draw a filled rectangle around the given object.

Draw some text onto an image using printf() format.

Draw some text onto an image using printf() format.

Returns the eigenvalues of this LDA.

Returns the eigenvectors of this LDA.

* Tests if the heap is empty * * Returns: true is heap empty, false otherwise */

@brief checks if the bitset is empty * @return true if the bitset is empty */

* Chooses the best nearest-neighbor algorithm and estimates the optimal * parameters to use when building the index (for a given precision).

* Estimates the search time parameters needed to get the desired precision. * Precondition: the index is built * Postcondition: the searc

* Helper function that computes the nearest childs of a node to a given query point. * Params: * node = the node * q = the quer

Fills the different xor masks to use when getting the neighbors in multi-probe LSH * @param key the key we build neighbors from * @param low