Dynamic programming, Computer Engineering

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.

Posted Date: 3/15/2013 1:45:27 AM | Location : United States







Related Discussions:- Dynamic programming, Assignment Help, Ask Question on Dynamic programming, Get Answer, Expert's Help, Dynamic programming Discussions

Write discussion on Dynamic programming
Your posts are moderated
Related Questions
Explain the evolution of system software with system programming. System-software is collection of system programs which perform a variety of functions, name are: file editing,

what is critical section problem in operating system with diagram

You are given a collection of words, say as in a dictionary. You can represent it in the following compressed form: the first word will be followed by a sequence of a pair of numbe

The history file, history.txt, is the branch history of a run of the gcc compiler (the first field is the address of the branch instruction, the second field is the target branch a

Q. Describe about Pascaline? Blaise Pascal made very first attempt in the direction of automatic computing. He invented a device that comprised lots of gears and chains that us

Why is fragmentation needed on Internet not on a typical WAN? TCP/IP protocol utilizes the name IP datagram to demote to an Internet packet. The amount of data carried into a d


Compare memory mapped I/O with I/O mapped I/O. Memory Mapped I/O Scheme: In this scheme there is only one address space. Address space is stated as all possible addresses tha

Q. Show the Mailing lists on Internet? Another exciting aspect about E-mail is that you can find groups of people who share your interests-whether you are inclined toward games

Q. What do you mean by instruction cycle? We have considered the instruction execution in previous section. Now let's consider more about different types of instruction executi