Images - systems research group, Computer Graphics

Assignment Help:

The image you have been given for contour extraction is shown in Figure 1. The method for constructing the search space is shown in Figure 2. It is generated from two initial discrete contours (shown in red). (The example shown here has N = 4 points on each contour for clarity, but the example you are given has many more points.) The search space is formed by joining the corresponding points on the two red contours with lines (shown in green). These green lines are then subdivided equally into M points to provide a discrete M  N search space, of which there are MN possible contours. The aim of the algorithm is to nd the contour which has points of highest intensity along it and is smooth. The constraints are that each line must pass through one green point per line and it cannot move back on itself. An example of an optimal contour in this case is shown in brown and an example of a non-optimal contour is shown in yellow. The problem with such a technique is that the large size of the search space demands a high computational overhead. However, the local connectivity of the contour energy function can be exploited, reducing the computation from exponential to polynomial time. The method of Dynamic Programming (Bellman, 1957) will be employed, which is based around the principle of optimality. The principle states (Sonka et al., 1993): Whatever the path to a node X, there exists an optimal path between X and the end point. In other words if the optimal path (start point to end point) goes through X then both its parts start point to X and X to end are also optimal.


Related Discussions:- Images - systems research group

What is 2d, Question 1 What is 2D? Explain method of converting 2D pattern...

Question 1 What is 2D? Explain method of converting 2D patterns into 3D images Question 2 Write about the following tools to create dart Create dart Multiply dar

What is the maximum number of objects such can be handled, What is the maxi...

What is the maximum number of objects such can be handled via the depth/z- buffer algorithm? Solution : In z-buffer algorithm, an arbitrary number of objects can be handled sin

Architecture-applications for computer animation, Architecture: One of the...

Architecture: One of the purposes for the development of virtual reality (that is in fact a form of computer animation) was which it was going to be very helpful to architects. He

Give three ways to display a panel, QUESTION (a) Give some ways you can...

QUESTION (a) Give some ways you can change the magnification of a document? (b) Give three ways to display a panel? (c) Identify the differences between Selection tool an

Tagged image file format, TIFF: It is Tagged Image file format which is us...

TIFF: It is Tagged Image file format which is used mainly for exchanging documents among various applications and computers. This was primarily designed to turn into the standa

What is translation, What is translation?  Translation is the process o...

What is translation?  Translation is the process of changing the position of an object in a straight-line path from one coordinate location to another. Each point (x, y) in the

Draw the letters s, Draw the letters S, P, R or U of English alphabet using...

Draw the letters S, P, R or U of English alphabet using multiple Bézier curves.  A complete code for plotting Bezier curves is given previously. There in the code, control point

Ellipse generation algorithm - 2d shape primitives, Ellipse Generation Algo...

Ellipse Generation Algorithm  You know that a circle is symmetric in all the octants, while ellipse is symmetric with respect to four quadrants.  Therefore, to draw an ellipse,

Given two triangles p along with vertices as p1(100, Given two triangles P ...

Given two triangles P along with vertices as P1(100,100,50), P2(50,50,50), P3(150,50,50) and q along with vertices as Q1(40,80,60), q2(70,70,50), Q3( 10,75,70), determine that tria

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