Class LshIndexParams

Namespace

OpenCvSharp.Flann

Assembly

OpenCvSharp.dll

When using a parameters object of this type the index created uses multi-probe LSH (by Multi-Probe LSH: Efficient Indexing for High-Dimensional Similarity Search by Qin Lv, William Josephson, Zhe Wang, Moses Charikar, Kai Li., Proceedings of the 33rd International Conference on Very Large Data Bases (VLDB). Vienna, Austria. September 2007)

public class LshIndexParams : IndexParams, IDisposable, ICvPtrHolder

Inheritance

object

DisposableObject

DisposableCvObject

IndexParams

LshIndexParams

Implements

IDisposable

ICvPtrHolder

Inherited Members

IndexParams.DisposeManaged()

IndexParams.GetString(string, string)

IndexParams.GetInt(string, int)

IndexParams.GetDouble(string, double)

IndexParams.SetString(string, string)

IndexParams.SetInt(string, int)

IndexParams.SetDouble(string, double)

IndexParams.SetFloat(string, float)

IndexParams.SetBool(string, bool)

IndexParams.SetAlgorithm(int)

DisposableCvObject.ptr

DisposableCvObject.DisposeUnmanaged()

DisposableCvObject.CvPtr

DisposableObject.DataHandle

DisposableObject.IsDisposed

DisposableObject.IsEnabledDispose

DisposableObject.AllocatedMemory

DisposableObject.AllocatedMemorySize

DisposableObject.Dispose()

DisposableObject.Dispose(bool)

DisposableObject.AllocGCHandle(object)

DisposableObject.AllocMemory(int)

DisposableObject.NotifyMemoryPressure(long)

DisposableObject.ThrowIfDisposed()

object.Equals(object)

object.Equals(object, object)

object.GetHashCode()

object.GetType()

object.MemberwiseClone()

object.ReferenceEquals(object, object)

object.ToString()

Constructors

LshIndexParams(Ptr)

protected LshIndexParams(Ptr ptrObj)

Parameters

ptrObj Ptr

LshIndexParams(int, int, int)

Constructor

public LshIndexParams(int tableNumber, int keySize, int multiProbeLevel)

Parameters

tableNumber int

The number of hash tables to use (between 10 and 30 usually).

keySize int

The size of the hash key in bits (between 10 and 20 usually).

multiProbeLevel int

The number of bits to shift to check for neighboring buckets (0 is regular LSH, 2 is recommended).