Images - systems research group, Computer Graphics

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.

Posted Date: 3/15/2013 1:43:29 AM | Location : United States







Related Discussions:- Images - systems research group, Assignment Help, Ask Question on Images - systems research group, Get Answer, Expert's Help, Images - systems research group Discussions

Write discussion on Images - systems research group
Your posts are moderated
Related Questions
Consider a Shiny Surface Along With Diffused Reflection coefficient Consider a shiny surface along with diffused reflection coefficient of 0.8 and ambient reflection coeffici

Use DDA algorithm to get the output of your program as shown in Figure ANs: Use DDA( ) function to plot line segments that have end points on diametrically opposite points

QUESTION (a) Name the spaces and guides in the Figure below                 (b) What is the difference between Pantone and Process colors? Elaborate (c) Explain what i

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

What is the difference between impact and non-impact printers?  Impact printer press produced character faces against an inked ribbon on to the paper. A line printer and dot-ma

Traditional Animation Techniques - Computer Animation Before the advent of computer animation, each animation was done via hand that involves an enormous amount of work. You

Principal vanishing point write respect to Z-axis Principal vanishing point w.r.t z-axis: By the 3rd row of matrix equation, we declare that the principal vanishing point w

Translation, Rotation and Scaling -  output primitives 1. Two basic approaches used in character generation are - Bitmap method and outline method.  2. All 2D geometric tran

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 discr

Essentialily of Computer Simulation You may want to understand why to do simulation? Is there any one way to perform the tasks? To converse these matters lets briefly discuss