URGENT! I need help writing a JAVA program that performs a reverse image search. I have a file containing 23 pnm grayscale (600x80 pixels) images and if i put an image as an input, i need to retreive all similar images. the basic outline of how this should be done is as follows:

-read images into arrays

-divide the image in patches

-take the median of each patch, if the median >avg = 1, if the median

-develop a hash code (made up of 1s and 0s) --> each image should have a hash code

-for the retrieval we need to use a normalized B+ tree

-for each image the number of 1s in the hash code need to be associated with the image

-i need to also set a tolerance to compare the cue (input image) to the other images (ex. let's use 20% tolerance)

-i need to compare the hash code of the cue to all other hash codes using XOR

- also need to do this in c.log(n) time complexity, on average, where n is the current number of images stored in the tree and c is a constant value.

I need help with the implementation of this in JAVA...