Dynamic programming, Computer Engineering

Assignment Help:

The fi rst task will involve doing a little background reading on Dynamic Programming to get up to speed. The second task is to write the code:

Search Space Write a function which takes the two initial contours as inputs and returns an M N matrix containing the pixel intensities at each point in the search space. Hint: Since these points will not typically lie in the center of a pixel you may elect to select the nearest pixel in the image, or you may choose a more advanced scheme for some bonus marks.

Dynamic Programming Algorithm Write a function which takes the two initial contours and the image as parameters and returns the optimal contour. Note: This function will call the Search Space function above.

Finally you should present your results in a short report. The report must be no longer than 3 sides of A4 (not including diagrams, tables, gures or listings).

Here are some things that you could discuss in the report:

How does the algorithm scale with M? Try varying M over a sensible range, and use the tic toc function in Matlab to estimate the scaling. Does this agree with theory?

How robust is the solution to changes in ? You should initially test and report the results of your algorithm using  = 0:5, but later you could report how the results changes when you vary it.


Related Discussions:- Dynamic programming

Why digital computers use complemented subtraction method, The chief reason...

The chief reason why digital computers use complemented subtraction is that it ? Ans. By using complemented subtraction method negative numbers can easily be subtracted.

Explain the input stage of an ADC, Explain the Input Stage of an ADC. ...

Explain the Input Stage of an ADC. Ans. Input Stage- In ADC at the input stage, analog voltage can contain any value in a range although the digital output can contain

What is dithering, Q. What is Dithering? CMYK provides only 8 colours (...

Q. What is Dithering? CMYK provides only 8 colours (C, M, Y K, Violet= C + M, Orange= M + Y, Green = C + Y, and colour of paper itself!). What about other colours?  For these t

What is the difference between the c#.net and vb.net, What is the differenc...

What is the difference between the C#.NET and VB.NET? VB.NET - It don't have the XML Documentation. - It don't have the Operator Overloading. - It dont't have the P

What do you mean by perfect shuffle permutation, Q. What do you mean by Per...

Q. What do you mean by Perfect Shuffle Permutation? Perfect Shuffle Permutation: It was proposed by Harold Stone (1971). Consider N objects each is represented by n bit number

Add the equation by using 2's compliment, Add 20 and (-15) using 2's comple...

Add 20 and (-15) using 2's complement ? Ans. Addition of 20 and (-15) by using 2's complement as (20) 10 = 1 0 1 0 0                                                  (16

Analysis of parallel algorithms, A generic algorithm is mostly analysed on ...

A generic algorithm is mostly analysed on basis of subsequent parameters: the space complexity (amount of space required) and the time complexity (execution time). Generally we giv

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