Edge detection of an image reduces significantly the amount of data and filters out information that may be regarded as less relevant, preserving the important structural properties of an image. There are many methods for edge detection, but most of them can be grouped into two categories, search-based and zero-crossing based. The search-based methods detect edges by looking for maxima and minima in the first derivative of the image, usually local directional maxima of the gradient magnitude. The zero-crossing based methods search for zero crossings in the second derivative of the image in order to find edges, usually the zero-crossings of the Laplacian or the zero-crossings of a non-linear differential expression. This project will look at two edge detection methods, the first being Marr-Hildreth, a zero-crossing method, and the other is Canny, a search-based method. The Canny is most commonly used edge detection method and supposedly give the best results. Hopefully my results will be able to confirm this.