Difference of gaussians, Computer Graphics

Assignment Help:

Difference of Gaussians

In this project we will implement the difference of Gaussians (DoG) edge detector and learn its characteristics.

Part A: Design and implement a procedure that takes the displayed image and the standard deviation (scale) of a Gaussian and replaces the displayed image with its Gaussian smoothed image. The Gaussian scale is provided interactively. Implement 2-D Gaussian smoothing by 1-D Gaussian smoothing.

Part B: Design and implement a procedure that receives the scale σ of a LoG edge detector and approximates the LoG edge detector by a DoG, by

1) Calling the Gaussian smoother once with scale σ and another time with scale 1.61σ,

2) Subtracting the two smoothed images, and

3) Finding the zero-crossings of the difference image. This procedure should set the zero-crossing pixels to 255 and all other pixels to 0. It should also replace the displayed image with its DoG edge image.

Part C: In a page or two describe your implementation and comment on the obtained results.

 Extra-credit: Design and implement a procedure that receives an image and the scale of a Gaussian smoother and finds the edges and the gradient magnitudes at the edges and returns the edge image where an edge pixel shows the gradient magnitude there. Replace the displayed image with the returned result. (1 point) Design and implement an interactive method to remove the weak edges. The implementation should allow the user to select a gradient threshold value interactively. It should then replace values in the displayed image that are below the threshold value to 0 and those equal to and greater than the threshold value to 255. Note that there is a need to make a backup copy of the displayed image to reuse it as needed.

Note: For accurate results, perform all calculations in float and then round to byte when saving and displaying the results.


Related Discussions:- Difference of gaussians

Associative links, Associative Links: it is a link that is completely inde...

Associative Links: it is a link that is completely independent of the exact structure of the information. For illustration we have links depends on the meaning of various informat

Softwares and hardwares for computer animation, Softwares and Hardwares for...

Softwares and Hardwares for Computer Animation The categories of both software as well as hardware needed to work on animation are now to be discussed. Computer animation can b

Modify the dda algorithm for negative sloped lines, 1. Modify the DDA algo...

1. Modify the DDA algorithm for negative sloped lines; discuss both the cases i.e., slope > 1 and 0   Ans. For the generation of lines along with negative slopes as:

Functioning of hardcopy devices and output primitives, Functioning of hardc...

Functioning of hardcopy devices and Output primitives 1.  Functioning of hardcopy devices-laser printers and dot matrix printers, plotters.  2.  Output primitives: Graphics

Implement the boundary fill and flood fill algorithm, 1. Implement the boun...

1. Implement the boundary fill algorithm and flood fill algorithm in C-language and use your code to fill two different types of closed areas such as  i)  A Circle ii)  A sel

Plane equation - curves and surfaces, Plane Equation - Curves and Surfaces ...

Plane Equation - Curves and Surfaces Plane is a polygonal surface that bisects its environment in two halves. One is termed to as forward and another as backward half of som

Polygon representation methods - boundary representations, Polygon represen...

Polygon representation methods - Boundary representations Boundary representations: now the 3-D object is shown as a set of surfaces which separate the object interior from

Other file formats and bmp-dib-rle file formats, Other File Formats BM...

Other File Formats BMP/DIB/RLE File Formats These are termed as device independent bitmap files. They exist in two various type formats: a) OS2 format and b) Windows

Sutherland hodgeman polygon clipping algorithm, What is clipping? Explain S...

What is clipping? Explain Sutherland Hodgeman polygon clipping algorithm with example.  OR Write the algorithm for Sutherland Hodgeman Polygon. Beginning with the initial set of p

Ellipse generating algorithm, Ellipse generating algorithm: Algorithm ...

Ellipse generating algorithm: Algorithm is similar to circle algorithm. We divide the ellipse on the positive quadrant into two regions. Region 1 where the slope > -1, and Reg

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd