Problem 852. Index of neighbor pixel with steepest gradient

Created by Wolfgang Schwanghart

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>Unlike in various applications, where the gradient of a two dimensional matrix is calculated in x and y direction, the gradient of a digital elevation model (DEM) is usually returned as the steepest gradient. The steepest gradient is the largest downward slope of a pixel to one of its eight neighbors.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>In this problem, your task will be to return the linear index of the steepest neighbor for each pixel in a gridded DEM. Pixels that don't have downward neighbors should receive the index value zero.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>An example should help. The DEM is</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[dem = [1 5 9; ...\n       4 5 6; ...\n       8 7 3];]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The result should be</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[IX  = [0 1 4; ...\n       1 1 9; ...\n       2 9 0];]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>The results may not be unique, but the test cases have been built so that this is not a problem. The spatial resolution of the dem is dx=1 and dy=1. Note that the diagonal distance is hypot(dx,dy).</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

48 Solutions
21 Solvers

Last Solution submitted on Jul 11, 2021

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

Dishant Arora on 2 Aug 2012

I'v developed the code using padarray and ordfilt2, which satisfies the test suite on my system, but seems like cody doesn't support padarray, is this so??

Wolfgang Schwanghart on 2 Aug 2012

Hi Dishant, I thought the IPT is available, too, but apparently Cody does not support toolboxes at this time. see box on the right hand side: http://www.mathworks.de/matlabcentral/about/cody/

Jean-Marie Sainthillier on 19 Aug 2014

More difficult thant expected...

Rafael S.T. Vieira on 8 Jun 2020

Pay attention. The problem is asking for the index and not the value of the steepest gradient. And gradients on diagonals directions must be divided by sqrt(2).

Problem Recent Solvers21

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 852. Index of neighbor pixel with steepest gradient

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers21

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

Problem 852. Index of neighbor pixel with steepest gradient

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers21

Suggested Problems

More from this Author2

Problem Tags

Community Treasure Hunt

Players