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
Explain the advantage and disadvantage of Raster CRT Advantages Allows solids, not just wireframes Leverages low-cost CRT technology (i.e., TVs) Bright, i.e.

2. Describe how the Bresenham rasterisation algorithm is advantageous when compared to any other existing method.

Question) Compute the following:  a) Size of 420 × 300 image at 240 pixels per inch.  b) Resolution (per square inch) of  3 ×  2 inch image that has  768×512 pixels.  c) H

refreh buffer

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

Categories of Orthographic Projection Orthographic projection is additionally divided into Multi-view projection and axonometric projection, depending upon where the direction

Consider the line segment AB in 3-Dimentional parallel to the z-axis along with end points A (- 5,4,2) and also B (5,-6,18). Carry out a perspective projection upon the X=0 plane;

Rotation about the origin - 2-d and 3-d transformations Specified a 2-D point P(x,y), which we need to rotate, along with respect to the origin O. The vector OP has a length '

Silicon Graphics - Hardware for computer animation The SGI platform is one of the most broadly used hardware platforms in professional or broadcast feature computer animation