Infinite Dimensional Optimization Models and PDEs for Dejittering
- Author(s)
- Guozhi Dong, Aniello Raffaele Patrone, Otmar Scherzer, Ozan Öktem
- Abstract
In this paper we do a systematic investigation of continuous methods for pixel, line pixel and line dejittering. The basis for these investigations are the discrete line dejittering algorithm of Nikolova and the partial differential equation of Lenzen et al for pixel dejittering. To put these two different worlds in perspective we find infinite dimensional optimization algorithms linking to the finite dimensional optimization problems and formal flows associated with the infinite dimensional optimization problems. Two different kinds of optimization problems will be considered: Dejittering algorithms for determining the displacement and displacement error correction formulations, which correct the jittered image, without estimating the jitter. As a by-product we find novel variational methods for displacement error regularization and unify them into one family. The second novelty is a comprehensive comparison of the different models for different types of jitter, in terms of efficiency of reconstruction and numerical complexity.
- Organisation(s)
- Vienna Cognitive Science Hub
- External organisation(s)
- KTH - Royal Institute of Technology
- Pages
- 678-689
- No. of pages
- 12
- DOI
- https://doi.org/10.1007/978-3-319-18461-6_54
- Publication date
- 2015
- Peer reviewed
- Yes
- Austrian Fields of Science 2012
- 101028 Mathematical modelling
- Keywords
- ASJC Scopus subject areas
- Theoretical Computer Science, Computer Science(all)
- Portal url
- https://ucris.univie.ac.at/portal/en/publications/infinite-dimensional-optimization-models-and-pdes-for-dejittering(3414755b-9801-4cf9-bc59-ebc45e90b98e).html