A constrained optimization perspective on joint spatial resolution and dynamic range enhancement

The problem of resolution enhancement in images from multiple low-resolution captures has garnered significant attention over the last decade. While initial algorithms estimated the unknown high-resolution (hi-res) image for a fixed set of imaging model parameters, significant recent advances have b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Monga, V, Srinivas, U
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The problem of resolution enhancement in images from multiple low-resolution captures has garnered significant attention over the last decade. While initial algorithms estimated the unknown high-resolution (hi-res) image for a fixed set of imaging model parameters, significant recent advances have been in simultaneous maximum aposteriori (MAP) estimation of the hi-res image as well as the geometric registration parameters under a variety of noise and prior models. A key computational challenge however, lies in the algorithmic tractability of the resulting optimization problem. Independently, there has been a surge in approaches for enhancing amplitude (or dynamic range) resolution in images from multiple captures. We develop a novel constrained optimization framework to address the problem of joint estimation of imaging model parameters and the unknown hi-res, high dynamic range image. In this framework, we employ a transformation of variables to establish separable convexity of the cost function under any l p norm, p ≥ 1, in the individual variables of geometric and photometric registration parameters, optical blur and the unknown hi-res image. We formulate evolving convex constraints which ensure that the registration parameters as well as the reconstructed image remain physically meaningful. The convergence guarantee afforded by our algorithm alleviates unreasonable demands on initialization, and produces reconstructed image results approaching practical upper bounds. Several existing formulations reduce to special cases of our framework making the algorithm broadly applicable.
ISSN:1058-6393
2576-2303
DOI:10.1109/ACSSC.2010.5757691