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

What is the minimum amount of video ram, Consider a raster system with the ...

Consider a raster system with the resolution of 1024 x 768 pixels and the color palette calls for 65,536 colors. What is the minimum amount of video RAM that the computer must have

Fixed point scaling, what is fixed point scaling? how composit transformati...

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

Vecgen algorithm, explain vecgen line drawing algorithm

explain vecgen line drawing algorithm

Three dimensional display methods - 2d clipping algorithms, Three dimension...

Three dimensional display methods: Among the simplest three dimensional surface representations are the polygonal surfaces.  A polygonal surface is described by vertices

State the advantages and disadvantages of CAD, State the Advantages AND Dis...

State the Advantages AND Disadvantages of CAD       Advantages of CAD                                                               Disadvantages of CAD - Easier to modif

Image processing, Image Processing New digital technology has made this...

Image Processing New digital technology has made this possible for the manipulation of multi- dimensional signals along with systems which range from easy digital circuits to

Vecgen algorithm and bresenham line, what is vecgen algorithm and bresenha...

what is vecgen algorithm and bresenham linequestion..

Flash - software to generate computer animations, Flash - software to gener...

Flash - software to generate computer animations Flash: Learning Macro-Media's Flash can quite complicated, although you can do almost anything along with it. You can devel

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