Multilspectral snapshot demosaicing via non-convex matrix completion

02/28/2019
by   Giancarlo A. Antonucci, et al.
0

Snapshot mosaic multispectral imagery acquires an undersampled data cube by acquiring a single spectral measurement per spatial pixel. Sensors which acquire p frequencies, therefore, suffer from severe 1/p undersampling of the full data cube. We show that the missing entries can be accurately imputed using non-convex techniques from sparse approximation and matrix completion initialised with traditional demosaicing algorithms. In particular, we observe the peak signal-to-noise ratio can typically be improved by 2 to 5 dB over current state-of-the-art methods when simulating a p=16 mosaic sensor measuring both high and low altitude urban and rural scenes as well as ground-based scenes.

READ FULL TEXT

page 3

page 4

research
08/11/2014

Matrix Completion under Interval Uncertainty

Matrix completion under interval uncertainty can be cast as matrix compl...
research
05/24/2016

Matrix Completion has No Spurious Local Minimum

Matrix completion is a basic machine learning problem that has wide appl...
research
02/27/2013

Missing Entries Matrix Approximation and Completion

We describe several algorithms for matrix completion and matrix approxim...
research
08/06/2018

Improving Temporal Interpolation of Head and Body Pose using Gaussian Process Regression in a Matrix Completion Setting

This paper presents a model for head and body pose estimation (HBPE) whe...
research
03/28/2018

Non-Convex Matrix Completion Against a Semi-Random Adversary

Matrix completion is a well-studied problem with many machine learning a...
research
12/07/2015

Pseudo-Bayesian Robust PCA: Algorithms and Analyses

Commonly used in computer vision and other applications, robust PCA repr...

Please sign up or login with your details

Forgot password? Click here to reset