Coherent computation of the multispectral maximal directional derivative

  • Greenshields I
  • 1


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


We describe an approach to the computation of the planar or volumetric maximal directional derivative (gradient) of a multispectral or hyperspectral image. We show that the planar multispectral case has an immediate solution. For the non-planar (volumetric or multitemporal) case we demonstrate that an iterative optimization technique (downhill simplex) exploiting image coherency is faster than the conventional eigendecomposition. Finally, we show that the iterative technique, based on matrix norms, has extensions not meaningful in the eigendecomposition method.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • I. R. Greenshields

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free