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
Bitmap Graphics: The information below illustrates bitmap data. Bitmap images are a set of bits that form an image. The image comprises a matrix of individual dots or pixels wh

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

what is fixed point scaling? how composit transformation techniques works on it

Basic Transformations - 2-d and 3-d Transformations Consider the xy-coordinate system upon a plane. An object or Obj in a plane can be identified as a set of points. All objec

what is refresh buffer/ identify the content and organisation of the refresh buffer for the case of raster display and vector display.

Multimedia Tool Features General to nearly all multimedia tool platforms are various features for encapsulating the content, presenting the data, acquiring user input and cont

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

Mathematical description of an Oblique projection onto xy-plane  In order to expand the transformation for the oblique projection, identify the Figure. This figure explains a

For orthographic parallel projection:    glOrtho(left, right, bottom, top, near, far);  glOrtho2D(left, right, bottom, top);    Here left, right define the x-direction ex

Diffuse Reflection - Polygon Rendering & Ray Tracing Methods It is characteristic of light reflected from a non-shiny, dull surface. Objects illuminated solely through diff