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
find out points to the given control points

Common Steps of Designing the Animation Sequence Common Steps of designing the animation sequence are as given: 1) Layout of Storyboard: Storyboard layout is the action ou

Digital Video: Digital video is a form of video recording system which works through using a digital, quite than analog, representation of the video signal. It generic means,

An animation demonstrates a car driving along a road that is given by a Bezier curve along with the subsequent control points:  X k 0 5

QUESTION 1 Assume you work as Producer for the national TV channel in Mauritius. As such, you have been requested by the Director of Production to submit a proposal in the for

Painting and Drawing While we talk about graphics, we mean pictures can be either photographs or illustrations. If you want to acquire graphics into a Web page or multimedia r

Bresenham Line Generation Algorithm This algorithm is exact and efficient raster line generation algorithm. Such algorithm scan converts lines utilizing only incremental integ

Methods of Animation - Computer Animation First method: in this, artist makes a succession of cartoon frames that are then combined in a film. Second method: in this,


Other File Formats BMP/DIB/RLE File Formats These are termed as device independent bitmap files. They exist in two various type formats: a) OS2 format and b) Windows