{'fraction_non_alphanumeric': 0.013527575442247659, 'fraction_numerical': 0.0, 'mean_word_length': 5.589041095890411, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Primal-dual algorithm for solving a convex image dejittering model with hybrid finite differences

Jittering is a common phenomenon arising from the area of multimedia data compression and wireless video transmission. The visual abnormality of a jittered image is the jag in edge and loss of synchronization in latitudinal direction. Typically, the problem of intrinsic image dejittering is challenging to be tackled because of the ubiquitous noise in jittered data. In this paper, we develop a convex variational model for solving image dejittering problem by exerting high-order finite differences regularizer in objective function and exploiting linearization to constraints. Upon the recent progress in convex optimization community, the proposed model can be efficiently solved by the first-order primal-dual algorithm. Numerical simulations on recovering both noiseless and noisy jittered data demonstrate the compelling performance of the proposed model.