{'fraction_non_alphanumeric': 0.01979045401629802, 'fraction_numerical': 0.002328288707799767, 'mean_word_length': 5.466165413533835, '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}}
Multiplicative updates algorithm to minimize the generalized total variation functional with a non-negativity constraint

We propose an efficient algorithm to solve the generalized Total Variation (TV) functional with a non-negativity constraint. This algorithm, which does not involve the solution of a linear system, but rather multiplicative updates only, can be used to solve the denoising and deconvolution problems. The derivation of our method is straightforward once the generalized TV functional is cast as a Non-negative Quadratic Programming (NQP) problem. The proposed algorithm offers a fair computational performance to solve the ℓ2-TV and ℓ1-TV denoising and deconvolution problems and it is the fastest algorithm of which we are aware for general inverse problems involving a nontrivial forward linear operator and a non-negativity constraint.