Acknowledgement

This work was supported in part by the Bernard M. Gordon Center for
Subsurface Sensing and Imaging Systems, under the Engineering Research
Centers Program of the National Science Foundation (Award Number EEC-
9986821), and a grant from the SBIR/STTR and ERC Collaboration Opportunity
(SECO) program of the National Science Foundation (Award ###).
Abstract
Spectroscopy Algorithm
Matthew Sellitto, and David Kaeli, Department of Electrical and Computer Engineering, Northeastern University
James Goodman, HySpeed Computing LLC
Accelerating an Imaging Spectroscopy Algorithm for Submerged Marine Environment Using GPUs
Graphics Processing Units (GPUs) have proven to be highly
effective at accelerating processing speed for a range of scientific
applications. As data needs increase, and more complex data
analysis methods are used, the processing requirements for solving
scientific problems also increase. The parallel processing power of
GPUs can be harnessed to address these needs. As an example,
there are many scientific problems that require solving non-linear
optimization problems of multiple variables across large arrays of
data. These problems require a great deal of computational time to
solve. By utilizing modern optimization techniques and combining
them with the raw computational throughput of the GPU, we can
greatly decrease the processing time required to solve problems of
this form. Through an NSF sponsored collaboration between
Northeastern University and HySpeed Computing LLC, we
demonstrate the advantages of this technology by accelerating an
imaging spectroscopy algorithm for submerged marine habitats using
GPU computing and iterative optimization techniques. Results
indicate that considerable improvement in performance of
approximately two orders of magnitude can be achieved on a GPU
compared to serial processing on the CPU using the same
techniques. This technology has enormous potential for continued
growth in exploiting high performance computing, and provides the
foundation for significantly enhanced remote sensing capabilities.











GPUs have proven to be incredibly effective at accelerating a large
range of scientific and general purpose applications, with the latest
offerings exceeding a Teraflop of computational capability.

Many scientific problems require solving non-linear optimization
problems of multiple variables across large arrays of data. These
types of problems are classified as highly difficult and require a great
deal of computational time to solve.

Remote sensing, i.e. image acquisition from satellite, airplane and
UAV, includes many computationally intensive applications, as well
as increasing data volumes and complexity of algorithms, that can
benefit from GPU computing.

As an example, imaging spectroscopy, i.e. hyperspectral remote
sensing, measures numerous, narrow, contiguous portions of the
spectrum, which provides valuable added information to improve
image analysis and enables differentiation of environmental
parameters.

The massive parallel processing power of GPUs combined with
modern iterative optimization techniques to allow the acceleration of
imaging algorithms such as imaging spectroscopy.
Discussion

The following is a visualization of the results obtained for processing
a synthetic hyperspectral image using a modified steepest descent
optimization algorithm.
References
James A. Goodman, Dave Kaeli, and Dana Schaa, 2011, Accelerating an Imaging
Spectroscopy Algorithm for Submerged Marine Environments Using Graphics
Processing Units, Journal of Selected Topics in Earth Observation and Remote
Sensing.

James A. Goodman and Susan L. Ustin, 2007, Classification of Benthic
Composition in a Coral Reef Environment Using Spectral Unmixing, Journal of
Applied Remote Sensing, Vol. 1, 011501.
Spectroscopy Inversion Model

The spectroscopy algorithm utilizes an inverse semi-analytical
model to derive water properties, water depth, and bottom albedo
from imaging spectroscopy data.
Introduction
Results from the modified steepest descent method produce
good accuracy across the entire solution space, and
demonstrate that GPU version of the algorithm implemented on
a single GPU obtains >100x speedup over a comparable serial
version on the CPU.

The current implementation of the projected-BFGS method
produces reasonable accuracy for estimation of water properties
(P,G,BP), but reduced accuracy for water depth (H) and bottom
albedo (B). Methods are being explored to improve the overall
accuracy of this method.

The projected-BFGS method is significantly more efficient, with
serial implementation on the CPU for this method comparable in
processing time to the GPU implementation of the steepest
descent method.

With improvement in accuracy of the projected-BFGS method, it
is expected that significant additional speedup can be obtained,
with computations reaching real-time processing speed for this
complex inversion algorithm.
Approach Steepest Descent Results Projected-BFGS Results

Explore the relative accuracy and computational tradeoff among
different optimization methods, and select the method(s) most
appropriate for solving a complex imaging spectroscopy algorithm.

Initial effort focused on a modified steepest descent method, which
produced accurate output, but with room for improvement in terms of
computation time.

Current work is focused on using a quasi-newton projected-BFGS
method to find the search direction and a quadratic-interpolation line
search to determine the optimal step size.

The objective is to balance tradeoffs between accuracy and speed,
and ideally achieve the goal of real-time processing.

Projected-BFGS Method


Research to Reality

GPU technology provides enormous potential for the acceleration of
data-intensive applications.

A GPU accelerated optimization library would be extremely useful in
accelerating a wide variety of data-intensive scientific applications.

The optimization algorithm framework uses modern optimization
techniques to be able to solve problems quickly from a wide variety of
different scientific areas.

GPU technology and the techniques used in this research have
enormous potential for continued growth and could provide the
foundation for significantly enhanced remote sensing capabilities.

The hyperspectral algorithm for coastal environments demonstrates
the advantages and capabilities of a GPU optimization framework.

Algorithms written in OpenCL will be able to take advantage of the
increased parallel processing capabilities and run on a wide array of
GPU products from multiple vendors.
1
14
27
40
1
1
4
2
7
4
0
5
3
6
6
7
9
9
2
1
0
5
1
1
8
1
3
1
1
4
4
1
5
7
1
7
0
1
8
3
1
9
6
2
0
9
2
2
2
2
3
5
2
4
8
Derived Output (P)
1
14
27
40
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (P)
1
12
23
34
45
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (G)
1
14
27
40
1
1
4
2
7
4
0
5
3
6
6
7
9
9
2
1
0
5
1
1
8
1
3
1
1
4
4
1
5
7
1
7
0
1
8
3
1
9
6
2
0
9
2
2
2
2
3
5
2
4
8
Derived Output (G)
1
14
27
40
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (BP)
1
12
23
34
45
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (B)
1
14
27
40
1
1
4
2
7
4
0
5
3
6
6
7
9
9
2
1
0
5
1
1
8
1
3
1
1
4
4
1
5
7
1
7
0
1
8
3
1
9
6
2
0
9
2
2
2
2
3
5
2
4
8
Derived Output (B)
1
12
23
34
45
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
1
1
0
1
1
1
1
1
2
1
1
3
1
1
4
1
1
5
1
1
6
1
1
7
1
1
8
1
1
9
1
2
0
1
2
1
1
2
2
1
2
3
1
2
4
1
2
5
1
Known Input (H)
1
12
23
34
45
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
1
1
0
1
1
1
1
1
2
1
1
3
1
1
4
1
1
5
1
1
6
1
1
7
1
1
8
1
1
9
1
2
0
1
2
1
1
2
2
1
2
3
1
2
4
1
2
5
1
Derived Output (H)

The following is a visualization of the results obtained for processing
a synthetic hyperspectral image using a projected-BFGS optimization
algorithm.
1
14
27
40
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (P)
1
12
23
34
45
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (G)
1
14
27
40
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (BP)
1
12
23
34
45
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Known Input (B)
1
12
23
34
45
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
1
1
0
1
1
1
1
1
2
1
1
3
1
1
4
1
1
5
1
1
6
1
1
7
1
1
8
1
1
9
1
2
0
1
2
1
1
2
2
1
2
3
1
2
4
1
2
5
1
Known Input (H)
1
12
23
34
45
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Derived Output (P)
1
14
27
40
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
1
0
0
1
1
1
1
2
2
1
3
3
1
4
4
1
5
5
1
6
6
1
7
7
1
8
8
1
9
9
2
1
0
2
2
1
2
3
2
2
4
3
2
5
4
Derived Output (G)
1
12
23
34
45
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
1
1
0
1
1
1
1
1
2
1
1
3
1
1
4
1
1
5
1
1
6
1
1
7
1
1
8
1
1
9
1
2
0
1
2
1
1
2
2
1
2
3
1
2
4
1
2
5
1
Derived Output (BP)
1
12
23
34
45
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
1
1
0
1
1
1
1
1
2
1
1
3
1
1
4
1
1
5
1
1
6
1
1
7
1
1
8
1
1
9
1
2
0
1
2
1
1
2
2
1
2
3
1
2
4
1
2
5
1
Derived Output (B)
1
12
23
34
45
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
1
1
0
1
1
1
1
1
2
1
1
3
1
1
4
1
1
5
1
1
6
1
1
7
1
1
8
1
1
9
1
2
0
1
2
1
1
2
2
1
2
3
1
2
4
1
2
5
1
Derived Output (H)