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

How graphics output changes according to dpi, Question : (a) List and d...

Question : (a) List and describe important aspects to take into consideration when looking at paper for print. (b) Describe clearly the meaning of the following words: I.

Important points for bresenham line generation algorithm, Important points ...

Important points for Bresenham Line Generation Algorithm Note: Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry

Geometric tables - polygon tables, Geometric tables - Polygon Tables ...

Geometric tables - Polygon Tables 1) Vertex table: Keep vertices' coordinates values in the object. 2) Edge table: Keep pointers back in to the vertex table for identif

Representational animation - computer animation, Representational Animation...

Representational Animation - Computer Animation This method permits an object to change its shape throughout the animation. There are three sub-types to this. The initial is th

Arguments made in favour of analog sound, Arguments made in favour of Analo...

Arguments made in favour of Analog Sound Shape of the waveforms: from digital signals sound reconstructed which is claimed to be harsher and unnatural compared to analog si

Image classification, The image classification is the process to categorize...

The image classification is the process to categorize images into one of several classes or categories. In this project, there are seven categories (Piano, Kangaroo, Strawberry, Su

Quicktime and real video, Quicktime Quicktime is the video format devis...

Quicktime Quicktime is the video format devised through and used through Apple and can be utilized at varying quality and file sizes. This is quite broadly used and has affecte

Viewing transformation, Viewing Transformation In previous section, we...

Viewing Transformation In previous section, we have discussed about the geometric transformations as Translation, Shearing, Reflection, Scaling and Rotation. Rotation, Reflect

Dv encoder type 1, DV Encoder Type 1 : The video and audio streams are tog...

DV Encoder Type 1 : The video and audio streams are together interfaces by standard DV bit stream. Such format is fully supported through DirectShow which accepts this interleaved

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