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

Answer, Write a program to find the area under the curve y = f(x) between x...

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b. The area under a curve between two points can b

Explain the reference count - free memory areas, Explain the Reference Coun...

Explain the Reference Count The system relates a reference count along with each memory area to point out the number of its active users. This number is incremented while a us

Events by which we can program "help texts", What are the events by which w...

What are the events by which we can program "help texts" and display "possible value lists"? -PROCESS ON HELP-REQUEST (POH). -PROCESS ON VALUE-REQUEST (POV).

What is the use of fork and exec system calls, What is the use of fork and ...

What is the use of fork and exec system calls?  Fork is a system call by which a new process is formed. Exec is also a system call, which is used after a fork by one of the two

Postpurchase interaction, Postpurchase Interaction Customer service an...

Postpurchase Interaction Customer service and support: The considerations at this stage can be explained by the following example: Consider a bundle having of a portfolio

Web service as opposed to a non-serviced, Can you give an example of when i...

Can you give an example of when it would be appropriate to use a web service as opposed to a non-serviced .NET component? A web service has the following characteristics:  1

Steps uesd in quine mckluskey method, Q. Steps uesd in quine mckluskey meth...

Q. Steps uesd in quine mckluskey method? Step I: Build a table in that every term of expression is represented in row (Expression must be in SOP form). Terms can be expres

What are packages, What are packages? Package is a group of elements (c...

What are packages? Package is a group of elements (classes, generalizations, associations and lesser packages) with a common theme. Package partitions a model making it simpler

Explain resource request and allocation graph (rrag), Explain Resource requ...

Explain Resource request and allocation graph (RRAG) Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V

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