Outlier removal power of the L1-norm super-resolution

6Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Super-resolution combines several low resolution images having different sampling into a high resolution image. L1-norm data fit minimization has been proposed to solve this problem in a robust way. The outlier rejection capability of this methods has been shown experimentally for super-resolution. However, existing approaches add a regularization term to perform the minimization while it may not be necessary. In this paper, we recall the link between robustness to outliers and the sparse recovery framework. We use a slightly weaker Null Space Property to characterize this capability. Then, we apply these results to super resolution and show both theoretically and experimentally that we can quantify the robustness to outliers with respect to the number of images. © 2013 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Traonmilin, Y., Ladjal, S., & Almansa, A. (2013). Outlier removal power of the L1-norm super-resolution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7893 LNCS, pp. 198–209). https://doi.org/10.1007/978-3-642-38267-3_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free