# A Dynamic Programming Solution to Bounded Dejittering Problems

**Authors:** Lukas F. Lang

arXiv: 1703.09161 · 2017-03-28

## TL;DR

This paper introduces a dynamic programming approach to solve image dejittering problems involving bounded displacements, providing efficient algorithms for removing various types of jitter such as line, line pixel, and pixel jitter.

## Contribution

The paper presents a novel dynamic programming framework specifically designed for bounded dejittering problems in images, improving efficiency over previous methods.

## Key findings

- Effective removal of line jitter, line pixel jitter, and pixel jitter.
- Algorithms demonstrate improved efficiency in dejittering tasks.
- Applicable to various jitter correction scenarios.

## 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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1703.09161/full.md

## Figures

32 figures with captions in the complete paper: https://tomesphere.com/paper/1703.09161/full.md

## References

18 references — full list in the complete paper: https://tomesphere.com/paper/1703.09161/full.md

---
Source: https://tomesphere.com/paper/1703.09161