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

CRT, why there is coating of phosphorous on CRT screen?

why there is coating of phosphorous on CRT screen?

Area subdivision method-obscures the continuing two surface, Assume here ar...

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5) And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,

Categories of line segments - 2d clipping algorithms, Categories of Line Se...

Categories of Line Segments It categorizes line segments into three categories (i) trivially rejected (ii) trivially selected (iii) may be partially visible or totally invisibl

What is a dot size, What is a dot size? Dot size may be explained as th...

What is a dot size? Dot size may be explained as the diameter of a single dot on the devices output. Dot size is also known as the Spot size.

Convex shaped window and concave or non convex shaped window, Well you migh...

Well you might surprise to what a convex window? In common, on the basis of the shapes the windows are categorized into two classes: i) A Convex shaped windows: Windows of a s

Clip a line segment - cyrus beck line clipping algorithm, How does the Cyru...

How does the Cyrus Beck line clipping algorithm, clip a line segment whether the window is non convex? Solution : see the following figure 13, now the window is non-convex in s

Animation and games - cad and cam, Animation and Games - CAD and CAM I...

Animation and Games - CAD and CAM In our childhood, we all have seen that the flip books of cricketers that came free with some soft drink and where some pictures of similar p

PHONG INTERPOLATION, DESCRIBE PHONG INTERPOLATION SHADING METHOD

DESCRIBE PHONG INTERPOLATION SHADING METHOD

Explain the merits and demerits of plasma panel display, Explain the merits...

Explain the merits and demerits of Plasma panel display. Advantages: Refreshing is not needed. Produce a very steady image free of Flicker. Less bulky than a CRT.

Linearly interpolate - modeling and rendering, Linearly interpolate - Model...

Linearly interpolate - Modeling and Rendering I 4 = I 1 + t (I 2 - I 1 ); here t = (|y 1 - y 2 |)/(|y 1 - y 2 |) I D = I A + t (I B - I A ); here t = (|AD|)/(|AB|)

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