A MAP-Based Approach for Hyperspectral Imagery Super-Resolution

Date

2018-06-01

Author

IRMAK, Hasan
Akar, Gözde
Yuksel, Seniha Esen

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

236
views

0
downloads

In this paper, we propose a novel single image Bayesian super-resolution (SR) algorithm where the hyperspectral image (HSI) is the only source of information. The main contribution of the proposed approach is to convert the ill-posed SR reconstruction problem in the spectral domain to a quadratic optimization problem in the abundance map domain. In order to do so, Markov random field based energy minimization approach is proposed and proved that the solution is quadratic. The proposed approach consists of five main steps. First, the number of endmembers in the scene is determined using virtual dimensionality. Second, the endmembers and their low resolution abundance maps are computed using simplex identification via the splitted augmented Lagrangian and fully constrained least squares algorithms. Third, high resolution (HR) abundance maps are obtained using our proposed maximum a posteriori based energy function. This energy function is minimized subject to smoothness, unity, and boundary constraints. Fourth, the HR abundance maps are further enhanced with texture preserving methods. Finally, HR HSI is reconstructed using the extracted endmembers and the enhanced abundance maps. The proposed method is tested on three real HSI data sets; namely the Cave, Harvard, and Hyperspectral Remote Sensing Scenes and compared with state-of-the-art alternative methods using peak signal to noise ratio, structural similarity, spectral angle mapper, and relative dimensionless global error in synthesis metrics. It is shown that the proposed method outperforms the state of the art methods in terms of quality while preserving the spectral consistency.

Subject Keywords

Software, Computer Graphics and Computer-Aided Design

URI

https://hdl.handle.net/11511/35627

Journal

IEEE TRANSACTIONS ON IMAGE PROCESSING

DOI

https://doi.org/10.1109/tip.2018.2814210

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Minimization of Monotonically Levelable Higher Order MRF Energies via Graph Cuts Karci, Mehmet Haydar; Demirekler, Mübeccel (Institute of Electrical and Electronics Engineers (IEEE), 2010-11-01) A feature of minimizing images of submodular binary Markov random field (MRF) energies is introduced. Using this novel feature, the collection of minimizing images of levels of higher order, monotonically levelable multilabel MRF energies is shown to constitute a monotone collection. This implies that these minimizing binary images can be combined to give minimizing images of the multilabel MRF energies. Thanks to the graph cuts framework, the mentioned class of binary MRF energies is known to be minimized ...
Effects of using different boundary conditions and computational domain dimensions on modeling and simulations of periodic metamaterial arrays in microwave frequencies Turkmen, Oznur; EKMEKÇİ, Evren; Sayan, Gönül (Wiley, 2013-07-01) This article aims to demonstrate the effects of using different boundary conditions and different computational volume dimensions in numerical simulations of periodic metamaterial arrays. A double band metamaterial unit cell design will be utilized to show that use of different boundary conditions may result in simulation of dissimilar periodic array topologies with completely different electromagnetic responses. It will also be shown that dimensions of the computational volume may strongly affect the overa...
Extending Correlation Filter-Based Visual Tracking by Tree-Structured Ensemble and Spatial Windowing Gundogdu, Erhan; Özkan, Huseyin; Alatan, Abdullah Aydın (Institute of Electrical and Electronics Engineers (IEEE), 2017-11-01) Correlation filters have been successfully used in visual tracking due to their modeling power and computational efficiency. However, the state-of-the-art correlation filter-based (CFB) tracking algorithms tend to quickly discard the previous poses of the target, since they consider only a single filter in their models. On the contrary, our approach is to register multiple CFB trackers for previous poses and exploit the registered knowledge when an appearance change occurs. To this end, we propose a novel t...
A Distributed Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem Cinel, Sertac; Bazlamaçcı, Cüneyt Fehmi (Institute of Electrical and Electronics Engineers (IEEE), 2008-11-01) Rectilinear Steiner minimal tree (RSMT) problem finds a minimum length tree that interconnects a given set of points by only horizontal and vertical line segments and by using extra points if necessary. In this paper, to speedup the RSMT construction, two recently developed successful heuristic algorithms, namely rectilinear steiner tree (RST) by Zhou and hatched greedy algorithm (BGA) by Kahng et al., have been used as the basis. Following a slight modification on RST, which led to a nonrecursive and a con...
Monte Carlo analysis of ridged waveguides with transformation media Ozgun, Ozlem; Kuzuoğlu, Mustafa (Wiley, 2013-07-01) A computational model is presented for Monte Carlo simulation of waveguides with ridges, by combining the principles of transformation electromagnetics and the finite methods (such as finite element or finite difference methods). The principle idea is to place a transformation medium around the ridge structure, so that a single and easy-to-generate mesh can be used for each realization of the Monte Carlo simulation. Hence, this approach leads to less computational resources. The technique is validated by me...

Citation Formats

H. IRMAK, G. Akar, and S. E. Yuksel, “A MAP-Based Approach for Hyperspectral Imagery Super-Resolution,” IEEE TRANSACTIONS ON IMAGE PROCESSING, pp. 2942–2951, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35627.