A Dynamic Programming Solution to Bounded Dejittering Problems

DOI10.1007/978-3-319-58771-4_12MaRDI QIDQ5864004zbMATH OpenOpenAlexFDO

Authors Lukas F. Lang

Publication date 3 June 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.09161

zbMATH Keywords

block coordinate descentdejitteringdynamic programming solutionline jitterpixel jitter

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Dynamic programming (90C39) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: We propose a dynamic programming solution to image dejittering problems with bounded displacements and obtain efficient algorithms for the removal of line jitter, line pixel jitter, and pixel jitter.

Recommendations

• Dynamic programming and lower-bound approaches to the minimum binding problem
• On Bounds for Dynamic Programs
• Dynamic programming in the problem of decomposition optimization
• A dynamic programming algorithm on higher-dimensional 0-1 bottleneck problems
• Bounds for the approximation of dynamic programs
• Separable Dynamic Programming and Approximate Decomposition Methods
• A bound-improving approach to discrete programming problems
• A class of nonseparable dynamic programming problems
• scientific article; zbMATH DE number 5081719
• Optimization of dynamic programming methods when solving extremal combinatorial problems

Cited in

(1)

• Batched dynamic solutions to decomposable searching problems

This page was built for publication: A Dynamic Programming Solution to Bounded Dejittering Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864004)