PRESENTING RESULTS FOR GROUP 15Group Members : Brent Myers REQUIRED: (Bring images on a disk OR on a COMPUTER!) Final Results ( PREFER SIZES of about 800x600 )one window replaced:  one window replaced:  one window replaced:  two windows replaced:  What IMAGES were used ( PREFER SIZES of about 400x300)?
   DESCRIPTION (2 short paragraphs)to find the window from a point, i used an edge detecting filter similar to this and found the region nearest the given point with high contrast.  next a morphological closing is performed on the image to get rid of little bits of contrast and clump up the important contrasts together.  to merge the window in, i expanded on code from one of irfan's former students who implemented the laplacian pyramid algorithm. i modified it so that it uses the window as a mask instead of splitting it down the center. since the windows are not the same size, my algorithm grabs a neighborhood around the selected windows and uses this area for laplacian pyramid calculations and merges it back into the original image.     Code: Some of this code was taken from one of irfan's students websites (Rob Orr - http://www.cc.gatech.edu/classes/cs7321_98_winter/participants/rjo/) for their laplacian pyramid project I modified this code to use a mask and to force the algorithm to merge two images that are not necessarily the same size or are not in the desired place in the image to merge. http://www.prism.gatech.edu/~gtg004i/cp/findWindow.m finds the window in an image given a point http://www.prism.gatech.edu/~gtg004i/cp/switchWindows.m given two points and two images, places a window from the second image into the window selected in the first image these last four are the meat of the laplacian pyramid implementation and are unmodified from rob orr's page http://www.prism.gatech.edu/~gtg004i/cp/reduce.m http://www.prism.gatech.edu/~gtg004i/cp/expand.m http://www.prism.gatech.edu/~gtg004i/cp/l_collapse.m http://www.prism.gatech.edu/~gtg004i/cp/l_pyramid.m
|