Experiment with the small test matrix, C/C++ Programming

Assignment Help:

For this assignment, I've provided a data file called 'elevation.mat', which contains the elevation data you'll be working with.  

Type load elevation.mat to get the variable map, which is a matrix of heights (in meters) for a region near Springfield.  You also get a small matrix test that is 10x10, on which you can experiment to make sure your code is behaving sensibly.

As a first step, display the map as a shaded image with

imagesc(map);

axis equal;

colormap gray;

 

(-1,-1)

(-1,0)

(-1,1)

(0,-1)

(0, 0)

P

(0,1)

(1,-1)

(1,0)

(1,1)

Now, here's the function you'll be implementing for this first part.  Every pixel P that is not on the boundary of the image has eight neighbors (above, below, left, right, and four diagonal neighbours).  Let's denote P as the pixel at row r and column c - I'll use (r, c) as shorthand for this. Water follows the path of steepest descent, so we would like to know, for each non-boundary pixel, the direction to the lowest height of the 9 cells around P, including P itself. One way to do that is to store, for each map point (r, c), both the row and the column offsets to its lowest neighbor. We can record these offsets in two matrices (one for rows, one for columns), each containing only the numbers  -1, 0, and +1. Look at the figure to see how these numbers map to the neighbours of a given pixel. As an example, if the lowest neighbour for pixel (r, c) is the pixel directly above, you would store the corresponding offsets of -1 and 0 at location (r, c) in the two offset matrices.

Since border pixels don't have all neighbours defined, let's assign boundary pixels to have both offsets zero.

Thus, for this first part, write and turn in a function that looks like:

function [roffset, coffset] = findLowNhbr(map)

This functions returns two matrices of the same size as map, so that pixel (r,c) in the map has pixel (r+roffset(r,c), c+coffset(r,c)) in the map as its lowest neighbour. 

What to submit: For this part, you do not need to turn in any output -include your m-file in the zip file, and also place the code for the function into the published html, as follows:

type findLowNhbr;   % put this line into the cell for Part 1 in solutionWatersheds.m

You may want to experiment with the small test matrix to check if your code is giving you reasonable results (for this small 10x10 test matrix, you should be able to calculate the offsets by hand).

A note on coding: Try to be as general as possible in your code. One example of this is to use statements such as [nrows,ncols] = size(map); to assign the numbers of rows and columns to variables nrows and ncols.  If you use nrows and ncols instead of the numbers, then you can run your code on any size maps without modification.


Related Discussions:- Experiment with the small test matrix

Diploma in IT, Function fact explain how the process of recursion works in ...

Function fact explain how the process of recursion works in C++.In your answer assume that the function is called to calculate the factorial of 6?

Operations on strings, 1 Aims The main purpose of the assignment is to ...

1 Aims The main purpose of the assignment is to let you practice the following programming techniques: perform operations on pointers to basic and more complex types;

String, palindrome is a string that reads the same from both the ends. Give...

palindrome is a string that reads the same from both the ends. Given a string S convert it to a palindrome by doing character replacement. Your task is to convert S to palindromes

Program to compute quadratic polynomial, Write a function that computes f(x...

Write a function that computes f(x) for a quadratic polynomial in x, such as the one in assignment 3. Use the function to plot f(x) from -10 to +10.

Loops, Create a program that will accept 3 numbers. The first number (num1)...

Create a program that will accept 3 numbers. The first number (num1) is the common difference and the second number (num2) is the starting number and the 3rd number (num3) is the m

Araay, create two array names and grade .in first array you have to store t...

create two array names and grade .in first array you have to store thease 10 names 1.a,2.3.r,4.s,5.l,6.k,7.n,8.b,9.z,10.d you have to enter grades for thease students.te program mu

Padovan string , .write a program that counts the number of occurrences of ...

.write a program that counts the number of occurrences of the string in the n-th padovan string p(n)   program in java // aakash , suraj , prem sasi kumar kamaraj college

Minimum shelf, how to find minimum number if shelves required

how to find minimum number if shelves required

Theory, recursive sub programs

recursive sub programs

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