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

Trivial acceptance case of cohen sutherland line clippings, Trivial accepta...

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000

Exceptional cases - orthographic projection, Exceptional cases - Orthograph...

Exceptional cases - Orthographic Projection 1)   We have an Orthographic projection, if f=0, then cot (β) =0 that is β=90 0 . 2)   β =cot-1 (1)=450 and this Oblique projec

Importance of multimedia, Importance of Multimedia: Multimedia will help i...

Importance of Multimedia: Multimedia will help in spreading the information age to millions of teachers/learners. Today Multimedia educational computing is fastest raising markets

Mpeg-1, MPEG-1 : MPEG-1 that is Moving Picture Experts Group format 1 is a...

MPEG-1 : MPEG-1 that is Moving Picture Experts Group format 1 is an industry standard encoding format that is broadly used. Its normal format is a frame size of about 352 x 240 an

3dstudio - softwares for computer animation, 3Dstudio - Softwares for compu...

3Dstudio - Softwares for computer animation 3DStudio is a 3-D computer graphics programmed. 3DStudio runs on personal computers. This is relatively simple to use. Several schoo

Image processing, Image Processing New digital technology has made this...

Image Processing New digital technology has made this possible for the manipulation of multi- dimensional signals along with systems which range from easy digital circuits to

Important points about the diffuse reflection, Important Points About the D...

Important Points About the Diffuse Reflection An extremely rough surface appears uniformly bright from each viewing direction Q the intensity of reflected light is identical i

Real time clock -rtc, Main objectives: To test to micro-controller I...

Main objectives: To test to micro-controller I2C protocol bus functionality Setting and displaying accurate time and date on the LCD GENERAL DESCRIPTION The D

Physx, what is physx.?

what is physx.?

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

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