Lock the bloom filter and set variables to fixed values. This will prevent hashing algorithms to be added to the filter.

The internal structure of hashing algorithms may change once in a while, but the hamming distance and normalized hamming distance should be unaffected

A unique id identifying the settings and algorithms used to generate the output result. This method shall contain a hash code for the object which <u

Check if the buffered image is considered a match by this subtree. This method takes into account itself and all subsequent lower nodes. To receive an

Traverse the tree and output all key = hashes and values found.

Recompute the category definition of this clustering matcher and it's nested matchers. <p> Recomputing categories will take recently added images into

Removes the hashing algorithms from the image matcher. @param algo the algorithm to be removed @return true if the algorithms was removed, false othe

Removes the hashing algorithms from the image matcher. @param algo the algorithm to be removed @return true if the algorithms was removed, false othe

Removes the hashing algorithms from the image matcher. @param algo the algorithm to be removed @return true if the algorithms was removed, false othe

Removes the hashing algorithm from the image matcher. @param algo The algorithm to remove @param forceTableDeletion if true also delete

Reset the clusteroids hash weights while keeping the mode hash intact

Serialize this image matcher to the database. The image matcher object can be later be retrieved by calling {@link #getFromDatabase(Connection, int)}

Refresh the node's the upper and lower bound error. This method should be called when ever a hash was added to this node. The bounds will be adapted c

@param labeledImages2

Return the byte representation of the big integer with the leading zero byte stripped if present. The BigInteger class prepends a sign byte if necessa

Saves this hash to a file for persistent storage. The hash can later be recovered by calling {@link #fromFile(File)}; @param saveLocation the file to

Escape the given hash the same way {@link #getUncertaintyHash(double)} escapes this fuzzy hash. <p> Return a simple hash containing only the bits that

Populate the decision trees used in this image matcher. The forest has to be initialized when ever new labeled test images are added. @param trees

@param ensureHashConsistency If true adding and matching hashes will check weather they are generated by the same

@param bitResolution The bit resolution specifies the final length of the generated hash. A higher resolution will increase

@param bitResolution The bit resolution specifies the final length of the generated hash. A higher resolution will increase

@param bitResolution The bit resolution specifies the final length of the generated hash. A higher resolution will increase

@param ensureHashConsistency If true adding and matching hashes will check weather they are generated by the same

Create a bloom filter with expected elements and bit size. Exceeding the number of expected elements will quickly result in degrading false positive p

@param cacheAddedHashes Additionally to the binary tree, hashes of added images will be mapped to their uniqueId allowing to

Create a cumulative in memory image matcher with the specified threshold @param threshold The cutoff threshold of the summed and scaled normalizted

Create a cumulative in memory image matcher with the specified normalized threshold @param cacheAddedHashes Additionally to the binary tree, hashes o

Attempts to establish a connection to the given database using the supplied connection object. If the database does not yet exist an empty db will be

Create a difference hasher with the given settings. The bit resolution always corresponds to the simple precision value and will increase accordingly

@param func

Create an empty fuzzy hash object with a 0 bit hash length and a undefined algorithm id. These values will be populated as soon as the first hash is a

@param mask kernel mask

Attempts to establish a connection to the given database URL using the h2 database driver. If the database does not yet exist an empty db will be init

Creates a Hash object with the specified hashValue and algorithmId. To allow save comparison of different hashes they have to be generated by the same

Create a hashbuilder. @param bits the number of bits the hash will have [8 - Integer.MAX_VALUE]. If the builder requires more space than

Promises a key with approximately bit resolution. Due to geometric requirements the key might be marginally larger or smaller than specified. Hashing

Create a hog hasher with parameters specific to the hog feature detection algorithm. The actual hash will have a key length of <code>(width / cellWid

Create a hog hasher with the target bit resolution. Default values of 4 bins per cell (0°,45°,90°,135°) and a cell width of 2 pixels per cell are ass

Create a hog hasher with parameters specific to the hog feature detection algorithm. The actual hash will have a key length of <code>(width / cellWid

Create a KMeans clusterer @param clusters the number of cluster to partition the data into

@param k The number of clusters to @param hasher The hashing algorithm used to create hashes

Create a clone of the supplied kernel @param template the kernel to clone

@param category The image category. Images with the same category are expected to be classified as similar images @param f The

Create a leaf node. @param match

Create a maximum kernel with no weight matrix @param width of the kernel @param height height of the kernel

@param bitResolution The bit resolution specifies the final length of the generated hash. A higher resolution will increase

Create a median kernel with a uniform weight mask (no weighting takes place) @param width of the kernel. has to be odd @param height of the kernel. ha

Create a minimum kernel with a uniform weight mask (no weighting takes place) @param width of the kernel. has to be odd @param height of the kernel. h

Create a multi kernel from the given kernels @param kernels the kernels which will be chained

Empty constructor used by inheriting classes which are not able to provide a mask during first constructor call. The inheriting class promises to prov

@param bitResolution The bit resolution specifies the final length of the generated hash. A higher resolution will increase

Non args constructor for serialization

TODO handle serialization empty constructor? @param cacheAddedHashes Additionally to the binary tree hashes of added images w

@param bitResolution The bit resolution specifies the final length of the generated hash. A higher resolution will increase

Create a Rotational Invariant Perceptive Hasher @param bitResolution The desired bit resolution of the created hash

Create a scharr filter @param threshold the cutoff beneath which gray values will be set to 0. [0 - 1].

Create a sobel filter @param threshold the cutoff beneath which gray values will be set to 0. [0 - 1].

@param b0 @param b1 @param match

@param bitResolution The bit resolution specifies the final length of the generated hash. A higher resolution will increase

The name of the labeled image serves as unique identifier @param images the images to categories

Insert a value associated with the supplied hash in the binary tree (similar to a map). Saved values can be found by invoking {@link #getElementsWithi

Append a new hashing algorithm to be used by this matcher. The same algorithm may only be added once. Attempts to add the same algorithm twice is a NO