Journal
IMAGE PROCESSING ON LINE
Volume 7, Issue -, Pages 218-245Publisher
IMAGE PROCESSING ONLINE-IPOL
DOI: 10.5201/ipol.2017.204
Keywords
multi-class classification; hyperspectral video; energy minimization; MBO scheme; Nystrom extension method; parallel computing
Categories
Funding
- NSF grant [DMS-1417674, DMS-1118971]
- UC Lab Fees Research grant [12-LR-236660]
- ONR grant [N00014-16-1-2119]
- U.S. Department of Energy [DE-AC02-05CH11231]
- Office of Science of the U.S. Department of Energy [DE-AC02-05CH11231]
- Division Of Mathematical Sciences
- Direct For Mathematical & Physical Scien [1118971] Funding Source: National Science Foundation
Ask authors/readers for more resources
Hyperspectral imagery is a challenging modality due to the dimension of the pixels which can range from hundreds to over a thousand frequencies depending on the sensor. Most methods in the literature reduce the dimension of the data using a method such as principal component analysis, however this procedure can lose information. More recently methods have been developed to address classification of large datasets in high dimensions. This paper presents two classes of graph-based classification methods for hyperspectral imagery. Using the full dimensionality of the data, we consider a similarity graph based on pairwise comparisons of pixels. The graph is segmented using a pseudospectral algorithm for graph clustering that requires information about the eigenfunctions of the graph Laplacian but does not require computation of the full graph. We develop a parallel version of the Nystrbm extension method to randomly sample the graph to construct a low rank approximation of the graph Laplacian. With at most a few hundred eigenfunctions, we can implement the clustering method designed to solve a variational problem for a graph-cut-based semi-supervised or unsupervised classification problem. We implement OpenMP directive-based parallelism in our algorithms and show performance improvement and strong, almost ideal, scaling behavior. The method can handle very large datasets including a video sequence with over a million pixels, and the problem of segmenting a data set into a pre-determined number of classes. Source Code The reviewed source code and documentation for this algorithm are available from the web page of this article(1). Compilation and usage instructions are included in the README. txt file of the archive.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available