1. Suppose that the boundary of a closed region is represented by a 4-directional chain code. Write a function Area(ChainCode) in pseudo-code to compute the area of the region given its chain code representation.
2. Show that the area enclosed by the polyline is
Area=1/2 abs(∑_(i=0)^(n-1)▒〖x[i+1] y[i]-x[i] y[i+1]〗)
3. Compare Hough transform and Canny edge detection for region detection in terms of (i) robustness (insensitivity) to noise, (ii) detection of regions with irregular shape, (iii) any common technique that is used both methods.
4. (a) Compare three losses compressions techniques in terms of their suitability for natural images.
(b) Explain which lossless compression technique use variable code length. Which technique results in the optimal code length?
5, Consider the 8 by 8 subimage
Apply the JPEG compression algorithm (see lecture notes) and find and report the 1-D coefficient sequence.
Use the region growing function (next page) to detect:
The red, blue, green regions in the ThreeRegions image (next page) by planting one seed in each region simultaneously. You must run the program only once to detect all three regions. This requires just a little modification to the attached function.
Extra-Credit:
Determine the centroid, area, and circularity of the regions detected in (a)
Find the minimum distance between the boundaries of the red and blue regions. Do not use your (human) vision and just assume that you have detected these two regions as in (a). You must come up with an efficient method. For example finding the distance of every pixel on the boundary of red region to every pixel in the boundary of blue region is inefficient.
The post Computer Vision first appeared on COMPLIANT PAPERS.