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

Data stream and instruction stream-flynn’s classification, Data Stream an...

Data Stream and Instruction Stream The term 'stream' refers to an order or flow of either data operated or instructions on by the computer. In the complete chain of instructi

Floating point arithmetic pipelines, Floating point Arithmetic pipelines ...

Floating point Arithmetic pipelines Floating point computations are the finest candidates for pipelining. Take the instance of addition of two floating point numbers. Following

Determine the signed numbers are used in binary arithmetic, When signed num...

When signed numbers are used in binary arithmetic, then which one of the notations would have unique representation for zero ? Ans. When signed numbers are utilized in binary ar

Depth first search - artificial intelligence, Depth First Search - artifici...

Depth First Search - artificial intelligence: Depth first search is very similar to breadth first, except for that the things are added to the top of this agenda rather than o

Level of any node of a tree, Level of any node of a tree is :- Its distanc...

Level of any node of a tree is :- Its distance from the root

Explain half-adder with truth-table and logic diagram, What is a half-adder...

What is a half-adder? Explain a half-adder with the help of truth-table and logic diagram. Ans. Half Adder: It is a logic circuit for the addition of two 1-bit numbers is term

Multiple instruction and multiple data stream (mimd), Multiple Instruction ...

Multiple Instruction and Multiple Data stream (MIMD) In this association, multiple control units and multiple processing elements are prepared as in MISD. But the discrepancy i

Explain the probability of availability of free lines, How does one arrive ...

How does one arrive at the probability of availability of free lines during the busy hour? One can arrive at the possibility of free lines throughout busy hour using the delay

Hardware implementation for signed-magnitude data, Hardware Implementation ...

Hardware Implementation for signed-magnitude data When multiplication  is  implemented  in  digital  computer,  we  change  process lightly. Here, in place of providing registe

How dreamweaver work in layout view, Q. How Dreamweaver Work in Layout View...

Q. How Dreamweaver Work in Layout View? Dreamweaver has two visual design views-Standard view and Layout view. You will start by working in Layout view, which allows you to dra

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