{'fraction_non_alphanumeric': 0.017130620985010708, 'fraction_numerical': 0.0, 'mean_word_length': 5.404109589041096, '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}}
Fast image reconstruction algorithms combining half-quadratic regularization and preconditioning

We focus on image deconvolution and image reconstruction problems where a sought image is recovered from degraded observed data. The solution is defined to be the minimizer of an objective function combining a data-fidelity term and an edge-preserving, convex regularization term. Our objective is to speed up the calculation of the solution in a wide range of situations. To this end, we propose a method applying pertinent preconditioning to an adapted half-quadratic equivalent form of the objective function. The optimal solution is then found using an alternating minimization (AM) scheme. We focus specifically on Huber regularization. We exhibit the possibility of getting very fast calculations while preserving the edges in the solution. Preliminary numerical results are reported to illustrate the effectiveness of our method.