Divide the image into 1000x1000 grid. Compute and store hash of each individual cell. Now, compare hashes of cells instead. Assuming each hash is 16 bytes, it takes additional ~ 16 MB of memory, but the time required to localize the point of change is reduced by a factor of 10^6. To reduce the this time further, we can maintain a hierarchy of hash- tables, where each hierarchy divides the original section into 10x10 grids. Keep we can keep as many hashes as the disk space permits and each level will redirect us to a new level.
On Jul 12, 6:11 pm, Navneet Gupta <navneetn...@gmail.com> wrote: > Given 1000 million x 1000 million image, What information of > this image to be stored such that you can find the locations > when the given image has modi cations > > -- > Regards, > Navneet -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
