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

Displacement mapping, Implement displacement mapping and bump mapping on a ...

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

Display necessitate to store z-buffer?, Suppose here, one allows 256 depth ...

Suppose here, one allows 256 depth value levels to be employed. Approximately how much memory would a 512x512 pixel display necessitate to store z-buffer? Solution : A system w

What do you understand by complementary colors, Problem : a. (i) Giv...

Problem : a. (i) Give another name for adjacent color. (ii) Describe briefly what do you understand by an adjacent color? b. (i) Describe briefly what do you unders

Reflection, determine the tranformation matrix for reflection,computer grap...

determine the tranformation matrix for reflection,computer graphics

Raster scan display processor, Draw the block diagram of raster scan displa...

Draw the block diagram of raster scan display processor.

Gourand shading, what is ray tracing algorithm in hidden surface removal

what is ray tracing algorithm in hidden surface removal

What is a color management system, QUESTION a) What is a color manageme...

QUESTION a) What is a color management system? Briefly explain how it works. b) What are the three major factors affecting print permanence? c) Briefly explain three ways

Functioning of input devices - 2d shape primitives, Functioning of Input De...

Functioning of Input Devices Functioning of input devices-Keyboard, mouse, trackball and space ball, Joystick, data glove, digitizer, scanner, touch panel, light pen, voice sys

Explain the acoustic properties of sound, Problem: (a) What is meant b...

Problem: (a) What is meant by ‘Time - Stretching ‘in relation to a sound data file? (b) Calculate the size of a 5 minutes mono sound file of CD quality and with a 16 -bit

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