Package dev.brachtendorf.jimagehash.hashAlgorithms

Class WaveletHash

  • All Implemented Interfaces:
    Serializable
    public class WaveletHash
extends HashingAlgorithm
    Calculate a hash based on iterative application of a haar wavelet on the luminosity values of the input image.

    The wavelet hashs detection performance usually resides in between the AverageHash and perceptive hash

    Since:
    3.0.0
    Author:
    Kilian
    See Also:
    Serialized Form

    • Constructor Detail

      • WaveletHash

        public WaveletHash​(int bitResolution,
                   int cycles)
        Parameters:
        bitResolution - The bit resolution specifies the final length of the generated hash. A higher resolution will increase computation time and space requirement while being able to track finer detail in the image. Be aware that a high key is not always desired.
        cycles - the number of times to execute the wavelet on the data before calculating the hash. Increasing this number usually leads to more distinct hash values with diminishing returns for higher cycle counts. 3 or 4 is a good starting value.

        This parameter heavily influences the computational complexity of this algorithm as each additional cycles requires a 4 times increase in the matrix input size.

    • Method Detail

      • hash

        protected BigInteger hash​(BufferedImage image,
                          HashBuilder hashBuilder)
        Description copied from class: HashingAlgorithm
        Calculate a hash for the given image. Invoking the hash function on the same image has to return the same hash value. A comparison of the hashes relates to the similarity of the images. The lower the value the more similar the images are. Equal images will produce a similarity of 0.

        This method is intended to be overwritten by implementations and takes a baseHash argument to allow concatenating multiple hashes as well to be able to compute the effective hash length in HashingAlgorithm.getKeyResolution(). Preceding 0's are omitted in big integer objects, while the usual hamming distance can be calculated due to xoring without issue the normalized distance requires the potential length of the key to be known.

        Specified by:
        hash in class HashingAlgorithm
        Parameters:
        image - Image whose hash will be calculated
        hashBuilder - a hash builder used to construct the hash
        Returns:
        the hash encoded as a big integer

      • doHaar2DFWTransform

        public static double[][] doHaar2DFWTransform​(int[][] pixels,
                                             int cycles)

      • precomputeAlgoId

        protected int precomputeAlgoId()
        Description copied from class: HashingAlgorithm
        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
        • Stays consistent throughout restart of the jvm
        • Value does not change after the constructor finished
        • Must return the same value if two instances compute the same hashes for identical input

        Even if different bitResolutions are used in the constructor HashingAlgorithm(int) the algorithId MUST return the same id for two instances if the returned hashes for the same input will always be equal. Therefore instead of checking against the bitResolution the actual resolution as returned by HashingAlgorithm.getKeyResolution() should be used. This method algorithm id's as information available to the child class and will be extended by the hashcode of the kernels.

        Specified by:
        precomputeAlgoId in class HashingAlgorithm
        Returns:
        the preliminary algorithm id identifying this hashing algorithm