A Review SEARCH BITMAP IMAGE FOR SUB IMAGE AND THE PADDING PROBLEM

In this paper we will discuss the algorithm of search Bitmap image for sub image or duplicate images ,It is difficult for people to find or recognize if sub images are Found in large Image .This algorithm is a part of Image Processing Technique to help people solve Search problem .This algorithm has possibility to Convert the image to Binary Matrix and to individualize The Reading Buffer Size according to the padding edge. This algorithm is the first step to create Image Search Engine which can find matching image without looking to image name text or alternative text tag.