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
Numerical Analysis Packages: generally utilized software is: MatLab. Characteristics: Focus generally on numeric processing. Programming with mathematical skills usuall

Passive Computer Animations: That has no option for users to utilize computer graphics today is mostly interactive for example: movies. Frame animation is non-interactive anim

Construction of a Solid with a Translational Sweep Figure demonstrates construction of a solid along with a translational sweep. Translating the control points of the periodic

i want to learn how to programme

determine the form of the transformation matrix for a reflection about an arbitrary line with equation y=mx+b.

refreh buffer


Transformation for 3-D Rotation Rotation in 3-dimensions is considerably more complicated then rotation in 2-dimensions. In 2-Dimentional, a rotation is prescribed via an angl

Step1:  Read a text file which we want to hide. Step2:  Transform it into an array of its binary value. Step3: Transform this array into its equivalent one dimensional array

Obtain an MRI image using the Open Source internet resources. i. Read the image into Scilab ii. Plot the image iii. Covert it into grayscale image and plot it iv. Find/