Major Project Synopsis: Image Comparer SESSION-2011-12
Major Project Synopsis: Image Comparer SESSION-2011-12
SUBMITTED TO:
Mr. Diwakar Singh HOD (C.S.E)
SUBMITTED BY:
Ashray Agrawal Hitesh kumar Sahu Paras Vishwakarma VII SEM (CSE)
OBJECTIVE:This software is just a instance of the principle working of the Image Comparer which can be used to reduce the redundancy of multiple images stored in a disk. It is very useful in handling large databases on the internet photo engines like flickr.com, picasa.com and google images and has a varied utility in cryptography.
IDEA USED:It uses the technique of cryptography in which images data given by user is encrypted first and saved in Hash address and do the same with all images of database and then check the address one by one. If the image is found to be a duplicate it shows the address section of the image with an option to delete it or leave it.
FUNCTION USED:The MD5 Message-Digest Algorithm is a widely used cryptographic hash function with a 128-bit (16-byte) hash value. Specified in RFC 1321, MD5 has been employed in a wide variety of security applications, and is also commonly used to check the integrity of files. However, it has been shown that MD5 is not collision resistant; as such, MD5 is not suitable for applications like SSL certificates or digital signatures that rely on this property. An MD5 hash is typically expressed as a 32digit hexadecimal number.
ALGORITHM USED:MD5 processes a variable-length message into a fixed-length output of 128 bits. The input message is broken up into chunks of 512-bit blocks (sixteen 32-bit little endian integers); the message is padded so that its length is divisible by 512. The padding works as follows: first a single bit, 1, is appended to the end of the message. This is followed by as many zeros as are required to bring the length of the message up to 64 bits fewer than a multiple of 512. The remaining bits are filled up with a 64-bit integer representing the length of the original message, in bits. The main MD5 algorithm operates on a 128-bit state, divided into four 32-bit words, denoted A, B, C and D. These are initialized to certain fixed constants. The main algorithm then operates on each 512-bit message block in turn, each block modifying the state. The processing of a message block consists of four similar stages, termed rounds; each round is composed of 16 similar operations based on a non-linear functionF, modular addition, and left rotation. Figure 1 illustrates one operation within a round. There are four possible functions F; a different one is used in each round:
TECHNICAL DETAILS:Developed on the platform of Visual Basic.Net 2010 ultimate edition. .net framework version 4.0
Windows XP Service Pack 2 or above (for 2010 release, Service Pack 3) Windows Server 2003 Service Pack 1 or above Windows Server 2003 R2 or above Windows Vista Windows Server 2008 Windows 7 Linux with Mono (only works with .NET 4.0 applications)
Hardware
Minimum: 1.6 GHz CPU, 384 MB RAM, 1024768 display, 5400 RPM hard disk Recommended: 2.2 GHz or higher CPU, 1024 MB or more RAM, 12801024 display, 7200 RPM or higher hard disk.
USEFULNESS: Reduces image redundancy. Used in image cryptography. Used in finger print checking.
Used in Digital signatures. It can save lot of disk space in servers holding large amount of images. It can compare mostly all types of standard image formats.
DISADVANTAGES: If photo is cropped ,change in resolution or edited it cant matched. It cannot differ images in 24bit and 8bit images. If database is too heavy, it may take time to compare image.