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

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

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

Diffuse reflection - polygon rendering & ray tracing methods, Diffuse Refle...

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

High level techniques - motion specification, High Level Techniques (Motion...

High Level Techniques (Motion Generalized) These are techniques utilized to explain the general motion behavior of any type of graphic object. Such techniques are algorithms o

Draw line segment - digital differential analyzer algorithm, Example 1: Dr...

Example 1: Draw line segment from point (2, 4) to (9, 9) by using Digital Differential Analyzer algorithm. Solution: We know usual equation of line is specified via y = mx

Subdivision algorithm - visible surface detection, Subdivision Algorithm - ...

Subdivision Algorithm - Visible Surface Detection 1) Initialize the area to be the whole screen. 2) Create a PVPL regarding an area, sorted on z min as the smallest z coor

Vertical retrace - display devices, Vertical retrace - Display Devices ...

Vertical retrace - Display Devices In a refresh CRT monitor, the time it takes for an electron beam to return to the top, left most point on the monitor after refreshing all ho

Define random scan and raster scan displays, Define Random Scan/Raster Scan...

Define Random Scan/Raster Scan displays. Ans. Random scan is a process in which the display is made by the electronic beam, which is directed, only to the points or division of

Parallel source and distributed light source, Parallel source and Distribut...

Parallel source and Distributed light source a) Parallel source: this is to be noted that while point source is at an infinite distance then light rays are parallel and func

Interactive 3d computer graphics, Describe interactive model of computer gr...

Describe interactive model of computer graphics and application areas of interactive computer graphics.

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